./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe004_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/safe004_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 9e138332314ea23a90608e1da3db8650a480a860 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:20:38,556 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-29 22:20:38,558 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-29 22:20:38,587 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-29 22:20:38,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-29 22:20:38,590 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-29 22:20:38,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-29 22:20:38,595 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-29 22:20:38,603 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-29 22:20:38,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-29 22:20:38,607 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-29 22:20:38,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-29 22:20:38,610 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-29 22:20:38,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-29 22:20:38,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-29 22:20:38,616 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-29 22:20:38,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-29 22:20:38,617 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-29 22:20:38,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-29 22:20:38,623 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-29 22:20:38,624 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-29 22:20:38,625 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-29 22:20:38,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-29 22:20:38,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-29 22:20:38,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-29 22:20:38,632 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-29 22:20:38,632 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-29 22:20:38,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-29 22:20:38,633 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-29 22:20:38,634 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-29 22:20:38,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-29 22:20:38,635 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-29 22:20:38,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-29 22:20:38,637 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-29 22:20:38,637 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-29 22:20:38,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-29 22:20:38,638 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-29 22:20:38,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-29 22:20:38,639 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-29 22:20:38,640 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-29 22:20:38,640 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-29 22:20:38,643 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:20:38,675 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-29 22:20:38,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-29 22:20:38,676 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-29 22:20:38,676 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-29 22:20:38,677 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-29 22:20:38,678 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-29 22:20:38,678 INFO L138 SettingsManager]: * Use SBE=true [2021-08-29 22:20:38,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-29 22:20:38,678 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-29 22:20:38,678 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-29 22:20:38,679 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-29 22:20:38,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-29 22:20:38,679 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-29 22:20:38,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-29 22:20:38,680 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-29 22:20:38,680 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-29 22:20:38,680 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-29 22:20:38,680 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-29 22:20:38,680 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-29 22:20:38,680 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-29 22:20:38,680 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-29 22:20:38,680 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-29 22:20:38,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 22:20:38,681 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-29 22:20:38,681 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-29 22:20:38,681 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-29 22:20:38,681 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-29 22:20:38,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-29 22:20:38,681 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-29 22:20:38,682 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-29 22:20:38,682 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 -> 9e138332314ea23a90608e1da3db8650a480a860 [2021-08-29 22:20:38,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-29 22:20:38,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-29 22:20:38,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-29 22:20:38,964 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-29 22:20:38,965 INFO L275 PluginConnector]: CDTParser initialized [2021-08-29 22:20:38,966 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe004_pso.oepc.i [2021-08-29 22:20:39,008 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4c9bc992/942ab12f43964302b86cda72bf926929/FLAG9dd75229e [2021-08-29 22:20:39,361 INFO L306 CDTParser]: Found 1 translation units. [2021-08-29 22:20:39,361 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_pso.oepc.i [2021-08-29 22:20:39,370 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4c9bc992/942ab12f43964302b86cda72bf926929/FLAG9dd75229e [2021-08-29 22:20:39,747 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4c9bc992/942ab12f43964302b86cda72bf926929 [2021-08-29 22:20:39,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-29 22:20:39,752 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-29 22:20:39,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-29 22:20:39,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-29 22:20:39,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-29 22:20:39,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 10:20:39" (1/1) ... [2021-08-29 22:20:39,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3343d59b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:20:39, skipping insertion in model container [2021-08-29 22:20:39,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 10:20:39" (1/1) ... [2021-08-29 22:20:39,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-29 22:20:39,810 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-29 22:20:39,915 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/safe004_pso.oepc.i[950,963] [2021-08-29 22:20:40,128 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 22:20:40,137 INFO L203 MainTranslator]: Completed pre-run [2021-08-29 22:20:40,146 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/safe004_pso.oepc.i[950,963] [2021-08-29 22:20:40,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 22:20:40,229 INFO L208 MainTranslator]: Completed translation [2021-08-29 22:20:40,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:20:40 WrapperNode [2021-08-29 22:20:40,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-29 22:20:40,231 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-29 22:20:40,231 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-29 22:20:40,231 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-29 22:20:40,236 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:20:40" (1/1) ... [2021-08-29 22:20:40,248 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:20:40" (1/1) ... [2021-08-29 22:20:40,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-29 22:20:40,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-29 22:20:40,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-29 22:20:40,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-29 22:20:40,274 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:20:40" (1/1) ... [2021-08-29 22:20:40,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:20:40" (1/1) ... [2021-08-29 22:20:40,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:20:40" (1/1) ... [2021-08-29 22:20:40,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:20:40" (1/1) ... [2021-08-29 22:20:40,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:20:40" (1/1) ... [2021-08-29 22:20:40,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:20:40" (1/1) ... [2021-08-29 22:20:40,304 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:20:40" (1/1) ... [2021-08-29 22:20:40,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-29 22:20:40,308 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-29 22:20:40,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-29 22:20:40,308 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-29 22:20:40,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:20:40" (1/1) ... [2021-08-29 22:20:40,313 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 22:20:40,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 22:20:40,354 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:20:40,372 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:20:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-29 22:20:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-29 22:20:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-29 22:20:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-29 22:20:40,396 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-29 22:20:40,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-29 22:20:40,397 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-29 22:20:40,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-29 22:20:40,397 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-29 22:20:40,397 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-29 22:20:40,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-29 22:20:40,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-29 22:20:40,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-29 22:20:40,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-29 22:20:40,399 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:20:41,132 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-29 22:20:41,133 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-29 22:20:41,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 10:20:41 BoogieIcfgContainer [2021-08-29 22:20:41,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-29 22:20:41,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-29 22:20:41,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-29 22:20:41,138 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-29 22:20:41,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 10:20:39" (1/3) ... [2021-08-29 22:20:41,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb35e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 10:20:41, skipping insertion in model container [2021-08-29 22:20:41,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:20:40" (2/3) ... [2021-08-29 22:20:41,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb35e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 10:20:41, skipping insertion in model container [2021-08-29 22:20:41,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 10:20:41" (3/3) ... [2021-08-29 22:20:41,141 INFO L111 eAbstractionObserver]: Analyzing ICFG safe004_pso.oepc.i [2021-08-29 22:20:41,144 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-29 22:20:41,145 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-29 22:20:41,145 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-29 22:20:41,145 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-29 22:20:41,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,198 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,199 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,199 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,199 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,199 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,199 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,200 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,200 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,201 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,206 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,206 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,206 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,207 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,210 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,210 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,211 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,211 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,228 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,231 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,231 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,231 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,231 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,245 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,253 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,254 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,262 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,264 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,266 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,267 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,267 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,268 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,268 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,268 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,268 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,268 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,268 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,269 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,269 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,269 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,269 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,269 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,269 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,269 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:20:41,269 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-29 22:20:41,325 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-29 22:20:41,339 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:20:41,340 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-29 22:20:41,354 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-08-29 22:20:41,364 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 106 transitions, 227 flow [2021-08-29 22:20:41,366 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 106 transitions, 227 flow [2021-08-29 22:20:41,367 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2021-08-29 22:20:41,419 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2021-08-29 22:20:41,419 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-29 22:20:41,422 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2021-08-29 22:20:41,425 INFO L116 LiptonReduction]: Number of co-enabled transitions 1876 [2021-08-29 22:20:50,221 INFO L131 LiptonReduction]: Checked pairs total: 4508 [2021-08-29 22:20:50,221 INFO L133 LiptonReduction]: Total number of compositions: 91 [2021-08-29 22:20:50,227 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2021-08-29 22:20:50,264 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 874 states, 871 states have (on average 3.343283582089552) internal successors, (2912), 873 states have internal predecessors, (2912), 0 states have call successors, (0), 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:20:50,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 874 states, 871 states have (on average 3.343283582089552) internal successors, (2912), 873 states have internal predecessors, (2912), 0 states have call successors, (0), 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:20:50,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-08-29 22:20:50,276 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:20:50,277 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-08-29 22:20:50,278 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:20:50,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:20:50,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1729849, now seen corresponding path program 1 times [2021-08-29 22:20:50,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:20:50,288 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065452400] [2021-08-29 22:20:50,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:20:50,288 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:20:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:20:50,442 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:20:50,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:20:50,443 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065452400] [2021-08-29 22:20:50,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065452400] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:20:50,443 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:20:50,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-08-29 22:20:50,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556169285] [2021-08-29 22:20:50,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 22:20:50,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:20:50,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 22:20:50,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 22:20:50,463 INFO L87 Difference]: Start difference. First operand has 874 states, 871 states have (on average 3.343283582089552) internal successors, (2912), 873 states have internal predecessors, (2912), 0 states have call successors, (0), 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:20:50,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:20:50,548 INFO L93 Difference]: Finished difference Result 712 states and 2215 transitions. [2021-08-29 22:20:50,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 22:20:50,550 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:20:50,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:20:50,568 INFO L225 Difference]: With dead ends: 712 [2021-08-29 22:20:50,569 INFO L226 Difference]: Without dead ends: 687 [2021-08-29 22:20:50,569 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.24ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 22:20:50,573 INFO L928 BasicCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.65ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.41ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.58ms IncrementalHoareTripleChecker+Time [2021-08-29 22:20:50,575 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 17 Invalid, 32 Unknown, 0 Unchecked, 1.41ms Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 48.58ms Time] [2021-08-29 22:20:50,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2021-08-29 22:20:50,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2021-08-29 22:20:50,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 686 states have (on average 3.1341107871720117) internal successors, (2150), 686 states have internal predecessors, (2150), 0 states have call successors, (0), 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:20:50,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2021-08-29 22:20:50,642 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 3 [2021-08-29 22:20:50,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:20:50,642 INFO L470 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2021-08-29 22:20:50,643 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:20:50,643 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2021-08-29 22:20:50,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-29 22:20:50,644 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:20:50,645 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:20:50,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-29 22:20:50,645 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:20:50,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:20:50,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1847421195, now seen corresponding path program 1 times [2021-08-29 22:20:50,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:20:50,649 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252879185] [2021-08-29 22:20:50,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:20:50,650 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:20:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:20:50,780 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:20:50,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:20:50,781 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252879185] [2021-08-29 22:20:50,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252879185] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:20:50,781 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:20:50,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 22:20:50,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507862268] [2021-08-29 22:20:50,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 22:20:50,782 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:20:50,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 22:20:50,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:20:50,783 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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:20:50,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:20:50,844 INFO L93 Difference]: Finished difference Result 792 states and 2384 transitions. [2021-08-29 22:20:50,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:20:50,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-08-29 22:20:50,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:20:50,847 INFO L225 Difference]: With dead ends: 792 [2021-08-29 22:20:50,847 INFO L226 Difference]: Without dead ends: 667 [2021-08-29 22:20:50,848 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.01ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:20:50,848 INFO L928 BasicCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.11ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.13ms IncrementalHoareTripleChecker+Time [2021-08-29 22:20:50,849 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 44 Invalid, 44 Unknown, 0 Unchecked, 1.11ms Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 47.13ms Time] [2021-08-29 22:20:50,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2021-08-29 22:20:50,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2021-08-29 22:20:50,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 666 states have (on average 3.114114114114114) internal successors, (2074), 666 states have internal predecessors, (2074), 0 states have call successors, (0), 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:20:50,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 2074 transitions. [2021-08-29 22:20:50,883 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 2074 transitions. Word has length 10 [2021-08-29 22:20:50,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:20:50,884 INFO L470 AbstractCegarLoop]: Abstraction has 667 states and 2074 transitions. [2021-08-29 22:20:50,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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:20:50,884 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 2074 transitions. [2021-08-29 22:20:50,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-29 22:20:50,885 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:20:50,885 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:20:50,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-29 22:20:50,886 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:20:50,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:20:50,886 INFO L82 PathProgramCache]: Analyzing trace with hash -439806018, now seen corresponding path program 1 times [2021-08-29 22:20:50,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:20:50,887 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543834015] [2021-08-29 22:20:50,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:20:50,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:20:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:20:50,941 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:20:50,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:20:50,944 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543834015] [2021-08-29 22:20:50,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543834015] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:20:50,944 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:20:50,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 22:20:50,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770412839] [2021-08-29 22:20:50,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 22:20:50,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:20:50,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 22:20:50,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:20:50,945 INFO L87 Difference]: Start difference. First operand 667 states and 2074 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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:20:51,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:20:51,003 INFO L93 Difference]: Finished difference Result 690 states and 2064 transitions. [2021-08-29 22:20:51,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:20:51,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2021-08-29 22:20:51,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:20:51,006 INFO L225 Difference]: With dead ends: 690 [2021-08-29 22:20:51,006 INFO L226 Difference]: Without dead ends: 575 [2021-08-29 22:20:51,006 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.25ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:20:51,007 INFO L928 BasicCegarLoop]: 18 mSDtfsCounter, 29 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.69ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.11ms IncrementalHoareTripleChecker+Time [2021-08-29 22:20:51,007 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 42 Invalid, 40 Unknown, 0 Unchecked, 0.69ms Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 45.11ms Time] [2021-08-29 22:20:51,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2021-08-29 22:20:51,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2021-08-29 22:20:51,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 574 states have (on average 3.0418118466898956) internal successors, (1746), 574 states have internal predecessors, (1746), 0 states have call successors, (0), 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:20:51,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1746 transitions. [2021-08-29 22:20:51,018 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1746 transitions. Word has length 11 [2021-08-29 22:20:51,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:20:51,018 INFO L470 AbstractCegarLoop]: Abstraction has 575 states and 1746 transitions. [2021-08-29 22:20:51,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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:20:51,019 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1746 transitions. [2021-08-29 22:20:51,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-29 22:20:51,020 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:20:51,020 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:20:51,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-29 22:20:51,020 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:20:51,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:20:51,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1032630593, now seen corresponding path program 1 times [2021-08-29 22:20:51,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:20:51,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965381647] [2021-08-29 22:20:51,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:20:51,022 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:20:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:20:51,144 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:20:51,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:20:51,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965381647] [2021-08-29 22:20:51,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965381647] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:20:51,145 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:20:51,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 22:20:51,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513455894] [2021-08-29 22:20:51,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 22:20:51,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:20:51,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 22:20:51,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:20:51,146 INFO L87 Difference]: Start difference. First operand 575 states and 1746 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:20:51,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:20:51,233 INFO L93 Difference]: Finished difference Result 928 states and 2814 transitions. [2021-08-29 22:20:51,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:20:51,233 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:20:51,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:20:51,236 INFO L225 Difference]: With dead ends: 928 [2021-08-29 22:20:51,236 INFO L226 Difference]: Without dead ends: 559 [2021-08-29 22:20:51,236 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 14.22ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:20:51,237 INFO L928 BasicCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.51ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.45ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 65.52ms IncrementalHoareTripleChecker+Time [2021-08-29 22:20:51,237 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 42 Invalid, 63 Unknown, 0 Unchecked, 6.45ms Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 65.52ms Time] [2021-08-29 22:20:51,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2021-08-29 22:20:51,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2021-08-29 22:20:51,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 3.014336917562724) internal successors, (1682), 558 states have internal predecessors, (1682), 0 states have call successors, (0), 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:20:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 1682 transitions. [2021-08-29 22:20:51,247 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 1682 transitions. Word has length 13 [2021-08-29 22:20:51,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:20:51,248 INFO L470 AbstractCegarLoop]: Abstraction has 559 states and 1682 transitions. [2021-08-29 22:20:51,248 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:20:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 1682 transitions. [2021-08-29 22:20:51,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-29 22:20:51,249 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:20:51,249 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:20:51,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-29 22:20:51,249 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:20:51,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:20:51,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1747493183, now seen corresponding path program 2 times [2021-08-29 22:20:51,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:20:51,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005886807] [2021-08-29 22:20:51,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:20:51,250 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:20:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:20:51,354 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:20:51,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:20:51,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005886807] [2021-08-29 22:20:51,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005886807] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:20:51,355 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:20:51,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 22:20:51,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399668517] [2021-08-29 22:20:51,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-29 22:20:51,356 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:20:51,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-29 22:20:51,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-29 22:20:51,356 INFO L87 Difference]: Start difference. First operand 559 states and 1682 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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:20:51,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:20:51,472 INFO L93 Difference]: Finished difference Result 714 states and 2096 transitions. [2021-08-29 22:20:51,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-29 22:20:51,473 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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:20:51,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:20:51,475 INFO L225 Difference]: With dead ends: 714 [2021-08-29 22:20:51,475 INFO L226 Difference]: Without dead ends: 545 [2021-08-29 22:20:51,475 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 23.38ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-08-29 22:20:51,476 INFO L928 BasicCegarLoop]: 15 mSDtfsCounter, 46 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 81.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.25ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 93.40ms IncrementalHoareTripleChecker+Time [2021-08-29 22:20:51,476 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 59 Invalid, 100 Unknown, 0 Unchecked, 1.25ms Time], IncrementalHoareTripleChecker [13 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 93.40ms Time] [2021-08-29 22:20:51,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2021-08-29 22:20:51,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2021-08-29 22:20:51,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 544 states have (on average 3.0073529411764706) internal successors, (1636), 544 states have internal predecessors, (1636), 0 states have call successors, (0), 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:20:51,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 1636 transitions. [2021-08-29 22:20:51,487 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 1636 transitions. Word has length 13 [2021-08-29 22:20:51,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:20:51,487 INFO L470 AbstractCegarLoop]: Abstraction has 545 states and 1636 transitions. [2021-08-29 22:20:51,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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:20:51,488 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 1636 transitions. [2021-08-29 22:20:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-29 22:20:51,489 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:20:51,489 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:20:51,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-29 22:20:51,489 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:20:51,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:20:51,490 INFO L82 PathProgramCache]: Analyzing trace with hash -585899610, now seen corresponding path program 1 times [2021-08-29 22:20:51,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:20:51,490 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804765477] [2021-08-29 22:20:51,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:20:51,490 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:20:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:20:51,824 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:20:51,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:20:51,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804765477] [2021-08-29 22:20:51,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804765477] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:20:51,824 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:20:51,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-29 22:20:51,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674594708] [2021-08-29 22:20:51,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-29 22:20:51,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:20:51,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-29 22:20:51,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-08-29 22:20:51,826 INFO L87 Difference]: Start difference. First operand 545 states and 1636 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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:20:52,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:20:52,065 INFO L93 Difference]: Finished difference Result 602 states and 1770 transitions. [2021-08-29 22:20:52,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-29 22:20:52,066 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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:20:52,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:20:52,068 INFO L225 Difference]: With dead ends: 602 [2021-08-29 22:20:52,068 INFO L226 Difference]: Without dead ends: 555 [2021-08-29 22:20:52,069 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 144.78ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-29 22:20:52,069 INFO L928 BasicCegarLoop]: 18 mSDtfsCounter, 44 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 131.13ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.22ms SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 148.58ms IncrementalHoareTripleChecker+Time [2021-08-29 22:20:52,069 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 66 Invalid, 137 Unknown, 0 Unchecked, 1.22ms Time], IncrementalHoareTripleChecker [41 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 148.58ms Time] [2021-08-29 22:20:52,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-08-29 22:20:52,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 549. [2021-08-29 22:20:52,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 3.0054744525547443) internal successors, (1647), 548 states have internal predecessors, (1647), 0 states have call successors, (0), 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:20:52,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 1647 transitions. [2021-08-29 22:20:52,084 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 1647 transitions. Word has length 14 [2021-08-29 22:20:52,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:20:52,084 INFO L470 AbstractCegarLoop]: Abstraction has 549 states and 1647 transitions. [2021-08-29 22:20:52,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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:20:52,085 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 1647 transitions. [2021-08-29 22:20:52,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-29 22:20:52,086 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:20:52,086 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:20:52,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-29 22:20:52,087 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:20:52,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:20:52,087 INFO L82 PathProgramCache]: Analyzing trace with hash 611410027, now seen corresponding path program 1 times [2021-08-29 22:20:52,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:20:52,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507756696] [2021-08-29 22:20:52,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:20:52,088 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:20:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:20:52,343 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:20:52,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:20:52,343 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507756696] [2021-08-29 22:20:52,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507756696] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:20:52,343 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:20:52,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-29 22:20:52,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155266517] [2021-08-29 22:20:52,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-29 22:20:52,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:20:52,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-29 22:20:52,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-08-29 22:20:52,345 INFO L87 Difference]: Start difference. First operand 549 states and 1647 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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:20:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:20:52,620 INFO L93 Difference]: Finished difference Result 727 states and 2156 transitions. [2021-08-29 22:20:52,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-29 22:20:52,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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:20:52,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:20:52,623 INFO L225 Difference]: With dead ends: 727 [2021-08-29 22:20:52,623 INFO L226 Difference]: Without dead ends: 658 [2021-08-29 22:20:52,624 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 168.99ms TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-08-29 22:20:52,624 INFO L928 BasicCegarLoop]: 17 mSDtfsCounter, 62 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 127.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.20ms SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 158.62ms IncrementalHoareTripleChecker+Time [2021-08-29 22:20:52,624 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 94 Invalid, 171 Unknown, 0 Unchecked, 1.20ms Time], IncrementalHoareTripleChecker [26 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 158.62ms Time] [2021-08-29 22:20:52,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2021-08-29 22:20:52,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 623. [2021-08-29 22:20:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 622 states have (on average 2.9983922829581995) internal successors, (1865), 622 states have internal predecessors, (1865), 0 states have call successors, (0), 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:20:52,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 1865 transitions. [2021-08-29 22:20:52,657 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 1865 transitions. Word has length 14 [2021-08-29 22:20:52,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:20:52,657 INFO L470 AbstractCegarLoop]: Abstraction has 623 states and 1865 transitions. [2021-08-29 22:20:52,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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:20:52,658 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 1865 transitions. [2021-08-29 22:20:52,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-29 22:20:52,659 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:20:52,659 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:20:52,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-29 22:20:52,659 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:20:52,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:20:52,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1678800945, now seen corresponding path program 2 times [2021-08-29 22:20:52,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:20:52,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641642352] [2021-08-29 22:20:52,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:20:52,660 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:20:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:20:52,741 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:20:52,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:20:52,742 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641642352] [2021-08-29 22:20:52,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641642352] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:20:52,742 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:20:52,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 22:20:52,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412451277] [2021-08-29 22:20:52,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-29 22:20:52,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:20:52,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-29 22:20:52,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:20:52,743 INFO L87 Difference]: Start difference. First operand 623 states and 1865 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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:20:52,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:20:52,843 INFO L93 Difference]: Finished difference Result 888 states and 2615 transitions. [2021-08-29 22:20:52,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-29 22:20:52,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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:20:52,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:20:52,845 INFO L225 Difference]: With dead ends: 888 [2021-08-29 22:20:52,845 INFO L226 Difference]: Without dead ends: 521 [2021-08-29 22:20:52,846 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 41.19ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-08-29 22:20:52,846 INFO L928 BasicCegarLoop]: 13 mSDtfsCounter, 73 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.65ms SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 71.68ms IncrementalHoareTripleChecker+Time [2021-08-29 22:20:52,846 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 47 Invalid, 84 Unknown, 0 Unchecked, 0.65ms Time], IncrementalHoareTripleChecker [18 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 71.68ms Time] [2021-08-29 22:20:52,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2021-08-29 22:20:52,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2021-08-29 22:20:52,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 520 states have (on average 2.8903846153846153) internal successors, (1503), 520 states have internal predecessors, (1503), 0 states have call successors, (0), 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:20:52,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 1503 transitions. [2021-08-29 22:20:52,855 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 1503 transitions. Word has length 14 [2021-08-29 22:20:52,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:20:52,855 INFO L470 AbstractCegarLoop]: Abstraction has 521 states and 1503 transitions. [2021-08-29 22:20:52,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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:20:52,856 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 1503 transitions. [2021-08-29 22:20:52,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-29 22:20:52,856 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:20:52,857 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:20:52,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-29 22:20:52,857 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:20:52,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:20:52,857 INFO L82 PathProgramCache]: Analyzing trace with hash 260616164, now seen corresponding path program 1 times [2021-08-29 22:20:52,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:20:52,858 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831206517] [2021-08-29 22:20:52,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:20:52,858 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:20:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:20:53,122 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:20:53,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:20:53,122 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831206517] [2021-08-29 22:20:53,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831206517] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:20:53,122 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:20:53,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-29 22:20:53,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704684318] [2021-08-29 22:20:53,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-29 22:20:53,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:20:53,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-29 22:20:53,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-29 22:20:53,123 INFO L87 Difference]: Start difference. First operand 521 states and 1503 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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:20:53,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:20:53,393 INFO L93 Difference]: Finished difference Result 681 states and 1968 transitions. [2021-08-29 22:20:53,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-29 22:20:53,393 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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:20:53,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:20:53,396 INFO L225 Difference]: With dead ends: 681 [2021-08-29 22:20:53,396 INFO L226 Difference]: Without dead ends: 615 [2021-08-29 22:20:53,396 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 143.55ms TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-08-29 22:20:53,397 INFO L928 BasicCegarLoop]: 14 mSDtfsCounter, 44 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 150.61ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.23ms SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 171.62ms IncrementalHoareTripleChecker+Time [2021-08-29 22:20:53,397 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 91 Invalid, 188 Unknown, 0 Unchecked, 1.23ms Time], IncrementalHoareTripleChecker [32 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 171.62ms Time] [2021-08-29 22:20:53,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2021-08-29 22:20:53,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 565. [2021-08-29 22:20:53,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 2.904255319148936) internal successors, (1638), 564 states have internal predecessors, (1638), 0 states have call successors, (0), 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:20:53,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 1638 transitions. [2021-08-29 22:20:53,408 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 1638 transitions. Word has length 15 [2021-08-29 22:20:53,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:20:53,408 INFO L470 AbstractCegarLoop]: Abstraction has 565 states and 1638 transitions. [2021-08-29 22:20:53,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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:20:53,409 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 1638 transitions. [2021-08-29 22:20:53,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-29 22:20:53,410 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:20:53,410 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:20:53,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-29 22:20:53,410 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:20:53,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:20:53,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1976581286, now seen corresponding path program 2 times [2021-08-29 22:20:53,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:20:53,411 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649156972] [2021-08-29 22:20:53,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:20:53,411 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:20:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:20:53,632 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:20:53,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:20:53,632 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649156972] [2021-08-29 22:20:53,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649156972] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:20:53,632 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:20:53,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-29 22:20:53,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303231778] [2021-08-29 22:20:53,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-29 22:20:53,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:20:53,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-29 22:20:53,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-29 22:20:53,633 INFO L87 Difference]: Start difference. First operand 565 states and 1638 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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:20:53,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:20:53,823 INFO L93 Difference]: Finished difference Result 721 states and 2087 transitions. [2021-08-29 22:20:53,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-29 22:20:53,824 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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:20:53,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:20:53,827 INFO L225 Difference]: With dead ends: 721 [2021-08-29 22:20:53,827 INFO L226 Difference]: Without dead ends: 673 [2021-08-29 22:20:53,827 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 87.56ms TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-08-29 22:20:53,827 INFO L928 BasicCegarLoop]: 18 mSDtfsCounter, 39 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 114.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.08ms SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 135.77ms IncrementalHoareTripleChecker+Time [2021-08-29 22:20:53,827 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 93 Invalid, 175 Unknown, 0 Unchecked, 1.08ms Time], IncrementalHoareTripleChecker [24 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 135.77ms Time] [2021-08-29 22:20:53,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2021-08-29 22:20:53,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 597. [2021-08-29 22:20:53,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 2.912751677852349) internal successors, (1736), 596 states have internal predecessors, (1736), 0 states have call successors, (0), 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:20:53,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1736 transitions. [2021-08-29 22:20:53,839 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1736 transitions. Word has length 15 [2021-08-29 22:20:53,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:20:53,839 INFO L470 AbstractCegarLoop]: Abstraction has 597 states and 1736 transitions. [2021-08-29 22:20:53,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 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:20:53,839 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1736 transitions. [2021-08-29 22:20:53,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-29 22:20:53,840 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:20:53,840 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:20:53,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-29 22:20:53,841 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:20:53,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:20:53,841 INFO L82 PathProgramCache]: Analyzing trace with hash 645419532, now seen corresponding path program 3 times [2021-08-29 22:20:53,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:20:53,841 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524306053] [2021-08-29 22:20:53,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:20:53,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:20:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:20:54,018 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:20:54,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:20:54,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524306053] [2021-08-29 22:20:54,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524306053] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:20:54,019 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:20:54,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-29 22:20:54,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651501552] [2021-08-29 22:20:54,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-29 22:20:54,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:20:54,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-29 22:20:54,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-08-29 22:20:54,020 INFO L87 Difference]: Start difference. First operand 597 states and 1736 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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:20:54,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:20:54,229 INFO L93 Difference]: Finished difference Result 801 states and 2263 transitions. [2021-08-29 22:20:54,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-29 22:20:54,229 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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:20:54,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:20:54,232 INFO L225 Difference]: With dead ends: 801 [2021-08-29 22:20:54,232 INFO L226 Difference]: Without dead ends: 649 [2021-08-29 22:20:54,232 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 99.08ms TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-08-29 22:20:54,233 INFO L928 BasicCegarLoop]: 18 mSDtfsCounter, 75 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 125.34ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.19ms SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 145.14ms IncrementalHoareTripleChecker+Time [2021-08-29 22:20:54,233 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 93 Invalid, 180 Unknown, 0 Unchecked, 1.19ms Time], IncrementalHoareTripleChecker [53 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 145.14ms Time] [2021-08-29 22:20:54,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2021-08-29 22:20:54,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 495. [2021-08-29 22:20:54,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 494 states have (on average 2.8036437246963564) internal successors, (1385), 494 states have internal predecessors, (1385), 0 states have call successors, (0), 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:20:54,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 1385 transitions. [2021-08-29 22:20:54,243 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 1385 transitions. Word has length 15 [2021-08-29 22:20:54,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:20:54,244 INFO L470 AbstractCegarLoop]: Abstraction has 495 states and 1385 transitions. [2021-08-29 22:20:54,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 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:20:54,244 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 1385 transitions. [2021-08-29 22:20:54,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-29 22:20:54,245 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:20:54,245 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:20:54,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-29 22:20:54,245 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:20:54,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:20:54,246 INFO L82 PathProgramCache]: Analyzing trace with hash -589680690, now seen corresponding path program 1 times [2021-08-29 22:20:54,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:20:54,246 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184436280] [2021-08-29 22:20:54,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:20:54,246 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:20:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:20:54,549 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:20:54,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:20:54,549 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184436280] [2021-08-29 22:20:54,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184436280] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:20:54,549 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:20:54,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-29 22:20:54,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257101662] [2021-08-29 22:20:54,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-29 22:20:54,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:20:54,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-29 22:20:54,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-08-29 22:20:54,550 INFO L87 Difference]: Start difference. First operand 495 states and 1385 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 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:20:54,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:20:54,915 INFO L93 Difference]: Finished difference Result 600 states and 1677 transitions. [2021-08-29 22:20:54,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-29 22:20:54,915 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-08-29 22:20:54,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:20:54,918 INFO L225 Difference]: With dead ends: 600 [2021-08-29 22:20:54,918 INFO L226 Difference]: Without dead ends: 576 [2021-08-29 22:20:54,918 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 294.26ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-08-29 22:20:54,919 INFO L928 BasicCegarLoop]: 19 mSDtfsCounter, 63 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 133.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.08ms SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 154.56ms IncrementalHoareTripleChecker+Time [2021-08-29 22:20:54,919 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 99 Invalid, 192 Unknown, 0 Unchecked, 1.08ms Time], IncrementalHoareTripleChecker [39 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 154.56ms Time] [2021-08-29 22:20:54,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2021-08-29 22:20:54,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 521. [2021-08-29 22:20:54,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 520 states have (on average 2.832692307692308) internal successors, (1473), 520 states have internal predecessors, (1473), 0 states have call successors, (0), 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:20:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 1473 transitions. [2021-08-29 22:20:54,928 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 1473 transitions. Word has length 16 [2021-08-29 22:20:54,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:20:54,928 INFO L470 AbstractCegarLoop]: Abstraction has 521 states and 1473 transitions. [2021-08-29 22:20:54,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 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:20:54,928 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 1473 transitions. [2021-08-29 22:20:54,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-29 22:20:54,929 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:20:54,930 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:20:54,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-29 22:20:54,930 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:20:54,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:20:54,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1443203406, now seen corresponding path program 2 times [2021-08-29 22:20:54,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:20:54,931 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793034481] [2021-08-29 22:20:54,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:20:54,931 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:20:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:20:55,219 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:20:55,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:20:55,220 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793034481] [2021-08-29 22:20:55,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793034481] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:20:55,220 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:20:55,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-29 22:20:55,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645743932] [2021-08-29 22:20:55,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-29 22:20:55,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:20:55,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-29 22:20:55,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-29 22:20:55,221 INFO L87 Difference]: Start difference. First operand 521 states and 1473 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 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:20:55,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:20:55,447 INFO L93 Difference]: Finished difference Result 657 states and 1849 transitions. [2021-08-29 22:20:55,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-29 22:20:55,447 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-08-29 22:20:55,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:20:55,450 INFO L225 Difference]: With dead ends: 657 [2021-08-29 22:20:55,450 INFO L226 Difference]: Without dead ends: 625 [2021-08-29 22:20:55,450 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 176.46ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-29 22:20:55,451 INFO L928 BasicCegarLoop]: 15 mSDtfsCounter, 44 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 106.92ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.84ms SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 129.71ms IncrementalHoareTripleChecker+Time [2021-08-29 22:20:55,451 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 90 Invalid, 154 Unknown, 0 Unchecked, 0.84ms Time], IncrementalHoareTripleChecker [32 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 129.71ms Time] [2021-08-29 22:20:55,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2021-08-29 22:20:55,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 533. [2021-08-29 22:20:55,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 532 states have (on average 2.8402255639097747) internal successors, (1511), 532 states have internal predecessors, (1511), 0 states have call successors, (0), 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:20:55,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 1511 transitions. [2021-08-29 22:20:55,460 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 1511 transitions. Word has length 16 [2021-08-29 22:20:55,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:20:55,460 INFO L470 AbstractCegarLoop]: Abstraction has 533 states and 1511 transitions. [2021-08-29 22:20:55,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 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:20:55,461 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 1511 transitions. [2021-08-29 22:20:55,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-29 22:20:55,462 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:20:55,462 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:20:55,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-29 22:20:55,462 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:20:55,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:20:55,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1312627028, now seen corresponding path program 3 times [2021-08-29 22:20:55,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:20:55,463 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221330131] [2021-08-29 22:20:55,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:20:55,463 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:20:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:20:55,732 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:20:55,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:20:55,732 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221330131] [2021-08-29 22:20:55,732 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221330131] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:20:55,732 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:20:55,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-29 22:20:55,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572234970] [2021-08-29 22:20:55,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-29 22:20:55,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:20:55,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-29 22:20:55,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-08-29 22:20:55,733 INFO L87 Difference]: Start difference. First operand 533 states and 1511 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 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:20:55,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:20:55,962 INFO L93 Difference]: Finished difference Result 533 states and 1493 transitions. [2021-08-29 22:20:55,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-29 22:20:55,975 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-08-29 22:20:55,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:20:55,977 INFO L225 Difference]: With dead ends: 533 [2021-08-29 22:20:55,977 INFO L226 Difference]: Without dead ends: 509 [2021-08-29 22:20:55,978 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 151.44ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-29 22:20:55,978 INFO L928 BasicCegarLoop]: 14 mSDtfsCounter, 79 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 138.87ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.93ms SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 156.09ms IncrementalHoareTripleChecker+Time [2021-08-29 22:20:55,978 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 72 Invalid, 160 Unknown, 0 Unchecked, 0.93ms Time], IncrementalHoareTripleChecker [59 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 156.09ms Time] [2021-08-29 22:20:55,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2021-08-29 22:20:55,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 435. [2021-08-29 22:20:55,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 434 states have (on average 2.78110599078341) internal successors, (1207), 434 states have internal predecessors, (1207), 0 states have call successors, (0), 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:20:55,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 1207 transitions. [2021-08-29 22:20:55,986 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 1207 transitions. Word has length 16 [2021-08-29 22:20:55,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:20:55,987 INFO L470 AbstractCegarLoop]: Abstraction has 435 states and 1207 transitions. [2021-08-29 22:20:55,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 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:20:55,987 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 1207 transitions. [2021-08-29 22:20:55,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-29 22:20:55,988 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:20:55,988 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:20:55,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-29 22:20:55,988 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:20:55,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:20:55,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1480157226, now seen corresponding path program 1 times [2021-08-29 22:20:55,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:20:55,989 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326319199] [2021-08-29 22:20:55,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:20:55,989 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:20:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:20:56,025 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:20:56,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:20:56,026 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326319199] [2021-08-29 22:20:56,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326319199] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:20:56,026 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:20:56,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 22:20:56,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038081307] [2021-08-29 22:20:56,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 22:20:56,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:20:56,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 22:20:56,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:20:56,027 INFO L87 Difference]: Start difference. First operand 435 states and 1207 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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:20:56,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:20:56,074 INFO L93 Difference]: Finished difference Result 658 states and 1785 transitions. [2021-08-29 22:20:56,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:20:56,074 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2021-08-29 22:20:56,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:20:56,076 INFO L225 Difference]: With dead ends: 658 [2021-08-29 22:20:56,076 INFO L226 Difference]: Without dead ends: 310 [2021-08-29 22:20:56,076 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.44ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:20:56,077 INFO L928 BasicCegarLoop]: 24 mSDtfsCounter, 22 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.34ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.80ms IncrementalHoareTripleChecker+Time [2021-08-29 22:20:56,077 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 56 Invalid, 51 Unknown, 0 Unchecked, 0.34ms Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 39.80ms Time] [2021-08-29 22:20:56,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-08-29 22:20:56,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2021-08-29 22:20:56,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 2.627831715210356) internal successors, (812), 309 states have internal predecessors, (812), 0 states have call successors, (0), 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:20:56,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 812 transitions. [2021-08-29 22:20:56,082 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 812 transitions. Word has length 16 [2021-08-29 22:20:56,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:20:56,082 INFO L470 AbstractCegarLoop]: Abstraction has 310 states and 812 transitions. [2021-08-29 22:20:56,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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:20:56,083 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 812 transitions. [2021-08-29 22:20:56,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-29 22:20:56,083 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:20:56,084 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:20:56,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-29 22:20:56,084 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:20:56,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:20:56,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1453083263, now seen corresponding path program 1 times [2021-08-29 22:20:56,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:20:56,084 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371367945] [2021-08-29 22:20:56,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:20:56,085 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:20:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:20:56,140 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:20:56,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:20:56,141 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371367945] [2021-08-29 22:20:56,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371367945] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:20:56,141 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:20:56,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 22:20:56,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260533140] [2021-08-29 22:20:56,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 22:20:56,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:20:56,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 22:20:56,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:20:56,142 INFO L87 Difference]: Start difference. First operand 310 states and 812 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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:20:56,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:20:56,199 INFO L93 Difference]: Finished difference Result 278 states and 654 transitions. [2021-08-29 22:20:56,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:20:56,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-08-29 22:20:56,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:20:56,201 INFO L225 Difference]: With dead ends: 278 [2021-08-29 22:20:56,201 INFO L226 Difference]: Without dead ends: 211 [2021-08-29 22:20:56,201 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.92ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:20:56,201 INFO L928 BasicCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.40ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.07ms IncrementalHoareTripleChecker+Time [2021-08-29 22:20:56,202 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 29 Invalid, 58 Unknown, 0 Unchecked, 0.40ms Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 50.07ms Time] [2021-08-29 22:20:56,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-08-29 22:20:56,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2021-08-29 22:20:56,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 2.3285714285714287) internal successors, (489), 210 states have internal predecessors, (489), 0 states have call successors, (0), 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:20:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 489 transitions. [2021-08-29 22:20:56,206 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 489 transitions. Word has length 17 [2021-08-29 22:20:56,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:20:56,206 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 489 transitions. [2021-08-29 22:20:56,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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:20:56,206 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 489 transitions. [2021-08-29 22:20:56,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-29 22:20:56,207 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:20:56,207 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:20:56,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-29 22:20:56,207 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:20:56,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:20:56,208 INFO L82 PathProgramCache]: Analyzing trace with hash -2099950174, now seen corresponding path program 1 times [2021-08-29 22:20:56,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:20:56,208 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309143435] [2021-08-29 22:20:56,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:20:56,208 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:20:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:20:56,270 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:20:56,270 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:20:56,270 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309143435] [2021-08-29 22:20:56,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309143435] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:20:56,270 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:20:56,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 22:20:56,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520435287] [2021-08-29 22:20:56,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 22:20:56,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:20:56,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 22:20:56,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:20:56,271 INFO L87 Difference]: Start difference. First operand 211 states and 489 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:20:56,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:20:56,348 INFO L93 Difference]: Finished difference Result 176 states and 367 transitions. [2021-08-29 22:20:56,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-29 22:20:56,354 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:20:56,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:20:56,354 INFO L225 Difference]: With dead ends: 176 [2021-08-29 22:20:56,354 INFO L226 Difference]: Without dead ends: 137 [2021-08-29 22:20:56,354 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 14.38ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-29 22:20:56,355 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.38ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 69.86ms IncrementalHoareTripleChecker+Time [2021-08-29 22:20:56,356 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 33 Invalid, 75 Unknown, 0 Unchecked, 0.38ms Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 69.86ms Time] [2021-08-29 22:20:56,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-08-29 22:20:56,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-08-29 22:20:56,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 2.0220588235294117) internal successors, (275), 136 states have internal predecessors, (275), 0 states have call successors, (0), 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:20:56,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 275 transitions. [2021-08-29 22:20:56,358 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 275 transitions. Word has length 18 [2021-08-29 22:20:56,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:20:56,358 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 275 transitions. [2021-08-29 22:20:56,359 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:20:56,359 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 275 transitions. [2021-08-29 22:20:56,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-29 22:20:56,359 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:20:56,359 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] [2021-08-29 22:20:56,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-29 22:20:56,360 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:20:56,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:20:56,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1810958179, now seen corresponding path program 1 times [2021-08-29 22:20:56,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:20:56,360 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58653298] [2021-08-29 22:20:56,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:20:56,361 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:20:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:20:56,606 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:20:56,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:20:56,606 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58653298] [2021-08-29 22:20:56,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58653298] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:20:56,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:20:56,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-29 22:20:56,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193209092] [2021-08-29 22:20:56,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-29 22:20:56,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:20:56,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-29 22:20:56,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-29 22:20:56,607 INFO L87 Difference]: Start difference. First operand 137 states and 275 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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:20:56,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:20:56,771 INFO L93 Difference]: Finished difference Result 214 states and 415 transitions. [2021-08-29 22:20:56,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-29 22:20:56,771 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-08-29 22:20:56,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:20:56,772 INFO L225 Difference]: With dead ends: 214 [2021-08-29 22:20:56,772 INFO L226 Difference]: Without dead ends: 171 [2021-08-29 22:20:56,772 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 105.07ms TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-08-29 22:20:56,773 INFO L928 BasicCegarLoop]: 18 mSDtfsCounter, 40 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 98.57ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.99ms SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 114.67ms IncrementalHoareTripleChecker+Time [2021-08-29 22:20:56,773 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 105 Invalid, 150 Unknown, 0 Unchecked, 0.99ms Time], IncrementalHoareTripleChecker [20 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 114.67ms Time] [2021-08-29 22:20:56,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-08-29 22:20:56,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 131. [2021-08-29 22:20:56,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.9615384615384615) internal successors, (255), 130 states have internal predecessors, (255), 0 states have call successors, (0), 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:20:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 255 transitions. [2021-08-29 22:20:56,775 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 255 transitions. Word has length 20 [2021-08-29 22:20:56,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:20:56,775 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 255 transitions. [2021-08-29 22:20:56,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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:20:56,776 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 255 transitions. [2021-08-29 22:20:56,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-29 22:20:56,776 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:20:56,776 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] [2021-08-29 22:20:56,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-29 22:20:56,776 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:20:56,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:20:56,777 INFO L82 PathProgramCache]: Analyzing trace with hash 247656317, now seen corresponding path program 2 times [2021-08-29 22:20:56,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:20:56,777 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437155139] [2021-08-29 22:20:56,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:20:56,777 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:20:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:20:56,938 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:20:56,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:20:56,939 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437155139] [2021-08-29 22:20:56,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437155139] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:20:56,939 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:20:56,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-29 22:20:56,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349090813] [2021-08-29 22:20:56,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-29 22:20:56,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:20:56,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-29 22:20:56,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-08-29 22:20:56,940 INFO L87 Difference]: Start difference. First operand 131 states and 255 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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:20:57,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:20:57,127 INFO L93 Difference]: Finished difference Result 186 states and 357 transitions. [2021-08-29 22:20:57,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-29 22:20:57,127 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-08-29 22:20:57,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:20:57,128 INFO L225 Difference]: With dead ends: 186 [2021-08-29 22:20:57,128 INFO L226 Difference]: Without dead ends: 95 [2021-08-29 22:20:57,128 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 134.88ms TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-08-29 22:20:57,129 INFO L928 BasicCegarLoop]: 18 mSDtfsCounter, 77 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 83.02ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.96ms SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 98.08ms IncrementalHoareTripleChecker+Time [2021-08-29 22:20:57,129 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 98 Invalid, 147 Unknown, 0 Unchecked, 0.96ms Time], IncrementalHoareTripleChecker [25 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 98.08ms Time] [2021-08-29 22:20:57,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2021-08-29 22:20:57,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2021-08-29 22:20:57,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.8617021276595744) internal successors, (175), 94 states have internal predecessors, (175), 0 states have call successors, (0), 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:20:57,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 175 transitions. [2021-08-29 22:20:57,131 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 175 transitions. Word has length 20 [2021-08-29 22:20:57,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:20:57,131 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 175 transitions. [2021-08-29 22:20:57,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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:20:57,131 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 175 transitions. [2021-08-29 22:20:57,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-29 22:20:57,131 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:20:57,131 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] [2021-08-29 22:20:57,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-29 22:20:57,131 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:20:57,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:20:57,132 INFO L82 PathProgramCache]: Analyzing trace with hash -703498909, now seen corresponding path program 3 times [2021-08-29 22:20:57,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:20:57,132 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610890691] [2021-08-29 22:20:57,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:20:57,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:20:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:20:57,207 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:20:57,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:20:57,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610890691] [2021-08-29 22:20:57,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610890691] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:20:57,208 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:20:57,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 22:20:57,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722486545] [2021-08-29 22:20:57,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-29 22:20:57,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:20:57,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-29 22:20:57,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-29 22:20:57,209 INFO L87 Difference]: Start difference. First operand 95 states and 175 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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:20:57,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:20:57,267 INFO L93 Difference]: Finished difference Result 79 states and 141 transitions. [2021-08-29 22:20:57,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-29 22:20:57,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-08-29 22:20:57,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:20:57,268 INFO L225 Difference]: With dead ends: 79 [2021-08-29 22:20:57,268 INFO L226 Difference]: Without dead ends: 71 [2021-08-29 22:20:57,269 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 14.26ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:20:57,269 INFO L928 BasicCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.36ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.38ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.78ms IncrementalHoareTripleChecker+Time [2021-08-29 22:20:57,269 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 25 Invalid, 70 Unknown, 0 Unchecked, 0.38ms Time], IncrementalHoareTripleChecker [9 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 51.78ms Time] [2021-08-29 22:20:57,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-08-29 22:20:57,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2021-08-29 22:20:57,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.78125) internal successors, (114), 64 states have internal predecessors, (114), 0 states have call successors, (0), 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:20:57,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 114 transitions. [2021-08-29 22:20:57,270 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 114 transitions. Word has length 20 [2021-08-29 22:20:57,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:20:57,271 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 114 transitions. [2021-08-29 22:20:57,271 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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:20:57,271 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 114 transitions. [2021-08-29 22:20:57,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-29 22:20:57,271 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:20:57,271 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] [2021-08-29 22:20:57,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-29 22:20:57,272 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:20:57,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:20:57,272 INFO L82 PathProgramCache]: Analyzing trace with hash 289863048, now seen corresponding path program 1 times [2021-08-29 22:20:57,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:20:57,272 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509925384] [2021-08-29 22:20:57,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:20:57,272 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:20:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 22:20:57,336 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-29 22:20:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 22:20:57,430 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-29 22:20:57,431 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-08-29 22:20:57,432 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-08-29 22:20:57,434 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-08-29 22:20:57,435 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2021-08-29 22:20:57,435 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2021-08-29 22:20:57,437 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2021-08-29 22:20:57,437 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-08-29 22:20:57,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-29 22:20:57,442 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-29 22:20:57,442 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-29 22:20:57,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 10:20:57 BasicIcfg [2021-08-29 22:20:57,510 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-29 22:20:57,510 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-29 22:20:57,510 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-29 22:20:57,511 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-29 22:20:57,511 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 10:20:41" (3/4) ... [2021-08-29 22:20:57,512 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-29 22:20:57,584 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-29 22:20:57,585 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-29 22:20:57,585 INFO L158 Benchmark]: Toolchain (without parser) took 17833.51ms. Allocated memory was 56.6MB in the beginning and 197.1MB in the end (delta: 140.5MB). Free memory was 33.4MB in the beginning and 112.5MB in the end (delta: -79.1MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. [2021-08-29 22:20:57,585 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory was 38.3MB in the beginning and 38.3MB in the end (delta: 44.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 22:20:57,585 INFO L158 Benchmark]: CACSL2BoogieTranslator took 476.36ms. Allocated memory is still 56.6MB. Free memory was 33.2MB in the beginning and 25.1MB in the end (delta: 8.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-08-29 22:20:57,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.47ms. Allocated memory is still 56.6MB. Free memory was 24.9MB in the beginning and 21.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-08-29 22:20:57,588 INFO L158 Benchmark]: Boogie Preprocessor took 38.62ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 21.9MB in the beginning and 49.2MB in the end (delta: -27.3MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2021-08-29 22:20:57,589 INFO L158 Benchmark]: RCFGBuilder took 827.55ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 49.2MB in the beginning and 58.3MB in the end (delta: -9.1MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. [2021-08-29 22:20:57,589 INFO L158 Benchmark]: TraceAbstraction took 16373.47ms. Allocated memory was 94.4MB in the beginning and 197.1MB in the end (delta: 102.8MB). Free memory was 57.4MB in the beginning and 132.4MB in the end (delta: -75.0MB). Peak memory consumption was 114.3MB. Max. memory is 16.1GB. [2021-08-29 22:20:57,589 INFO L158 Benchmark]: Witness Printer took 74.38ms. Allocated memory is still 197.1MB. Free memory was 132.4MB in the beginning and 112.5MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-08-29 22:20:57,595 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.16ms. Allocated memory is still 56.6MB. Free memory was 38.3MB in the beginning and 38.3MB in the end (delta: 44.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 476.36ms. Allocated memory is still 56.6MB. Free memory was 33.2MB in the beginning and 25.1MB in the end (delta: 8.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.47ms. Allocated memory is still 56.6MB. Free memory was 24.9MB in the beginning and 21.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.62ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 21.9MB in the beginning and 49.2MB in the end (delta: -27.3MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * RCFGBuilder took 827.55ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 49.2MB in the beginning and 58.3MB in the end (delta: -9.1MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16373.47ms. Allocated memory was 94.4MB in the beginning and 197.1MB in the end (delta: 102.8MB). Free memory was 57.4MB in the beginning and 132.4MB in the end (delta: -75.0MB). Peak memory consumption was 114.3MB. Max. memory is 16.1GB. * Witness Printer took 74.38ms. Allocated memory is still 197.1MB. Free memory was 132.4MB in the beginning and 112.5MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8855.63ms, 114 PlacesBefore, 37 PlacesAfterwards, 106 TransitionsBefore, 28 TransitionsAfterwards, 1876 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 91 TotalNumberOfCompositions, 4508 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1852, positive: 1713, positive conditional: 0, positive unconditional: 1713, negative: 139, negative conditional: 0, negative unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1181, positive: 1142, positive conditional: 0, positive unconditional: 1142, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1181, positive: 1118, positive conditional: 0, positive unconditional: 1118, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 63, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 437, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 385, negative conditional: 0, negative unconditional: 385, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1852, positive: 571, positive conditional: 0, positive unconditional: 571, negative: 100, negative conditional: 0, negative unconditional: 100, unknown: 1181, unknown conditional: 0, unknown unconditional: 1181] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 55, Positive conditional cache size: 0, Positive unconditional cache size: 55, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1879; [L845] FCALL, FORK 0 pthread_create(&t1879, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] 0 pthread_t t1880; [L847] FCALL, FORK 0 pthread_create(&t1880, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L848] 0 pthread_t t1881; [L849] FCALL, FORK 0 pthread_create(&t1881, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 2 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L776] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L780] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L795] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L795] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L796] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L796] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L797] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L797] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L798] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L799] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L799] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L800] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] 3 y$mem_tmp = y [L810] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L810] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L811] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L812] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L812] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L813] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L813] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L814] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L815] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L816] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L816] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EBX = y [L818] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L818] 3 y = y$flush_delayed ? y$mem_tmp : y [L819] 3 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=55, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L862] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L863] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L864] 0 y$flush_delayed = weak$$choice2 [L865] 0 y$mem_tmp = y [L866] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L867] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L868] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L869] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L870] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L872] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L874] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L874] 0 y = y$flush_delayed ? y$mem_tmp : y [L875] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - 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: 845]: 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: 849]: 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: 847]: 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 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 16116.27ms, OverallIterations: 21, TraceHistogramMax: 1, EmptinessCheckTime: 29.09ms, AutomataDifference: 3239.33ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 8924.38ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 901 SdHoareTripleChecker+Valid, 1995.77ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 901 mSDsluCounter, 1295 SdHoareTripleChecker+Invalid, 1707.96ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1492 mSDsCounter, 411 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1860 IncrementalHoareTripleChecker+Invalid, 2271 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 411 mSolverCounterUnsat, 312 mSDtfsCounter, 1860 mSolverCounterSat, 23.77ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1641.38ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=874occurred in iteration=0, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 251.38ms AutomataMinimizationTime, 20 MinimizatonAttempts, 588 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 62.34ms SsaConstructionTime, 651.02ms SatisfiabilityAnalysisTime, 2613.58ms InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 276 ConstructedInterpolants, 0 QuantifiedInterpolants, 4003 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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:20:57,643 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...