./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix018_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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-wmm/mix018_pso.oepc.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 3cb13b9ba46282285896746c6a568230a9b103a6 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-29 22:11:25,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-29 22:11:25,659 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-29 22:11:25,690 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-29 22:11:25,691 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-29 22:11:25,691 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-29 22:11:25,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-29 22:11:25,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-29 22:11:25,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-29 22:11:25,713 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-29 22:11:25,721 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-29 22:11:25,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-29 22:11:25,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-29 22:11:25,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-29 22:11:25,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-29 22:11:25,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-29 22:11:25,732 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-29 22:11:25,732 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-29 22:11:25,734 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-29 22:11:25,737 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-29 22:11:25,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-29 22:11:25,740 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-29 22:11:25,741 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-29 22:11:25,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-29 22:11:25,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-29 22:11:25,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-29 22:11:25,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-29 22:11:25,748 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-29 22:11:25,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-29 22:11:25,749 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-29 22:11:25,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-29 22:11:25,750 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-29 22:11:25,751 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-29 22:11:25,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-29 22:11:25,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-29 22:11:25,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-29 22:11:25,753 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-29 22:11:25,753 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-29 22:11:25,753 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-29 22:11:25,754 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-29 22:11:25,755 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-29 22:11:25,758 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-29 22:11:25,787 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-29 22:11:25,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-29 22:11:25,788 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-29 22:11:25,788 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-29 22:11:25,790 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-29 22:11:25,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-29 22:11:25,790 INFO L138 SettingsManager]: * Use SBE=true [2021-08-29 22:11:25,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-29 22:11:25,790 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-29 22:11:25,790 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-29 22:11:25,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-29 22:11:25,791 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-29 22:11:25,791 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-29 22:11:25,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-29 22:11:25,791 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-29 22:11:25,792 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-29 22:11:25,792 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-29 22:11:25,792 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-29 22:11:25,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-29 22:11:25,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-29 22:11:25,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-29 22:11:25,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-29 22:11:25,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 22:11:25,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-29 22:11:25,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-29 22:11:25,793 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-29 22:11:25,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-29 22:11:25,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-29 22:11:25,793 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-29 22:11:25,794 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-29 22:11:25,794 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 -> 3cb13b9ba46282285896746c6a568230a9b103a6 [2021-08-29 22:11:26,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-29 22:11:26,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-29 22:11:26,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-29 22:11:26,102 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-29 22:11:26,103 INFO L275 PluginConnector]: CDTParser initialized [2021-08-29 22:11:26,104 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix018_pso.oepc.i [2021-08-29 22:11:26,147 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d65ddb34b/735fb7899714403f85d9893928591450/FLAGcecc201ce [2021-08-29 22:11:26,601 INFO L306 CDTParser]: Found 1 translation units. [2021-08-29 22:11:26,601 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix018_pso.oepc.i [2021-08-29 22:11:26,615 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d65ddb34b/735fb7899714403f85d9893928591450/FLAGcecc201ce [2021-08-29 22:11:26,887 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d65ddb34b/735fb7899714403f85d9893928591450 [2021-08-29 22:11:26,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-29 22:11:26,891 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-29 22:11:26,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-29 22:11:26,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-29 22:11:26,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-29 22:11:26,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 10:11:26" (1/1) ... [2021-08-29 22:11:26,898 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24984504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:11:26, skipping insertion in model container [2021-08-29 22:11:26,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 10:11:26" (1/1) ... [2021-08-29 22:11:26,903 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-29 22:11:26,945 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-29 22:11:27,039 WARN L228 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-wmm/mix018_pso.oepc.i[949,962] [2021-08-29 22:11:27,185 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 22:11:27,191 INFO L203 MainTranslator]: Completed pre-run [2021-08-29 22:11:27,199 WARN L228 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-wmm/mix018_pso.oepc.i[949,962] [2021-08-29 22:11:27,228 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 22:11:27,250 INFO L208 MainTranslator]: Completed translation [2021-08-29 22:11:27,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:11:27 WrapperNode [2021-08-29 22:11:27,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-29 22:11:27,251 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-29 22:11:27,251 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-29 22:11:27,252 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-29 22:11:27,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:11:27" (1/1) ... [2021-08-29 22:11:27,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:11:27" (1/1) ... [2021-08-29 22:11:27,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-29 22:11:27,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-29 22:11:27,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-29 22:11:27,286 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-29 22:11:27,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:11:27" (1/1) ... [2021-08-29 22:11:27,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:11:27" (1/1) ... [2021-08-29 22:11:27,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:11:27" (1/1) ... [2021-08-29 22:11:27,295 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:11:27" (1/1) ... [2021-08-29 22:11:27,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:11:27" (1/1) ... [2021-08-29 22:11:27,306 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:11:27" (1/1) ... [2021-08-29 22:11:27,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:11:27" (1/1) ... [2021-08-29 22:11:27,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-29 22:11:27,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-29 22:11:27,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-29 22:11:27,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-29 22:11:27,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:11:27" (1/1) ... [2021-08-29 22:11:27,317 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 22:11:27,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 22:11:27,358 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) [2021-08-29 22:11:27,428 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 [2021-08-29 22:11:27,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-29 22:11:27,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-29 22:11:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-29 22:11:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-29 22:11:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-29 22:11:27,433 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-29 22:11:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-29 22:11:27,433 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-29 22:11:27,433 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-29 22:11:27,433 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-29 22:11:27,434 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-08-29 22:11:27,434 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-08-29 22:11:27,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-29 22:11:27,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-29 22:11:27,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-29 22:11:27,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-29 22:11:27,436 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-29 22:11:28,068 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-29 22:11:28,068 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-29 22:11:28,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 10:11:28 BoogieIcfgContainer [2021-08-29 22:11:28,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-29 22:11:28,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-29 22:11:28,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-29 22:11:28,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-29 22:11:28,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 10:11:26" (1/3) ... [2021-08-29 22:11:28,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dcf41ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 10:11:28, skipping insertion in model container [2021-08-29 22:11:28,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:11:27" (2/3) ... [2021-08-29 22:11:28,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dcf41ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 10:11:28, skipping insertion in model container [2021-08-29 22:11:28,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 10:11:28" (3/3) ... [2021-08-29 22:11:28,075 INFO L111 eAbstractionObserver]: Analyzing ICFG mix018_pso.oepc.i [2021-08-29 22:11:28,078 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-29 22:11:28,078 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-29 22:11:28,078 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-29 22:11:28,078 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-29 22:11:28,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,103 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,103 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,103 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,104 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,104 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,104 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,104 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,104 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,104 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,104 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,104 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,104 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,104 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,104 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,104 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,106 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,106 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,107 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,107 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,107 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,109 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,109 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,109 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,109 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,110 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,113 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,115 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,115 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,115 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,116 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,128 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,128 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,128 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,129 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,130 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,130 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,130 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,131 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,131 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,131 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,134 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,139 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,144 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,145 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,145 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,145 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,145 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,145 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,145 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,145 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,145 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,145 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,146 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:11:28,146 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-29 22:11:28,186 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-29 22:11:28,197 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, mConcurrency=FINITE_AUTOMATA, 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 [2021-08-29 22:11:28,197 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-08-29 22:11:28,206 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-08-29 22:11:28,213 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 130 transitions, 280 flow [2021-08-29 22:11:28,215 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 130 transitions, 280 flow [2021-08-29 22:11:28,215 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 280 flow [2021-08-29 22:11:28,248 INFO L129 PetriNetUnfolder]: 2/126 cut-off events. [2021-08-29 22:11:28,248 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-29 22:11:28,251 INFO L84 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2021-08-29 22:11:28,253 INFO L116 LiptonReduction]: Number of co-enabled transitions 3104 [2021-08-29 22:11:32,409 INFO L131 LiptonReduction]: Checked pairs total: 9089 [2021-08-29 22:11:32,409 INFO L133 LiptonReduction]: Total number of compositions: 107 [2021-08-29 22:11:32,415 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 36 transitions, 92 flow [2021-08-29 22:11:32,566 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5174 states, 5171 states have (on average 4.175594662541094) internal successors, (21592), 5173 states have internal predecessors, (21592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:32,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 5174 states, 5171 states have (on average 4.175594662541094) internal successors, (21592), 5173 states have internal predecessors, (21592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:32,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-08-29 22:11:32,584 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:11:32,584 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-08-29 22:11:32,585 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:11:32,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:11:32,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1250656, now seen corresponding path program 1 times [2021-08-29 22:11:32,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:11:32,595 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728710774] [2021-08-29 22:11:32,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:11:32,595 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:11:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:11:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:11:32,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:11:32,775 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728710774] [2021-08-29 22:11:32,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728710774] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:11:32,776 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:11:32,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-08-29 22:11:32,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350472493] [2021-08-29 22:11:32,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 22:11:32,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:11:32,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 22:11:32,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 22:11:32,817 INFO L87 Difference]: Start difference. First operand has 5174 states, 5171 states have (on average 4.175594662541094) internal successors, (21592), 5173 states have internal predecessors, (21592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:32,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:11:32,916 INFO L93 Difference]: Finished difference Result 4212 states and 16640 transitions. [2021-08-29 22:11:32,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 22:11:32,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2021-08-29 22:11:32,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:11:32,998 INFO L225 Difference]: With dead ends: 4212 [2021-08-29 22:11:32,998 INFO L226 Difference]: Without dead ends: 4062 [2021-08-29 22:11:32,999 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.55ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 22:11:33,001 INFO L928 BasicCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.88ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.82ms IncrementalHoareTripleChecker+Time [2021-08-29 22:11:33,001 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 27 Invalid, 35 Unknown, 0 Unchecked, 0.88ms Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 35.82ms Time] [2021-08-29 22:11:33,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2021-08-29 22:11:33,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 4062. [2021-08-29 22:11:33,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 4061 states have (on average 3.9706968726914553) internal successors, (16125), 4061 states have internal predecessors, (16125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:33,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 16125 transitions. [2021-08-29 22:11:33,226 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 16125 transitions. Word has length 3 [2021-08-29 22:11:33,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:11:33,226 INFO L470 AbstractCegarLoop]: Abstraction has 4062 states and 16125 transitions. [2021-08-29 22:11:33,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:33,227 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 16125 transitions. [2021-08-29 22:11:33,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-29 22:11:33,232 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:11:33,232 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:11:33,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-29 22:11:33,232 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:11:33,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:11:33,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1883346086, now seen corresponding path program 1 times [2021-08-29 22:11:33,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:11:33,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142863751] [2021-08-29 22:11:33,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:11:33,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:11:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:11:33,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:11:33,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:11:33,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142863751] [2021-08-29 22:11:33,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142863751] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:11:33,322 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:11:33,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 22:11:33,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327111763] [2021-08-29 22:11:33,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 22:11:33,323 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:11:33,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 22:11:33,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:11:33,324 INFO L87 Difference]: Start difference. First operand 4062 states and 16125 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:33,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:11:33,516 INFO L93 Difference]: Finished difference Result 7562 states and 28740 transitions. [2021-08-29 22:11:33,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:11:33,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-08-29 22:11:33,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:11:33,559 INFO L225 Difference]: With dead ends: 7562 [2021-08-29 22:11:33,559 INFO L226 Difference]: Without dead ends: 6131 [2021-08-29 22:11:33,560 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.28ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:11:33,561 INFO L928 BasicCegarLoop]: 30 mSDtfsCounter, 39 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.43ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.09ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 78.09ms IncrementalHoareTripleChecker+Time [2021-08-29 22:11:33,561 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 66 Invalid, 81 Unknown, 0 Unchecked, 1.09ms Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 78.09ms Time] [2021-08-29 22:11:33,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6131 states. [2021-08-29 22:11:33,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6131 to 5255. [2021-08-29 22:11:33,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5255 states, 5254 states have (on average 3.897030833650552) internal successors, (20475), 5254 states have internal predecessors, (20475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:33,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5255 states to 5255 states and 20475 transitions. [2021-08-29 22:11:33,779 INFO L78 Accepts]: Start accepts. Automaton has 5255 states and 20475 transitions. Word has length 12 [2021-08-29 22:11:33,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:11:33,782 INFO L470 AbstractCegarLoop]: Abstraction has 5255 states and 20475 transitions. [2021-08-29 22:11:33,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:33,782 INFO L276 IsEmpty]: Start isEmpty. Operand 5255 states and 20475 transitions. [2021-08-29 22:11:33,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-29 22:11:33,787 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:11:33,787 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:11:33,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-29 22:11:33,788 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:11:33,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:11:33,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1745847075, now seen corresponding path program 1 times [2021-08-29 22:11:33,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:11:33,789 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509444493] [2021-08-29 22:11:33,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:11:33,790 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:11:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:11:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:11:33,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:11:33,911 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509444493] [2021-08-29 22:11:33,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509444493] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:11:33,911 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:11:33,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 22:11:33,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40338120] [2021-08-29 22:11:33,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 22:11:33,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:11:33,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 22:11:33,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:11:33,913 INFO L87 Difference]: Start difference. First operand 5255 states and 20475 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:34,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:11:34,068 INFO L93 Difference]: Finished difference Result 6361 states and 23837 transitions. [2021-08-29 22:11:34,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-29 22:11:34,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-08-29 22:11:34,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:11:34,104 INFO L225 Difference]: With dead ends: 6361 [2021-08-29 22:11:34,105 INFO L226 Difference]: Without dead ends: 5395 [2021-08-29 22:11:34,105 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 20.19ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:11:34,107 INFO L928 BasicCegarLoop]: 26 mSDtfsCounter, 64 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 81.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.37ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 98.32ms IncrementalHoareTripleChecker+Time [2021-08-29 22:11:34,108 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 88 Invalid, 107 Unknown, 0 Unchecked, 3.37ms Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 98.32ms Time] [2021-08-29 22:11:34,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5395 states. [2021-08-29 22:11:34,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5395 to 4219. [2021-08-29 22:11:34,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4219 states, 4218 states have (on average 3.8760075865339023) internal successors, (16349), 4218 states have internal predecessors, (16349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:34,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4219 states to 4219 states and 16349 transitions. [2021-08-29 22:11:34,283 INFO L78 Accepts]: Start accepts. Automaton has 4219 states and 16349 transitions. Word has length 13 [2021-08-29 22:11:34,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:11:34,284 INFO L470 AbstractCegarLoop]: Abstraction has 4219 states and 16349 transitions. [2021-08-29 22:11:34,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:34,284 INFO L276 IsEmpty]: Start isEmpty. Operand 4219 states and 16349 transitions. [2021-08-29 22:11:34,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-29 22:11:34,286 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:11:34,286 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:11:34,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-29 22:11:34,286 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:11:34,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:11:34,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1714048804, now seen corresponding path program 1 times [2021-08-29 22:11:34,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:11:34,287 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414811944] [2021-08-29 22:11:34,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:11:34,288 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:11:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:11:34,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:11:34,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:11:34,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414811944] [2021-08-29 22:11:34,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414811944] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:11:34,397 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:11:34,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 22:11:34,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567971684] [2021-08-29 22:11:34,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 22:11:34,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:11:34,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 22:11:34,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:11:34,399 INFO L87 Difference]: Start difference. First operand 4219 states and 16349 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:34,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:11:34,525 INFO L93 Difference]: Finished difference Result 5989 states and 22265 transitions. [2021-08-29 22:11:34,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-29 22:11:34,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-08-29 22:11:34,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:11:34,542 INFO L225 Difference]: With dead ends: 5989 [2021-08-29 22:11:34,542 INFO L226 Difference]: Without dead ends: 5195 [2021-08-29 22:11:34,544 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 20.23ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:11:34,546 INFO L928 BasicCegarLoop]: 25 mSDtfsCounter, 76 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.12ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.83ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 82.08ms IncrementalHoareTripleChecker+Time [2021-08-29 22:11:34,547 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 75 Invalid, 87 Unknown, 0 Unchecked, 0.83ms Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 82.08ms Time] [2021-08-29 22:11:34,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5195 states. [2021-08-29 22:11:34,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5195 to 4139. [2021-08-29 22:11:34,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4139 states, 4138 states have (on average 3.8629772837119383) internal successors, (15985), 4138 states have internal predecessors, (15985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:34,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4139 states to 4139 states and 15985 transitions. [2021-08-29 22:11:34,669 INFO L78 Accepts]: Start accepts. Automaton has 4139 states and 15985 transitions. Word has length 14 [2021-08-29 22:11:34,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:11:34,669 INFO L470 AbstractCegarLoop]: Abstraction has 4139 states and 15985 transitions. [2021-08-29 22:11:34,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:34,670 INFO L276 IsEmpty]: Start isEmpty. Operand 4139 states and 15985 transitions. [2021-08-29 22:11:34,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-29 22:11:34,672 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:11:34,672 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:11:34,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-29 22:11:34,673 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:11:34,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:11:34,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1595871775, now seen corresponding path program 1 times [2021-08-29 22:11:34,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:11:34,675 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000718419] [2021-08-29 22:11:34,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:11:34,675 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:11:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:11:34,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:11:34,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:11:34,747 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000718419] [2021-08-29 22:11:34,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000718419] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:11:34,747 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:11:34,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 22:11:34,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787382050] [2021-08-29 22:11:34,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 22:11:34,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:11:34,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 22:11:34,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:11:34,749 INFO L87 Difference]: Start difference. First operand 4139 states and 15985 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:34,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:11:34,909 INFO L93 Difference]: Finished difference Result 3972 states and 13808 transitions. [2021-08-29 22:11:34,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:11:34,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-08-29 22:11:34,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:11:34,922 INFO L225 Difference]: With dead ends: 3972 [2021-08-29 22:11:34,923 INFO L226 Difference]: Without dead ends: 3003 [2021-08-29 22:11:34,923 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.04ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:11:34,923 INFO L928 BasicCegarLoop]: 15 mSDtfsCounter, 44 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 115.46ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.85ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 128.27ms IncrementalHoareTripleChecker+Time [2021-08-29 22:11:34,924 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 39 Invalid, 84 Unknown, 0 Unchecked, 0.85ms Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 128.27ms Time] [2021-08-29 22:11:34,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2021-08-29 22:11:34,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 3003. [2021-08-29 22:11:34,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3003 states, 3002 states have (on average 3.438041305796136) internal successors, (10321), 3002 states have internal predecessors, (10321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3003 states to 3003 states and 10321 transitions. [2021-08-29 22:11:35,026 INFO L78 Accepts]: Start accepts. Automaton has 3003 states and 10321 transitions. Word has length 15 [2021-08-29 22:11:35,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:11:35,026 INFO L470 AbstractCegarLoop]: Abstraction has 3003 states and 10321 transitions. [2021-08-29 22:11:35,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:35,027 INFO L276 IsEmpty]: Start isEmpty. Operand 3003 states and 10321 transitions. [2021-08-29 22:11:35,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-29 22:11:35,030 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:11:35,030 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:11:35,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-29 22:11:35,030 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:11:35,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:11:35,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1718445896, now seen corresponding path program 1 times [2021-08-29 22:11:35,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:11:35,031 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393628917] [2021-08-29 22:11:35,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:11:35,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:11:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:11:35,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:11:35,079 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:11:35,079 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393628917] [2021-08-29 22:11:35,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393628917] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:11:35,079 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:11:35,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 22:11:35,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53846988] [2021-08-29 22:11:35,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 22:11:35,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:11:35,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 22:11:35,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:11:35,080 INFO L87 Difference]: Start difference. First operand 3003 states and 10321 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:35,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:11:35,183 INFO L93 Difference]: Finished difference Result 4527 states and 15154 transitions. [2021-08-29 22:11:35,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:11:35,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2021-08-29 22:11:35,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:11:35,193 INFO L225 Difference]: With dead ends: 4527 [2021-08-29 22:11:35,193 INFO L226 Difference]: Without dead ends: 2830 [2021-08-29 22:11:35,193 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.03ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:11:35,194 INFO L928 BasicCegarLoop]: 32 mSDtfsCounter, 34 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.97ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.67ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 74.28ms IncrementalHoareTripleChecker+Time [2021-08-29 22:11:35,194 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 73 Invalid, 83 Unknown, 0 Unchecked, 0.67ms Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 74.28ms Time] [2021-08-29 22:11:35,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2830 states. [2021-08-29 22:11:35,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2830 to 2434. [2021-08-29 22:11:35,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2433 states have (on average 3.340320591861899) internal successors, (8127), 2433 states have internal predecessors, (8127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:35,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 8127 transitions. [2021-08-29 22:11:35,259 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 8127 transitions. Word has length 18 [2021-08-29 22:11:35,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:11:35,259 INFO L470 AbstractCegarLoop]: Abstraction has 2434 states and 8127 transitions. [2021-08-29 22:11:35,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:35,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 8127 transitions. [2021-08-29 22:11:35,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-29 22:11:35,263 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:11:35,263 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:11:35,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-29 22:11:35,263 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:11:35,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:11:35,263 INFO L82 PathProgramCache]: Analyzing trace with hash -192125111, now seen corresponding path program 1 times [2021-08-29 22:11:35,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:11:35,263 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815979302] [2021-08-29 22:11:35,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:11:35,264 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:11:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:11:35,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:11:35,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:11:35,321 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815979302] [2021-08-29 22:11:35,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815979302] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:11:35,321 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:11:35,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 22:11:35,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081251007] [2021-08-29 22:11:35,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 22:11:35,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:11:35,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 22:11:35,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:11:35,322 INFO L87 Difference]: Start difference. First operand 2434 states and 8127 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:35,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:11:35,488 INFO L93 Difference]: Finished difference Result 1920 states and 5834 transitions. [2021-08-29 22:11:35,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-29 22:11:35,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2021-08-29 22:11:35,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:11:35,492 INFO L225 Difference]: With dead ends: 1920 [2021-08-29 22:11:35,492 INFO L226 Difference]: Without dead ends: 1490 [2021-08-29 22:11:35,492 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 9.04ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-29 22:11:35,493 INFO L928 BasicCegarLoop]: 15 mSDtfsCounter, 70 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 121.69ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.49ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 150.03ms IncrementalHoareTripleChecker+Time [2021-08-29 22:11:35,493 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 52 Invalid, 117 Unknown, 0 Unchecked, 0.49ms Time], IncrementalHoareTripleChecker [8 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 150.03ms Time] [2021-08-29 22:11:35,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2021-08-29 22:11:35,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1490. [2021-08-29 22:11:35,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1489 states have (on average 2.985224983210208) internal successors, (4445), 1489 states have internal predecessors, (4445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:35,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 4445 transitions. [2021-08-29 22:11:35,544 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 4445 transitions. Word has length 18 [2021-08-29 22:11:35,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:11:35,544 INFO L470 AbstractCegarLoop]: Abstraction has 1490 states and 4445 transitions. [2021-08-29 22:11:35,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:35,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 4445 transitions. [2021-08-29 22:11:35,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-29 22:11:35,546 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:11:35,546 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:11:35,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-29 22:11:35,547 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:11:35,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:11:35,547 INFO L82 PathProgramCache]: Analyzing trace with hash -244170146, now seen corresponding path program 1 times [2021-08-29 22:11:35,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:11:35,547 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046501290] [2021-08-29 22:11:35,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:11:35,547 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:11:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:11:35,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:11:35,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:11:35,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046501290] [2021-08-29 22:11:35,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046501290] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:11:35,609 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:11:35,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 22:11:35,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712463294] [2021-08-29 22:11:35,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-29 22:11:35,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:11:35,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-29 22:11:35,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-29 22:11:35,610 INFO L87 Difference]: Start difference. First operand 1490 states and 4445 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:35,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:11:35,775 INFO L93 Difference]: Finished difference Result 1254 states and 3711 transitions. [2021-08-29 22:11:35,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-29 22:11:35,775 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-08-29 22:11:35,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:11:35,778 INFO L225 Difference]: With dead ends: 1254 [2021-08-29 22:11:35,778 INFO L226 Difference]: Without dead ends: 1128 [2021-08-29 22:11:35,778 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 12.43ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:11:35,779 INFO L928 BasicCegarLoop]: 15 mSDtfsCounter, 86 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 126.48ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.48ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 152.24ms IncrementalHoareTripleChecker+Time [2021-08-29 22:11:35,779 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 64 Invalid, 148 Unknown, 0 Unchecked, 0.48ms Time], IncrementalHoareTripleChecker [12 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 152.24ms Time] [2021-08-29 22:11:35,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2021-08-29 22:11:35,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1128. [2021-08-29 22:11:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1127 states have (on average 3.0017746228926354) internal successors, (3383), 1127 states have internal predecessors, (3383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:35,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 3383 transitions. [2021-08-29 22:11:35,796 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 3383 transitions. Word has length 21 [2021-08-29 22:11:35,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:11:35,796 INFO L470 AbstractCegarLoop]: Abstraction has 1128 states and 3383 transitions. [2021-08-29 22:11:35,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:35,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 3383 transitions. [2021-08-29 22:11:35,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-29 22:11:35,799 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:11:35,799 INFO L513 BasicCegarLoop]: 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] [2021-08-29 22:11:35,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-29 22:11:35,799 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:11:35,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:11:35,799 INFO L82 PathProgramCache]: Analyzing trace with hash 2067139330, now seen corresponding path program 1 times [2021-08-29 22:11:35,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:11:35,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574450532] [2021-08-29 22:11:35,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:11:35,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:11:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:11:35,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:11:35,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:11:35,905 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574450532] [2021-08-29 22:11:35,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574450532] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:11:35,905 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:11:35,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 22:11:35,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427027598] [2021-08-29 22:11:35,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-29 22:11:35,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:11:35,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-29 22:11:35,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-29 22:11:35,906 INFO L87 Difference]: Start difference. First operand 1128 states and 3383 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:36,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:11:36,110 INFO L93 Difference]: Finished difference Result 1722 states and 5022 transitions. [2021-08-29 22:11:36,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-29 22:11:36,110 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2021-08-29 22:11:36,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:11:36,113 INFO L225 Difference]: With dead ends: 1722 [2021-08-29 22:11:36,113 INFO L226 Difference]: Without dead ends: 1525 [2021-08-29 22:11:36,114 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 34.29ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-29 22:11:36,114 INFO L928 BasicCegarLoop]: 51 mSDtfsCounter, 45 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 122.38ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.75ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 185.68ms IncrementalHoareTripleChecker+Time [2021-08-29 22:11:36,114 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 199 Invalid, 212 Unknown, 0 Unchecked, 0.75ms Time], IncrementalHoareTripleChecker [2 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 185.68ms Time] [2021-08-29 22:11:36,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2021-08-29 22:11:36,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1228. [2021-08-29 22:11:36,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 1227 states have (on average 2.993480032599837) internal successors, (3673), 1227 states have internal predecessors, (3673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:36,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 3673 transitions. [2021-08-29 22:11:36,134 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 3673 transitions. Word has length 25 [2021-08-29 22:11:36,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:11:36,134 INFO L470 AbstractCegarLoop]: Abstraction has 1228 states and 3673 transitions. [2021-08-29 22:11:36,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:36,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 3673 transitions. [2021-08-29 22:11:36,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-29 22:11:36,137 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:11:36,137 INFO L513 BasicCegarLoop]: 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] [2021-08-29 22:11:36,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-29 22:11:36,137 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:11:36,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:11:36,137 INFO L82 PathProgramCache]: Analyzing trace with hash 2019054, now seen corresponding path program 2 times [2021-08-29 22:11:36,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:11:36,137 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256097501] [2021-08-29 22:11:36,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:11:36,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:11:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:11:36,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:11:36,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:11:36,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256097501] [2021-08-29 22:11:36,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256097501] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:11:36,262 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:11:36,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-29 22:11:36,263 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689494467] [2021-08-29 22:11:36,263 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-29 22:11:36,263 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:11:36,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-29 22:11:36,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-29 22:11:36,263 INFO L87 Difference]: Start difference. First operand 1228 states and 3673 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:36,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:11:36,497 INFO L93 Difference]: Finished difference Result 1588 states and 4544 transitions. [2021-08-29 22:11:36,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-29 22:11:36,497 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2021-08-29 22:11:36,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:11:36,501 INFO L225 Difference]: With dead ends: 1588 [2021-08-29 22:11:36,501 INFO L226 Difference]: Without dead ends: 1471 [2021-08-29 22:11:36,501 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 45.32ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-08-29 22:11:36,502 INFO L928 BasicCegarLoop]: 49 mSDtfsCounter, 87 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 111.55ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.77ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 205.18ms IncrementalHoareTripleChecker+Time [2021-08-29 22:11:36,502 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 194 Invalid, 215 Unknown, 0 Unchecked, 0.77ms Time], IncrementalHoareTripleChecker [15 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 205.18ms Time] [2021-08-29 22:11:36,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2021-08-29 22:11:36,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1291. [2021-08-29 22:11:36,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1290 states have (on average 2.962015503875969) internal successors, (3821), 1290 states have internal predecessors, (3821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:36,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 3821 transitions. [2021-08-29 22:11:36,523 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 3821 transitions. Word has length 25 [2021-08-29 22:11:36,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:11:36,523 INFO L470 AbstractCegarLoop]: Abstraction has 1291 states and 3821 transitions. [2021-08-29 22:11:36,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:36,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 3821 transitions. [2021-08-29 22:11:36,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-29 22:11:36,526 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:11:36,526 INFO L513 BasicCegarLoop]: 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] [2021-08-29 22:11:36,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-29 22:11:36,526 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:11:36,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:11:36,527 INFO L82 PathProgramCache]: Analyzing trace with hash 991506424, now seen corresponding path program 3 times [2021-08-29 22:11:36,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:11:36,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001637716] [2021-08-29 22:11:36,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:11:36,527 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:11:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:11:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:11:36,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:11:36,608 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001637716] [2021-08-29 22:11:36,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001637716] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:11:36,609 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:11:36,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-29 22:11:36,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45370847] [2021-08-29 22:11:36,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-29 22:11:36,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:11:36,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-29 22:11:36,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:11:36,610 INFO L87 Difference]: Start difference. First operand 1291 states and 3821 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:36,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:11:36,775 INFO L93 Difference]: Finished difference Result 1247 states and 3729 transitions. [2021-08-29 22:11:36,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-29 22:11:36,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2021-08-29 22:11:36,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:11:36,777 INFO L225 Difference]: With dead ends: 1247 [2021-08-29 22:11:36,778 INFO L226 Difference]: Without dead ends: 790 [2021-08-29 22:11:36,778 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 16.13ms TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-08-29 22:11:36,778 INFO L928 BasicCegarLoop]: 15 mSDtfsCounter, 115 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 82.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.46ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 152.38ms IncrementalHoareTripleChecker+Time [2021-08-29 22:11:36,778 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 53 Invalid, 134 Unknown, 0 Unchecked, 0.46ms Time], IncrementalHoareTripleChecker [19 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 152.38ms Time] [2021-08-29 22:11:36,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2021-08-29 22:11:36,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2021-08-29 22:11:36,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 789 states have (on average 2.9340937896070978) internal successors, (2315), 789 states have internal predecessors, (2315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:36,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 2315 transitions. [2021-08-29 22:11:36,790 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 2315 transitions. Word has length 25 [2021-08-29 22:11:36,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:11:36,791 INFO L470 AbstractCegarLoop]: Abstraction has 790 states and 2315 transitions. [2021-08-29 22:11:36,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:36,791 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 2315 transitions. [2021-08-29 22:11:36,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-29 22:11:36,792 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:11:36,793 INFO L513 BasicCegarLoop]: 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] [2021-08-29 22:11:36,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-29 22:11:36,793 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:11:36,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:11:36,793 INFO L82 PathProgramCache]: Analyzing trace with hash 300147994, now seen corresponding path program 1 times [2021-08-29 22:11:36,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:11:36,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394843440] [2021-08-29 22:11:36,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:11:36,793 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:11:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:11:36,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:11:36,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:11:36,860 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394843440] [2021-08-29 22:11:36,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394843440] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:11:36,860 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:11:36,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 22:11:36,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425304639] [2021-08-29 22:11:36,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 22:11:36,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:11:36,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 22:11:36,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:11:36,861 INFO L87 Difference]: Start difference. First operand 790 states and 2315 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:37,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:11:37,022 INFO L93 Difference]: Finished difference Result 1185 states and 3483 transitions. [2021-08-29 22:11:37,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-29 22:11:37,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-08-29 22:11:37,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:11:37,025 INFO L225 Difference]: With dead ends: 1185 [2021-08-29 22:11:37,025 INFO L226 Difference]: Without dead ends: 1002 [2021-08-29 22:11:37,025 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 68.52ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:11:37,025 INFO L928 BasicCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.36ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 95.99ms IncrementalHoareTripleChecker+Time [2021-08-29 22:11:37,026 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 74 Invalid, 93 Unknown, 0 Unchecked, 0.36ms Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 95.99ms Time] [2021-08-29 22:11:37,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2021-08-29 22:11:37,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 718. [2021-08-29 22:11:37,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 2.8744769874476988) internal successors, (2061), 717 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:37,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 2061 transitions. [2021-08-29 22:11:37,036 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 2061 transitions. Word has length 29 [2021-08-29 22:11:37,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:11:37,037 INFO L470 AbstractCegarLoop]: Abstraction has 718 states and 2061 transitions. [2021-08-29 22:11:37,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:37,037 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 2061 transitions. [2021-08-29 22:11:37,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-29 22:11:37,038 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:11:37,038 INFO L513 BasicCegarLoop]: 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] [2021-08-29 22:11:37,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-29 22:11:37,038 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:11:37,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:11:37,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1036597136, now seen corresponding path program 2 times [2021-08-29 22:11:37,039 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:11:37,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039142784] [2021-08-29 22:11:37,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:11:37,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:11:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:11:37,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:11:37,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:11:37,109 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039142784] [2021-08-29 22:11:37,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039142784] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:11:37,109 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:11:37,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 22:11:37,110 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69108831] [2021-08-29 22:11:37,110 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 22:11:37,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:11:37,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 22:11:37,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:11:37,110 INFO L87 Difference]: Start difference. First operand 718 states and 2061 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:37,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:11:37,207 INFO L93 Difference]: Finished difference Result 1009 states and 2904 transitions. [2021-08-29 22:11:37,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:11:37,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-08-29 22:11:37,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:11:37,209 INFO L225 Difference]: With dead ends: 1009 [2021-08-29 22:11:37,209 INFO L226 Difference]: Without dead ends: 474 [2021-08-29 22:11:37,209 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.72ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:11:37,210 INFO L928 BasicCegarLoop]: 27 mSDtfsCounter, 29 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.40ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.33ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 84.18ms IncrementalHoareTripleChecker+Time [2021-08-29 22:11:37,210 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 83 Invalid, 93 Unknown, 0 Unchecked, 0.33ms Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 84.18ms Time] [2021-08-29 22:11:37,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-08-29 22:11:37,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2021-08-29 22:11:37,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 2.788583509513742) internal successors, (1319), 473 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:37,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1319 transitions. [2021-08-29 22:11:37,218 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1319 transitions. Word has length 29 [2021-08-29 22:11:37,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:11:37,219 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 1319 transitions. [2021-08-29 22:11:37,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:37,219 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1319 transitions. [2021-08-29 22:11:37,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-29 22:11:37,220 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:11:37,221 INFO L513 BasicCegarLoop]: 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] [2021-08-29 22:11:37,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-29 22:11:37,221 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:11:37,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:11:37,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1268859110, now seen corresponding path program 3 times [2021-08-29 22:11:37,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:11:37,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584552315] [2021-08-29 22:11:37,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:11:37,221 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:11:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:11:37,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:11:37,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:11:37,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584552315] [2021-08-29 22:11:37,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584552315] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:11:37,283 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:11:37,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 22:11:37,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702703760] [2021-08-29 22:11:37,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 22:11:37,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:11:37,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 22:11:37,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:11:37,284 INFO L87 Difference]: Start difference. First operand 474 states and 1319 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:37,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:11:37,376 INFO L93 Difference]: Finished difference Result 612 states and 1694 transitions. [2021-08-29 22:11:37,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:11:37,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-08-29 22:11:37,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:11:37,378 INFO L225 Difference]: With dead ends: 612 [2021-08-29 22:11:37,378 INFO L226 Difference]: Without dead ends: 344 [2021-08-29 22:11:37,379 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.90ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:11:37,379 INFO L928 BasicCegarLoop]: 24 mSDtfsCounter, 25 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 71.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.33ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 80.56ms IncrementalHoareTripleChecker+Time [2021-08-29 22:11:37,379 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 76 Invalid, 82 Unknown, 0 Unchecked, 0.33ms Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 80.56ms Time] [2021-08-29 22:11:37,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-08-29 22:11:37,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2021-08-29 22:11:37,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 2.7259475218658893) internal successors, (935), 343 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:37,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 935 transitions. [2021-08-29 22:11:37,385 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 935 transitions. Word has length 29 [2021-08-29 22:11:37,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:11:37,385 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 935 transitions. [2021-08-29 22:11:37,385 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:37,385 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 935 transitions. [2021-08-29 22:11:37,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-29 22:11:37,386 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:11:37,386 INFO L513 BasicCegarLoop]: 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] [2021-08-29 22:11:37,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-29 22:11:37,386 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:11:37,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:11:37,386 INFO L82 PathProgramCache]: Analyzing trace with hash 2125592042, now seen corresponding path program 4 times [2021-08-29 22:11:37,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:11:37,386 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286921642] [2021-08-29 22:11:37,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:11:37,386 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:11:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:11:37,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:11:37,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:11:37,541 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286921642] [2021-08-29 22:11:37,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286921642] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:11:37,542 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:11:37,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-29 22:11:37,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085644992] [2021-08-29 22:11:37,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-29 22:11:37,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:11:37,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-29 22:11:37,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-29 22:11:37,543 INFO L87 Difference]: Start difference. First operand 344 states and 935 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:37,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:11:37,708 INFO L93 Difference]: Finished difference Result 383 states and 1022 transitions. [2021-08-29 22:11:37,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-29 22:11:37,709 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-08-29 22:11:37,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:11:37,710 INFO L225 Difference]: With dead ends: 383 [2021-08-29 22:11:37,710 INFO L226 Difference]: Without dead ends: 344 [2021-08-29 22:11:37,711 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 51.58ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-08-29 22:11:37,712 INFO L928 BasicCegarLoop]: 29 mSDtfsCounter, 61 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 128.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.79ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 143.57ms IncrementalHoareTripleChecker+Time [2021-08-29 22:11:37,712 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 138 Invalid, 170 Unknown, 0 Unchecked, 0.79ms Time], IncrementalHoareTripleChecker [13 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 143.57ms Time] [2021-08-29 22:11:37,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-08-29 22:11:37,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2021-08-29 22:11:37,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 2.7142857142857144) internal successors, (931), 343 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:37,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 931 transitions. [2021-08-29 22:11:37,717 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 931 transitions. Word has length 29 [2021-08-29 22:11:37,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:11:37,717 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 931 transitions. [2021-08-29 22:11:37,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:37,718 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 931 transitions. [2021-08-29 22:11:37,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-29 22:11:37,718 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:11:37,718 INFO L513 BasicCegarLoop]: 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] [2021-08-29 22:11:37,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-29 22:11:37,719 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:11:37,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:11:37,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1871244986, now seen corresponding path program 5 times [2021-08-29 22:11:37,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:11:37,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556672826] [2021-08-29 22:11:37,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:11:37,720 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:11:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:11:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:11:37,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:11:37,883 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556672826] [2021-08-29 22:11:37,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556672826] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:11:37,885 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:11:37,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-29 22:11:37,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388920390] [2021-08-29 22:11:37,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-29 22:11:37,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:11:37,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-29 22:11:37,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-08-29 22:11:37,887 INFO L87 Difference]: Start difference. First operand 344 states and 931 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:38,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:11:38,061 INFO L93 Difference]: Finished difference Result 371 states and 986 transitions. [2021-08-29 22:11:38,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-29 22:11:38,061 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-08-29 22:11:38,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:11:38,062 INFO L225 Difference]: With dead ends: 371 [2021-08-29 22:11:38,062 INFO L226 Difference]: Without dead ends: 182 [2021-08-29 22:11:38,062 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 75.75ms TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-08-29 22:11:38,062 INFO L928 BasicCegarLoop]: 29 mSDtfsCounter, 73 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 114.61ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.79ms SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 126.98ms IncrementalHoareTripleChecker+Time [2021-08-29 22:11:38,063 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 126 Invalid, 170 Unknown, 0 Unchecked, 0.79ms Time], IncrementalHoareTripleChecker [23 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 126.98ms Time] [2021-08-29 22:11:38,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-08-29 22:11:38,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2021-08-29 22:11:38,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 181 states have (on average 2.3480662983425415) internal successors, (425), 181 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:38,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 425 transitions. [2021-08-29 22:11:38,066 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 425 transitions. Word has length 29 [2021-08-29 22:11:38,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:11:38,066 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 425 transitions. [2021-08-29 22:11:38,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:11:38,066 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 425 transitions. [2021-08-29 22:11:38,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-29 22:11:38,067 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:11:38,067 INFO L513 BasicCegarLoop]: 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] [2021-08-29 22:11:38,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-29 22:11:38,067 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:11:38,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:11:38,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1916881706, now seen corresponding path program 6 times [2021-08-29 22:11:38,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:11:38,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200971629] [2021-08-29 22:11:38,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:11:38,068 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:11:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 22:11:38,104 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-29 22:11:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 22:11:38,176 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-29 22:11:38,177 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-08-29 22:11:38,177 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-08-29 22:11:38,180 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-08-29 22:11:38,180 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2021-08-29 22:11:38,180 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2021-08-29 22:11:38,180 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2021-08-29 22:11:38,180 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2021-08-29 22:11:38,181 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-08-29 22:11:38,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-29 22:11:38,185 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-29 22:11:38,185 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-29 22:11:38,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 10:11:38 BasicIcfg [2021-08-29 22:11:38,281 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-29 22:11:38,281 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-29 22:11:38,281 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-29 22:11:38,282 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-29 22:11:38,282 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 10:11:28" (3/4) ... [2021-08-29 22:11:38,283 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-29 22:11:38,385 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-29 22:11:38,385 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-29 22:11:38,386 INFO L158 Benchmark]: Toolchain (without parser) took 11494.67ms. Allocated memory was 67.1MB in the beginning and 612.4MB in the end (delta: 545.3MB). Free memory was 45.8MB in the beginning and 252.8MB in the end (delta: -207.1MB). Peak memory consumption was 336.6MB. Max. memory is 16.1GB. [2021-08-29 22:11:38,386 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 67.1MB. Free memory was 48.8MB in the beginning and 48.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 22:11:38,387 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.18ms. Allocated memory is still 67.1MB. Free memory was 45.6MB in the beginning and 37.2MB in the end (delta: 8.4MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2021-08-29 22:11:38,387 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.91ms. Allocated memory is still 67.1MB. Free memory was 36.9MB in the beginning and 34.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-29 22:11:38,387 INFO L158 Benchmark]: Boogie Preprocessor took 25.57ms. Allocated memory is still 67.1MB. Free memory was 34.4MB in the beginning and 32.0MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-08-29 22:11:38,387 INFO L158 Benchmark]: RCFGBuilder took 758.40ms. Allocated memory was 67.1MB in the beginning and 92.3MB in the end (delta: 25.2MB). Free memory was 32.0MB in the beginning and 59.5MB in the end (delta: -27.5MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2021-08-29 22:11:38,387 INFO L158 Benchmark]: TraceAbstraction took 10209.80ms. Allocated memory was 92.3MB in the beginning and 612.4MB in the end (delta: 520.1MB). Free memory was 59.0MB in the beginning and 279.0MB in the end (delta: -220.0MB). Peak memory consumption was 300.6MB. Max. memory is 16.1GB. [2021-08-29 22:11:38,387 INFO L158 Benchmark]: Witness Printer took 104.10ms. Allocated memory is still 612.4MB. Free memory was 279.0MB in the beginning and 252.8MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2021-08-29 22:11:38,389 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 67.1MB. Free memory was 48.8MB in the beginning and 48.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.18ms. Allocated memory is still 67.1MB. Free memory was 45.6MB in the beginning and 37.2MB in the end (delta: 8.4MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.91ms. Allocated memory is still 67.1MB. Free memory was 36.9MB in the beginning and 34.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.57ms. Allocated memory is still 67.1MB. Free memory was 34.4MB in the beginning and 32.0MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 758.40ms. Allocated memory was 67.1MB in the beginning and 92.3MB in the end (delta: 25.2MB). Free memory was 32.0MB in the beginning and 59.5MB in the end (delta: -27.5MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10209.80ms. Allocated memory was 92.3MB in the beginning and 612.4MB in the end (delta: 520.1MB). Free memory was 59.0MB in the beginning and 279.0MB in the end (delta: -220.0MB). Peak memory consumption was 300.6MB. Max. memory is 16.1GB. * Witness Printer took 104.10ms. Allocated memory is still 612.4MB. Free memory was 279.0MB in the beginning and 252.8MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4195.03ms, 141 PlacesBefore, 48 PlacesAfterwards, 130 TransitionsBefore, 36 TransitionsAfterwards, 3104 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 107 TotalNumberOfCompositions, 9089 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4534, positive: 4304, positive conditional: 0, positive unconditional: 4304, negative: 230, negative conditional: 0, negative unconditional: 230, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2159, positive: 2099, positive conditional: 0, positive unconditional: 2099, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2159, positive: 2071, positive conditional: 0, positive unconditional: 2071, negative: 88, negative conditional: 0, negative unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 88, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 216, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 196, negative conditional: 0, negative unconditional: 196, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4534, positive: 2205, positive conditional: 0, positive unconditional: 2205, negative: 170, negative conditional: 0, negative unconditional: 170, unknown: 2159, unknown conditional: 0, unknown unconditional: 2159] , Statistics on independence cache: Total cache size (in pairs): 272, Positive cache size: 245, Positive conditional cache size: 0, Positive unconditional cache size: 245, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L866] 0 pthread_t t473; [L867] FCALL, FORK 0 pthread_create(&t473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L868] 0 pthread_t t474; [L869] FCALL, FORK 0 pthread_create(&t474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L870] 0 pthread_t t475; [L871] FCALL, FORK 0 pthread_create(&t475, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L872] 0 pthread_t t476; [L873] FCALL, FORK 0 pthread_create(&t476, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L808] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L822] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L832] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L833] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L833] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L833] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L833] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L834] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L834] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L834] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L834] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L835] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L835] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L835] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L835] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L836] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L836] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L837] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L837] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L837] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L838] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L838] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EBX = a [L840] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L844] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L844] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L844] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L844] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L845] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L846] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L847] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L848] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L788] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L879] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L879] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L879] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L879] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L880] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L881] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L882] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L883] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L886] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 867]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 873]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 167 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 9998.61ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 52.08ms, AutomataDifference: 2765.18ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 4369.27ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 904 SdHoareTripleChecker+Valid, 1873.65ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 904 mSDsluCounter, 1427 SdHoareTripleChecker+Invalid, 1426.59ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1825 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1799 IncrementalHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 421 mSDtfsCounter, 1799 mSolverCounterSat, 13.23ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 410.02ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5255occurred in iteration=2, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 1043.76ms AutomataMinimizationTime, 16 MinimizatonAttempts, 4265 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 48.77ms SsaConstructionTime, 437.67ms SatisfiabilityAnalysisTime, 995.55ms InterpolantComputationTime, 363 NumberOfCodeBlocks, 363 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 2088 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-29 22:11:38,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...