./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-nondet/nondet-array-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-nondet/nondet-array-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2796c466e7d8363340777400f1e90c0fc7eb53096f49ded0fb8aa6814bf1ef21 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:39:26,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:39:26,363 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:39:26,394 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:39:26,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:39:26,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:39:26,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:39:26,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:39:26,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:39:26,407 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:39:26,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:39:26,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:39:26,409 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:39:26,410 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:39:26,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:39:26,413 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:39:26,415 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:39:26,416 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:39:26,421 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:39:26,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:39:26,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:39:26,429 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:39:26,429 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:39:26,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:39:26,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:39:26,432 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:39:26,432 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:39:26,433 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:39:26,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:39:26,435 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:39:26,435 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:39:26,436 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:39:26,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:39:26,439 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:39:26,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:39:26,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:39:26,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:39:26,441 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:39:26,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:39:26,441 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:39:26,442 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:39:26,443 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:26,467 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:39:26,467 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:39:26,468 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:39:26,468 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:39:26,469 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:39:26,469 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:39:26,469 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:39:26,469 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:39:26,469 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:39:26,470 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:39:26,470 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:39:26,471 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:39:26,471 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:39:26,471 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:39:26,471 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:39:26,471 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:39:26,471 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:39:26,472 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:39:26,472 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:39:26,472 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:39:26,472 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:39:26,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:39:26,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:39:26,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:39:26,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:39:26,473 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:39:26,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:39:26,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:39:26,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:39:26,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:39:26,475 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:39:26,475 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:39:26,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:39:26,476 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 -> 2796c466e7d8363340777400f1e90c0fc7eb53096f49ded0fb8aa6814bf1ef21 [2022-02-20 20:39:26,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:39:26,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:39:26,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:39:26,733 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:39:26,734 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:39:26,735 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-nondet/nondet-array-2.i [2022-02-20 20:39:26,798 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/630212dae/b0ff58ae3ec441d092b3996356eeb738/FLAG66bdc860f [2022-02-20 20:39:27,253 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:39:27,254 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-array-2.i [2022-02-20 20:39:27,276 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/630212dae/b0ff58ae3ec441d092b3996356eeb738/FLAG66bdc860f [2022-02-20 20:39:27,287 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/630212dae/b0ff58ae3ec441d092b3996356eeb738 [2022-02-20 20:39:27,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:39:27,291 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:39:27,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:39:27,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:39:27,295 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:39:27,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:39:27" (1/1) ... [2022-02-20 20:39:27,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71f5eb8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:39:27, skipping insertion in model container [2022-02-20 20:39:27,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:39:27" (1/1) ... [2022-02-20 20:39:27,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:39:27,334 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:39:27,637 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-2.i[30035,30048] [2022-02-20 20:39:27,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:39:27,665 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:39:27,706 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-2.i[30035,30048] [2022-02-20 20:39:27,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:39:27,736 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:39:27,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:39:27 WrapperNode [2022-02-20 20:39:27,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:39:27,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:39:27,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:39:27,738 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:39:27,742 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:27" (1/1) ... [2022-02-20 20:39:27,757 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:27" (1/1) ... [2022-02-20 20:39:27,773 INFO L137 Inliner]: procedures = 170, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2022-02-20 20:39:27,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:39:27,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:39:27,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:39:27,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:39:27,779 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:27" (1/1) ... [2022-02-20 20:39:27,779 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:27" (1/1) ... [2022-02-20 20:39:27,781 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:27" (1/1) ... [2022-02-20 20:39:27,782 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:27" (1/1) ... [2022-02-20 20:39:27,791 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:27" (1/1) ... [2022-02-20 20:39:27,794 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:27" (1/1) ... [2022-02-20 20:39:27,796 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:27" (1/1) ... [2022-02-20 20:39:27,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:39:27,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:39:27,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:39:27,805 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:39:27,808 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:39:27" (1/1) ... [2022-02-20 20:39:27,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:39:27,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:39:27,832 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:27,834 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:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 20:39:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 20:39:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:39:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2022-02-20 20:39:27,874 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2022-02-20 20:39:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:39:27,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:39:27,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:39:27,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:39:27,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:39:27,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:39:27,877 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:28,019 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:39:28,031 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:39:28,204 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:39:28,211 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:39:28,212 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 20:39:28,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:39:28 BoogieIcfgContainer [2022-02-20 20:39:28,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:39:28,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:39:28,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:39:28,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:39:28,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:39:27" (1/3) ... [2022-02-20 20:39:28,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2565c059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:39:28, skipping insertion in model container [2022-02-20 20:39:28,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:39:27" (2/3) ... [2022-02-20 20:39:28,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2565c059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:39:28, skipping insertion in model container [2022-02-20 20:39:28,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:39:28" (3/3) ... [2022-02-20 20:39:28,219 INFO L111 eAbstractionObserver]: Analyzing ICFG nondet-array-2.i [2022-02-20 20:39:28,223 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:39:28,223 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:39:28,223 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:39:28,223 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:39:28,287 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:28,288 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:28,288 WARN L322 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:28,288 WARN L322 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:28,288 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:28,289 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:28,289 WARN L322 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:28,289 WARN L322 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:28,289 WARN L322 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:28,290 WARN L322 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:28,290 WARN L322 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:28,293 WARN L322 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:28,293 WARN L322 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:28,293 WARN L322 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:28,296 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:28,296 WARN L322 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:28,297 WARN L322 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:28,297 WARN L322 ript$VariableManager]: TermVariabe thrThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:28,297 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:28,306 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-02-20 20:39:28,336 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:39:28,340 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:28,340 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 20:39:28,351 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 88 transitions, 184 flow [2022-02-20 20:39:28,396 INFO L129 PetriNetUnfolder]: 12/126 cut-off events. [2022-02-20 20:39:28,396 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:39:28,398 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:28,398 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 88 transitions, 184 flow [2022-02-20 20:39:28,401 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 78 transitions, 164 flow [2022-02-20 20:39:28,412 INFO L129 PetriNetUnfolder]: 6/74 cut-off events. [2022-02-20 20:39:28,413 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:39:28,413 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:39:28,413 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:28,414 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:39:28,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:39:28,419 INFO L85 PathProgramCache]: Analyzing trace with hash -744396743, now seen corresponding path program 1 times [2022-02-20 20:39:28,426 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:39:28,427 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378260309] [2022-02-20 20:39:28,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:39:28,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:39:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:39:28,597 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:28,598 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:28,598 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:28,598 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:28,598 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:28,599 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:28,599 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:28,599 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:28,599 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:28,600 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:28,600 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:28,600 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:28,600 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:28,600 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:28,601 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:28,601 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:28,601 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:28,601 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:28,601 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:28,602 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:28,602 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:28,602 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:28,603 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:28,604 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:28,605 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:28,605 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:28,605 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:28,605 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:28,606 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:28,606 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:28,606 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:28,606 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:28,607 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:28,607 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:28,608 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:28,608 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:28,608 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:28,608 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:28,608 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| 10) 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:28,608 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:28,609 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:28,609 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:28,610 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:28,611 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:28,614 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:39:28,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378260309] [2022-02-20 20:39:28,615 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378260309] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:39:28,615 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:39:28,616 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 20:39:28,619 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27143885] [2022-02-20 20:39:28,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:39:28,631 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:28,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:39:28,641 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:28,698 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:28,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 20:39:28,698 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:39:28,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 20:39:28,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 20:39:28,719 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 88 [2022-02-20 20:39:28,723 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:28,723 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:39:28,723 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 88 [2022-02-20 20:39:28,724 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:39:28,767 INFO L129 PetriNetUnfolder]: 3/99 cut-off events. [2022-02-20 20:39:28,768 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-02-20 20:39:28,768 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:28,769 INFO L132 encePairwiseOnDemand]: 84/88 looper letters, 2 selfloop transitions, 0 changer transitions 1/74 dead transitions. [2022-02-20 20:39:28,769 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 74 transitions, 160 flow [2022-02-20 20:39:28,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 20:39:28,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-02-20 20:39:28,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 166 transitions. [2022-02-20 20:39:28,782 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9431818181818182 [2022-02-20 20:39:28,782 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 166 transitions. [2022-02-20 20:39:28,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 166 transitions. [2022-02-20 20:39:28,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:39:28,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 166 transitions. [2022-02-20 20:39:28,786 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:28,788 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:28,788 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:28,789 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:28,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 74 transitions, 160 flow [2022-02-20 20:39:28,792 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:28,794 INFO L242 Difference]: Finished difference. Result has 76 places, 73 transitions, 154 flow [2022-02-20 20:39:28,795 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:28,797 INFO L334 CegarLoopForPetriNet]: 75 programPoint places, 1 predicate places. [2022-02-20 20:39:28,797 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 73 transitions, 154 flow [2022-02-20 20:39:28,811 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:28,812 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:28,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:39:28,813 INFO L470 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 154 flow [2022-02-20 20:39:28,813 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:28,813 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:39:28,813 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:28,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:39:28,813 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:39:28,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:39:28,814 INFO L85 PathProgramCache]: Analyzing trace with hash -53406567, now seen corresponding path program 1 times [2022-02-20 20:39:28,814 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:39:28,814 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966686654] [2022-02-20 20:39:28,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:39:28,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:39:28,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:39:28,905 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:28,905 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:28,905 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:28,905 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:28,905 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:28,905 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:28,906 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:28,906 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:28,906 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:28,906 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:28,906 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:28,906 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:28,906 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:28,907 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:28,907 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:28,907 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:28,907 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:28,907 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:28,907 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:28,907 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:28,908 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:28,908 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:28,908 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:28,908 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:28,908 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:28,908 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] {337#true} is VALID [2022-02-20 20:39:28,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {337#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] {337#true} is VALID [2022-02-20 20:39:28,909 INFO L290 TraceCheckUtils]: 27: Hoare triple {337#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] {337#true} is VALID [2022-02-20 20:39:28,909 INFO L290 TraceCheckUtils]: 28: Hoare triple {337#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[] {337#true} is VALID [2022-02-20 20:39:28,909 INFO L290 TraceCheckUtils]: 29: Hoare triple {337#true} [152] L686-1-->L702: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {337#true} is VALID [2022-02-20 20:39:28,909 INFO L290 TraceCheckUtils]: 30: Hoare triple {337#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] {337#true} is VALID [2022-02-20 20:39:28,909 INFO L290 TraceCheckUtils]: 31: Hoare triple {337#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[] {337#true} is VALID [2022-02-20 20:39:28,909 INFO L290 TraceCheckUtils]: 32: Hoare triple {337#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] {337#true} is VALID [2022-02-20 20:39:28,909 INFO L290 TraceCheckUtils]: 33: Hoare triple {337#true} [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[] {337#true} is VALID [2022-02-20 20:39:28,910 INFO L290 TraceCheckUtils]: 34: Hoare triple {337#true} [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] {339#(<= |ULTIMATE.start_main_~sum~0#1| 10)} is VALID [2022-02-20 20:39:28,910 INFO L290 TraceCheckUtils]: 35: Hoare triple {339#(<= |ULTIMATE.start_main_~sum~0#1| 10)} [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] {339#(<= |ULTIMATE.start_main_~sum~0#1| 10)} is VALID [2022-02-20 20:39:28,911 INFO L290 TraceCheckUtils]: 36: Hoare triple {339#(<= |ULTIMATE.start_main_~sum~0#1| 10)} [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[] {339#(<= |ULTIMATE.start_main_~sum~0#1| 10)} is VALID [2022-02-20 20:39:28,911 INFO L290 TraceCheckUtils]: 37: Hoare triple {339#(<= |ULTIMATE.start_main_~sum~0#1| 10)} [158] L709-7-->L712: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {339#(<= |ULTIMATE.start_main_~sum~0#1| 10)} is VALID [2022-02-20 20:39:28,911 INFO L290 TraceCheckUtils]: 38: Hoare triple {339#(<= |ULTIMATE.start_main_~sum~0#1| 10)} [204] L712-->L712-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (<= |v_ULTIMATE.start_main_~sum~0#1_5| 10) 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] {340#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:39:28,912 INFO L290 TraceCheckUtils]: 39: Hoare triple {340#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [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] {340#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:39:28,912 INFO L290 TraceCheckUtils]: 40: Hoare triple {340#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [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] {341#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:39:28,913 INFO L290 TraceCheckUtils]: 41: Hoare triple {341#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} [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:28,913 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:28,913 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:28,913 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:39:28,913 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966686654] [2022-02-20 20:39:28,913 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966686654] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:39:28,914 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:39:28,914 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:39:28,914 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038306316] [2022-02-20 20:39:28,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:39:28,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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:28,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:39:28,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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:28,943 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:28,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:39:28,943 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:39:28,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:39:28,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:39:28,945 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 88 [2022-02-20 20:39:28,945 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 73.2) internal successors, (366), 5 states have internal predecessors, (366), 0 states have call successors, (0), 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:28,945 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:39:28,945 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 88 [2022-02-20 20:39:28,945 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:39:29,002 INFO L129 PetriNetUnfolder]: 3/114 cut-off events. [2022-02-20 20:39:29,003 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-02-20 20:39:29,003 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 114 events. 3/114 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 190 event pairs, 0 based on Foata normal form. 2/108 useless extension candidates. Maximal degree in co-relation 141. Up to 16 conditions per place. [2022-02-20 20:39:29,003 INFO L132 encePairwiseOnDemand]: 83/88 looper letters, 8 selfloop transitions, 2 changer transitions 3/77 dead transitions. [2022-02-20 20:39:29,003 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 77 transitions, 188 flow [2022-02-20 20:39:29,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 20:39:29,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-02-20 20:39:29,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 374 transitions. [2022-02-20 20:39:29,009 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.85 [2022-02-20 20:39:29,009 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 374 transitions. [2022-02-20 20:39:29,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 374 transitions. [2022-02-20 20:39:29,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:39:29,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 374 transitions. [2022-02-20 20:39:29,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 74.8) internal successors, (374), 5 states have internal predecessors, (374), 0 states have call successors, (0), 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,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 0 states have call successors, (0), 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,012 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 0 states have call successors, (0), 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,012 INFO L186 Difference]: Start difference. First operand has 76 places, 73 transitions, 154 flow. Second operand 5 states and 374 transitions. [2022-02-20 20:39:29,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 77 transitions, 188 flow [2022-02-20 20:39:29,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 77 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-02-20 20:39:29,014 INFO L242 Difference]: Finished difference. Result has 82 places, 74 transitions, 170 flow [2022-02-20 20:39:29,014 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=82, PETRI_TRANSITIONS=74} [2022-02-20 20:39:29,015 INFO L334 CegarLoopForPetriNet]: 75 programPoint places, 7 predicate places. [2022-02-20 20:39:29,015 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 74 transitions, 170 flow [2022-02-20 20:39:29,023 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 281 states, 275 states have (on average 1.6836363636363636) internal successors, (463), 280 states have internal predecessors, (463), 0 states have call successors, (0), 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,024 INFO L78 Accepts]: Start accepts. Automaton has has 281 states, 275 states have (on average 1.6836363636363636) internal successors, (463), 280 states have internal predecessors, (463), 0 states have call successors, (0), 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,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:39:29,024 INFO L470 AbstractCegarLoop]: Abstraction has has 82 places, 74 transitions, 170 flow [2022-02-20 20:39:29,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.2) internal successors, (366), 5 states have internal predecessors, (366), 0 states have call successors, (0), 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,025 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:39:29,025 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:29,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:39:29,025 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:39:29,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:39:29,025 INFO L85 PathProgramCache]: Analyzing trace with hash -658806082, now seen corresponding path program 1 times [2022-02-20 20:39:29,026 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:39:29,026 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401569021] [2022-02-20 20:39:29,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:39:29,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:39:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:39:29,053 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 20:39:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:39:29,085 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 20:39:29,086 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 20:39:29,086 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 2 remaining) [2022-02-20 20:39:29,088 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 20:39:29,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:39:29,090 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 20:39:29,091 WARN L235 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-02-20 20:39:29,091 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-02-20 20:39:29,110 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,110 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,110 WARN L322 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,110 WARN L322 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,110 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,110 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,110 WARN L322 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,110 WARN L322 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,110 WARN L322 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,110 WARN L322 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,110 WARN L322 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,111 WARN L322 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,111 WARN L322 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,111 WARN L322 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,111 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,111 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,111 WARN L322 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,111 WARN L322 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,111 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,111 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,112 WARN L322 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,112 WARN L322 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,112 WARN L322 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,112 WARN L322 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,112 WARN L322 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,112 WARN L322 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,113 WARN L322 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,113 WARN L322 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,113 WARN L322 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,113 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,113 WARN L322 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,114 WARN L322 ript$VariableManager]: TermVariabe |thrThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,114 WARN L322 ript$VariableManager]: TermVariabe thrThread1of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,116 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,116 WARN L322 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,116 WARN L322 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,116 WARN L322 ript$VariableManager]: TermVariabe thrThread2of2ForFork0_~t~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,116 WARN L322 ript$VariableManager]: TermVariabe |thrThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:39:29,123 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-02-20 20:39:29,130 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:39:29,132 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:29,132 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 20:39:29,133 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 92 places, 95 transitions, 208 flow [2022-02-20 20:39:29,147 INFO L129 PetriNetUnfolder]: 23/217 cut-off events. [2022-02-20 20:39:29,147 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-02-20 20:39:29,148 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:29,148 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 95 transitions, 208 flow [2022-02-20 20:39:29,149 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 85 transitions, 188 flow [2022-02-20 20:39:29,153 INFO L129 PetriNetUnfolder]: 7/76 cut-off events. [2022-02-20 20:39:29,153 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:39:29,153 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:39:29,154 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,154 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:39:29,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:39:29,154 INFO L85 PathProgramCache]: Analyzing trace with hash 477382265, now seen corresponding path program 1 times [2022-02-20 20:39:29,154 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:39:29,154 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417941606] [2022-02-20 20:39:29,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:39:29,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:39:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:39:29,186 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:29,186 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:29,187 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:29,187 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:29,187 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:29,187 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:29,187 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:29,187 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:29,187 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:29,188 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:29,188 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:29,188 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:29,188 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:29,188 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:29,188 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:29,188 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:29,189 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:29,189 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:29,189 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:29,189 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:29,189 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:29,189 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:29,189 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:29,189 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:29,190 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:29,190 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:29,190 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:29,190 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:29,190 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:29,190 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:29,190 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:29,190 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:29,191 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:29,195 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:29,195 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:29,196 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:29,196 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:29,196 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:29,196 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| 10) 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:29,196 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:29,196 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:29,196 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:29,197 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:29,197 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,197 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:39:29,197 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417941606] [2022-02-20 20:39:29,197 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417941606] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:39:29,197 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:39:29,197 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 20:39:29,197 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102227971] [2022-02-20 20:39:29,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:39:29,198 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:29,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:39:29,198 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:29,234 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,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 20:39:29,234 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:39:29,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 20:39:29,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 20:39:29,235 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 95 [2022-02-20 20:39:29,235 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:29,235 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:39:29,235 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 95 [2022-02-20 20:39:29,235 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:39:29,268 INFO L129 PetriNetUnfolder]: 7/165 cut-off events. [2022-02-20 20:39:29,268 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-02-20 20:39:29,269 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:29,269 INFO L132 encePairwiseOnDemand]: 91/95 looper letters, 4 selfloop transitions, 0 changer transitions 1/81 dead transitions. [2022-02-20 20:39:29,269 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 81 transitions, 188 flow [2022-02-20 20:39:29,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 20:39:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-02-20 20:39:29,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 178 transitions. [2022-02-20 20:39:29,272 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9368421052631579 [2022-02-20 20:39:29,273 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 178 transitions. [2022-02-20 20:39:29,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 178 transitions. [2022-02-20 20:39:29,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:39:29,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 178 transitions. [2022-02-20 20:39:29,273 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:29,274 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:29,274 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:29,274 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:29,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 81 transitions, 188 flow [2022-02-20 20:39:29,277 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:29,278 INFO L242 Difference]: Finished difference. Result has 84 places, 80 transitions, 178 flow [2022-02-20 20:39:29,278 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:29,279 INFO L334 CegarLoopForPetriNet]: 83 programPoint places, 1 predicate places. [2022-02-20 20:39:29,279 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 80 transitions, 178 flow [2022-02-20 20:39:29,302 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:29,306 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:29,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:39:29,306 INFO L470 AbstractCegarLoop]: Abstraction has has 84 places, 80 transitions, 178 flow [2022-02-20 20:39:29,306 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:29,306 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:39:29,306 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,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:39:29,307 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:39:29,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:39:29,307 INFO L85 PathProgramCache]: Analyzing trace with hash 280868760, now seen corresponding path program 1 times [2022-02-20 20:39:29,307 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:39:29,307 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569714374] [2022-02-20 20:39:29,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:39:29,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:39:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:39:29,354 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:29,354 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:29,354 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:29,355 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:29,355 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:29,355 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:29,355 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:29,355 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:29,355 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:29,355 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:29,355 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:29,355 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:29,356 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:29,356 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:29,356 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:29,356 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:29,356 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:29,356 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:29,356 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:29,356 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:29,357 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:29,357 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:29,357 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:29,357 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:29,357 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:29,357 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] {1617#true} is VALID [2022-02-20 20:39:29,357 INFO L290 TraceCheckUtils]: 26: Hoare triple {1617#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] {1617#true} is VALID [2022-02-20 20:39:29,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {1617#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] {1617#true} is VALID [2022-02-20 20:39:29,358 INFO L290 TraceCheckUtils]: 28: Hoare triple {1617#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[] {1617#true} is VALID [2022-02-20 20:39:29,358 INFO L290 TraceCheckUtils]: 29: Hoare triple {1617#true} [247] L686-1-->L702: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1617#true} is VALID [2022-02-20 20:39:29,359 INFO L290 TraceCheckUtils]: 30: Hoare triple {1617#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] {1617#true} is VALID [2022-02-20 20:39:29,359 INFO L290 TraceCheckUtils]: 31: Hoare triple {1617#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[] {1617#true} is VALID [2022-02-20 20:39:29,359 INFO L290 TraceCheckUtils]: 32: Hoare triple {1617#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] {1617#true} is VALID [2022-02-20 20:39:29,359 INFO L290 TraceCheckUtils]: 33: Hoare triple {1617#true} [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[] {1617#true} is VALID [2022-02-20 20:39:29,359 INFO L290 TraceCheckUtils]: 34: Hoare triple {1617#true} [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] {1619#(<= |ULTIMATE.start_main_~sum~0#1| 10)} is VALID [2022-02-20 20:39:29,360 INFO L290 TraceCheckUtils]: 35: Hoare triple {1619#(<= |ULTIMATE.start_main_~sum~0#1| 10)} [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] {1619#(<= |ULTIMATE.start_main_~sum~0#1| 10)} is VALID [2022-02-20 20:39:29,360 INFO L290 TraceCheckUtils]: 36: Hoare triple {1619#(<= |ULTIMATE.start_main_~sum~0#1| 10)} [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[] {1619#(<= |ULTIMATE.start_main_~sum~0#1| 10)} is VALID [2022-02-20 20:39:29,360 INFO L290 TraceCheckUtils]: 37: Hoare triple {1619#(<= |ULTIMATE.start_main_~sum~0#1| 10)} [253] L709-7-->L712: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1619#(<= |ULTIMATE.start_main_~sum~0#1| 10)} is VALID [2022-02-20 20:39:29,361 INFO L290 TraceCheckUtils]: 38: Hoare triple {1619#(<= |ULTIMATE.start_main_~sum~0#1| 10)} [299] L712-->L712-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (<= |v_ULTIMATE.start_main_~sum~0#1_5| 10) 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] {1620#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:39:29,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {1620#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [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] {1620#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:39:29,361 INFO L290 TraceCheckUtils]: 40: Hoare triple {1620#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [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] {1621#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:39:29,362 INFO L290 TraceCheckUtils]: 41: Hoare triple {1621#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} [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:29,362 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:29,362 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,362 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:39:29,362 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569714374] [2022-02-20 20:39:29,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569714374] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:39:29,363 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:39:29,363 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:39:29,363 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116046104] [2022-02-20 20:39:29,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:39:29,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:39:29,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 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,389 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,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:39:29,389 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:39:29,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:39:29,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:39:29,390 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 95 [2022-02-20 20:39:29,391 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 80 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 78.2) internal successors, (391), 5 states have internal predecessors, (391), 0 states have call successors, (0), 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,391 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:39:29,391 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 95 [2022-02-20 20:39:29,391 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:39:29,454 INFO L129 PetriNetUnfolder]: 7/196 cut-off events. [2022-02-20 20:39:29,454 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-02-20 20:39:29,454 INFO L84 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 196 events. 7/196 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 462 event pairs, 0 based on Foata normal form. 4/185 useless extension candidates. Maximal degree in co-relation 254. Up to 32 conditions per place. [2022-02-20 20:39:29,455 INFO L132 encePairwiseOnDemand]: 90/95 looper letters, 10 selfloop transitions, 2 changer transitions 3/84 dead transitions. [2022-02-20 20:39:29,455 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 84 transitions, 216 flow [2022-02-20 20:39:29,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 20:39:29,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-02-20 20:39:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 401 transitions. [2022-02-20 20:39:29,458 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8442105263157895 [2022-02-20 20:39:29,458 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 401 transitions. [2022-02-20 20:39:29,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 401 transitions. [2022-02-20 20:39:29,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:39:29,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 401 transitions. [2022-02-20 20:39:29,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 0 states have call successors, (0), 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,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:39:29,460 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:39:29,461 INFO L186 Difference]: Start difference. First operand has 84 places, 80 transitions, 178 flow. Second operand 5 states and 401 transitions. [2022-02-20 20:39:29,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 84 transitions, 216 flow [2022-02-20 20:39:29,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 84 transitions, 216 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-02-20 20:39:29,463 INFO L242 Difference]: Finished difference. Result has 90 places, 81 transitions, 194 flow [2022-02-20 20:39:29,463 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=90, PETRI_TRANSITIONS=81} [2022-02-20 20:39:29,464 INFO L334 CegarLoopForPetriNet]: 83 programPoint places, 7 predicate places. [2022-02-20 20:39:29,464 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 81 transitions, 194 flow [2022-02-20 20:39:29,504 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1763 states, 1753 states have (on average 2.4409583571021107) internal successors, (4279), 1762 states have internal predecessors, (4279), 0 states have call successors, (0), 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,506 INFO L78 Accepts]: Start accepts. Automaton has has 1763 states, 1753 states have (on average 2.4409583571021107) internal successors, (4279), 1762 states have internal predecessors, (4279), 0 states have call successors, (0), 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,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:39:29,507 INFO L470 AbstractCegarLoop]: Abstraction has has 90 places, 81 transitions, 194 flow [2022-02-20 20:39:29,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.2) internal successors, (391), 5 states have internal predecessors, (391), 0 states have call successors, (0), 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,507 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:39:29,507 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] [2022-02-20 20:39:29,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:39:29,507 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:39:29,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:39:29,508 INFO L85 PathProgramCache]: Analyzing trace with hash -123182927, now seen corresponding path program 1 times [2022-02-20 20:39:29,508 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:39:29,508 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027017646] [2022-02-20 20:39:29,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:39:29,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:39:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:39:29,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {3394#true} [282] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3394#true} is VALID [2022-02-20 20:39:29,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {3394#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] {3394#true} is VALID [2022-02-20 20:39:29,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {3394#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[] {3394#true} is VALID [2022-02-20 20:39:29,559 INFO L290 TraceCheckUtils]: 3: Hoare triple {3394#true} [294] L-1-2-->L683: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {3394#true} is VALID [2022-02-20 20:39:29,559 INFO L290 TraceCheckUtils]: 4: Hoare triple {3394#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[] {3394#true} is VALID [2022-02-20 20:39:29,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {3394#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[] {3394#true} is VALID [2022-02-20 20:39:29,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {3394#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[] {3394#true} is VALID [2022-02-20 20:39:29,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {3394#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[] {3394#true} is VALID [2022-02-20 20:39:29,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {3394#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] {3394#true} is VALID [2022-02-20 20:39:29,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {3394#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[] {3394#true} is VALID [2022-02-20 20:39:29,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {3394#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] {3394#true} is VALID [2022-02-20 20:39:29,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {3394#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] {3394#true} is VALID [2022-02-20 20:39:29,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {3394#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] {3394#true} is VALID [2022-02-20 20:39:29,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {3394#true} [296] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3394#true} is VALID [2022-02-20 20:39:29,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {3394#true} [268] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3394#true} is VALID [2022-02-20 20:39:29,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {3394#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] {3394#true} is VALID [2022-02-20 20:39:29,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {3394#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] {3394#true} is VALID [2022-02-20 20:39:29,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {3394#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] {3394#true} is VALID [2022-02-20 20:39:29,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {3394#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] {3394#true} is VALID [2022-02-20 20:39:29,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {3394#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] {3394#true} is VALID [2022-02-20 20:39:29,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {3394#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] {3394#true} is VALID [2022-02-20 20:39:29,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {3394#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] {3394#true} is VALID [2022-02-20 20:39:29,562 INFO L290 TraceCheckUtils]: 22: Hoare triple {3394#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] {3394#true} is VALID [2022-02-20 20:39:29,562 INFO L290 TraceCheckUtils]: 23: Hoare triple {3394#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] {3394#true} is VALID [2022-02-20 20:39:29,562 INFO L290 TraceCheckUtils]: 24: Hoare triple {3394#true} [289] L701-->L701-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3394#true} is VALID [2022-02-20 20:39:29,562 INFO L290 TraceCheckUtils]: 25: Hoare triple {3394#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] {3394#true} is VALID [2022-02-20 20:39:29,562 INFO L290 TraceCheckUtils]: 26: Hoare triple {3394#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] {3394#true} is VALID [2022-02-20 20:39:29,563 INFO L290 TraceCheckUtils]: 27: Hoare triple {3394#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] {3394#true} is VALID [2022-02-20 20:39:29,563 INFO L290 TraceCheckUtils]: 28: Hoare triple {3394#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[] {3394#true} is VALID [2022-02-20 20:39:29,563 INFO L290 TraceCheckUtils]: 29: Hoare triple {3394#true} [247] L686-1-->L702: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3394#true} is VALID [2022-02-20 20:39:29,563 INFO L290 TraceCheckUtils]: 30: Hoare triple {3394#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] {3396#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 20:39:29,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {3396#(= |ULTIMATE.start_main_~i~0#1| 0)} [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[] {3397#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 20:39:29,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {3397#(<= |ULTIMATE.start_main_~n~0#1| 0)} [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] {3397#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 20:39:29,564 INFO L290 TraceCheckUtils]: 33: Hoare triple {3397#(<= |ULTIMATE.start_main_~n~0#1| 0)} [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[] {3397#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 20:39:29,565 INFO L290 TraceCheckUtils]: 34: Hoare triple {3397#(<= |ULTIMATE.start_main_~n~0#1| 0)} [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] {3397#(<= |ULTIMATE.start_main_~n~0#1| 0)} is VALID [2022-02-20 20:39:29,565 INFO L290 TraceCheckUtils]: 35: Hoare triple {3397#(<= |ULTIMATE.start_main_~n~0#1| 0)} [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] {3398#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-20 20:39:29,565 INFO L290 TraceCheckUtils]: 36: Hoare triple {3398#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0))} [273] 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[] {3395#false} is VALID [2022-02-20 20:39:29,566 INFO L290 TraceCheckUtils]: 37: Hoare triple {3395#false} [220] 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] {3395#false} is VALID [2022-02-20 20:39:29,566 INFO L290 TraceCheckUtils]: 38: Hoare triple {3395#false} [300] 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] {3395#false} is VALID [2022-02-20 20:39:29,566 INFO L290 TraceCheckUtils]: 39: Hoare triple {3395#false} [263] 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] {3395#false} is VALID [2022-02-20 20:39:29,566 INFO L290 TraceCheckUtils]: 40: Hoare triple {3395#false} [259] 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] {3395#false} is VALID [2022-02-20 20:39:29,567 INFO L290 TraceCheckUtils]: 41: Hoare triple {3395#false} [281] 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] {3395#false} is VALID [2022-02-20 20:39:29,567 INFO L290 TraceCheckUtils]: 42: Hoare triple {3395#false} [267] 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] {3395#false} is VALID [2022-02-20 20:39:29,567 INFO L290 TraceCheckUtils]: 43: Hoare triple {3395#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[] {3395#false} is VALID [2022-02-20 20:39:29,567 INFO L290 TraceCheckUtils]: 44: Hoare triple {3395#false} [253] L709-7-->L712: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3395#false} is VALID [2022-02-20 20:39:29,567 INFO L290 TraceCheckUtils]: 45: Hoare triple {3395#false} [299] L712-->L712-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (<= |v_ULTIMATE.start_main_~sum~0#1_5| 10) 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] {3395#false} is VALID [2022-02-20 20:39:29,567 INFO L290 TraceCheckUtils]: 46: Hoare triple {3395#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] {3395#false} is VALID [2022-02-20 20:39:29,567 INFO L290 TraceCheckUtils]: 47: Hoare triple {3395#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] {3395#false} is VALID [2022-02-20 20:39:29,567 INFO L290 TraceCheckUtils]: 48: Hoare triple {3395#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[] {3395#false} is VALID [2022-02-20 20:39:29,567 INFO L290 TraceCheckUtils]: 49: Hoare triple {3395#false} [292] L689-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3395#false} is VALID [2022-02-20 20:39:29,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:39:29,568 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:39:29,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027017646] [2022-02-20 20:39:29,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027017646] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:39:29,568 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:39:29,568 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:39:29,568 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678256230] [2022-02-20 20:39:29,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:39:29,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2022-02-20 20:39:29,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:39:29,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 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,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:39:29,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:39:29,598 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:39:29,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:39:29,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:39:29,599 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 95 [2022-02-20 20:39:29,600 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 81 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 65.8) internal successors, (329), 5 states have internal predecessors, (329), 0 states have call successors, (0), 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,600 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:39:29,600 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 95 [2022-02-20 20:39:29,600 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:39:29,694 INFO L129 PetriNetUnfolder]: 7/190 cut-off events. [2022-02-20 20:39:29,694 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-02-20 20:39:29,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 190 events. 7/190 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 409 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 317. Up to 49 conditions per place. [2022-02-20 20:39:29,695 INFO L132 encePairwiseOnDemand]: 84/95 looper letters, 34 selfloop transitions, 6 changer transitions 7/102 dead transitions. [2022-02-20 20:39:29,695 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 102 transitions, 336 flow [2022-02-20 20:39:29,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 20:39:29,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-02-20 20:39:29,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 301 transitions. [2022-02-20 20:39:29,698 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7921052631578948 [2022-02-20 20:39:29,698 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 301 transitions. [2022-02-20 20:39:29,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 301 transitions. [2022-02-20 20:39:29,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:39:29,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 301 transitions. [2022-02-20 20:39:29,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 75.25) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 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,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 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,700 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 0 states have call successors, (0), 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,700 INFO L186 Difference]: Start difference. First operand has 90 places, 81 transitions, 194 flow. Second operand 4 states and 301 transitions. [2022-02-20 20:39:29,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 102 transitions, 336 flow