/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 11:27:39,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 11:27:39,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 11:27:39,431 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 11:27:39,432 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 11:27:39,433 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 11:27:39,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 11:27:39,436 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 11:27:39,437 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 11:27:39,438 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 11:27:39,439 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 11:27:39,440 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 11:27:39,440 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 11:27:39,441 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 11:27:39,442 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 11:27:39,443 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 11:27:39,443 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 11:27:39,444 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 11:27:39,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 11:27:39,447 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 11:27:39,448 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 11:27:39,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 11:27:39,451 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 11:27:39,452 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 11:27:39,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 11:27:39,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 11:27:39,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 11:27:39,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 11:27:39,456 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 11:27:39,457 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 11:27:39,457 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 11:27:39,458 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 11:27:39,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 11:27:39,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 11:27:39,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 11:27:39,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 11:27:39,461 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 11:27:39,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 11:27:39,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 11:27:39,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 11:27:39,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 11:27:39,463 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2021-03-11 11:27:39,483 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 11:27:39,483 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 11:27:39,485 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 11:27:39,485 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 11:27:39,485 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 11:27:39,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 11:27:39,485 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 11:27:39,485 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 11:27:39,486 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 11:27:39,486 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 11:27:39,486 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 11:27:39,486 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 11:27:39,486 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 11:27:39,486 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 11:27:39,487 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 11:27:39,487 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 11:27:39,487 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 11:27:39,487 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 11:27:39,487 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 11:27:39,487 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 11:27:39,487 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 11:27:39,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 11:27:39,488 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 11:27:39,488 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 11:27:39,488 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 11:27:39,488 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 11:27:39,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 11:27:39,488 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-03-11 11:27:39,489 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 [2021-03-11 11:27:39,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 11:27:39,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 11:27:39,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 11:27:39,789 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 11:27:39,789 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 11:27:39,794 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_pso.opt.i [2021-03-11 11:27:39,853 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46069067f/2b3950ff40894c47a885095c3fad6f1e/FLAG25a7aa6be [2021-03-11 11:27:40,394 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 11:27:40,394 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_pso.opt.i [2021-03-11 11:27:40,420 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46069067f/2b3950ff40894c47a885095c3fad6f1e/FLAG25a7aa6be [2021-03-11 11:27:40,682 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46069067f/2b3950ff40894c47a885095c3fad6f1e [2021-03-11 11:27:40,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 11:27:40,689 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 11:27:40,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 11:27:40,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 11:27:40,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 11:27:40,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:27:40" (1/1) ... [2021-03-11 11:27:40,695 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@527c3016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:27:40, skipping insertion in model container [2021-03-11 11:27:40,695 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:27:40" (1/1) ... [2021-03-11 11:27:40,701 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 11:27:40,756 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 11:27:40,868 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_pso.opt.i[992,1005] [2021-03-11 11:27:41,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 11:27:41,083 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 11:27:41,098 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_pso.opt.i[992,1005] [2021-03-11 11:27:41,160 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 11:27:41,224 INFO L208 MainTranslator]: Completed translation [2021-03-11 11:27:41,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:27:41 WrapperNode [2021-03-11 11:27:41,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 11:27:41,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 11:27:41,226 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 11:27:41,226 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 11:27:41,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:27:41" (1/1) ... [2021-03-11 11:27:41,268 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:27:41" (1/1) ... [2021-03-11 11:27:41,305 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 11:27:41,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 11:27:41,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 11:27:41,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 11:27:41,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:27:41" (1/1) ... [2021-03-11 11:27:41,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:27:41" (1/1) ... [2021-03-11 11:27:41,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:27:41" (1/1) ... [2021-03-11 11:27:41,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:27:41" (1/1) ... [2021-03-11 11:27:41,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:27:41" (1/1) ... [2021-03-11 11:27:41,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:27:41" (1/1) ... [2021-03-11 11:27:41,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:27:41" (1/1) ... [2021-03-11 11:27:41,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 11:27:41,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 11:27:41,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 11:27:41,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 11:27:41,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:27:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 11:27:41,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 11:27:41,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 11:27:41,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 11:27:41,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 11:27:41,448 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 11:27:41,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 11:27:41,449 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 11:27:41,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 11:27:41,449 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 11:27:41,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 11:27:41,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 11:27:41,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 11:27:41,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 11:27:41,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 11:27:41,452 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 11:27:44,362 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 11:27:44,363 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 11:27:44,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:27:44 BoogieIcfgContainer [2021-03-11 11:27:44,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 11:27:44,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 11:27:44,366 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 11:27:44,368 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 11:27:44,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 11:27:40" (1/3) ... [2021-03-11 11:27:44,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7168ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:27:44, skipping insertion in model container [2021-03-11 11:27:44,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:27:41" (2/3) ... [2021-03-11 11:27:44,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f7168ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:27:44, skipping insertion in model container [2021-03-11 11:27:44,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:27:44" (3/3) ... [2021-03-11 11:27:44,370 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_pso.opt.i [2021-03-11 11:27:44,376 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-03-11 11:27:44,376 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 11:27:44,379 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 11:27:44,380 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 11:27:44,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,425 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,425 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,425 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,425 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,440 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,440 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,440 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,440 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,440 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,440 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,441 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,441 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,441 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,441 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,441 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,445 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,445 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,445 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,446 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,454 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,455 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,456 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,458 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,459 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,464 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,464 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,464 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,464 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,464 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,464 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,464 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,464 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,464 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,464 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,464 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,465 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,465 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,465 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,466 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,480 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,481 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,486 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,487 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,487 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,489 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,489 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,489 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:44,491 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 11:27:44,505 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-11 11:27:44,531 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 11:27:44,531 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 11:27:44,531 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 11:27:44,531 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 11:27:44,531 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 11:27:44,531 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 11:27:44,531 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 11:27:44,531 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 11:27:44,550 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 11:27:44,569 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 97 transitions, 209 flow [2021-03-11 11:27:44,571 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 97 transitions, 209 flow [2021-03-11 11:27:44,572 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-11 11:27:44,615 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-11 11:27:44,615 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 11:27:44,618 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-11 11:27:44,621 INFO L116 LiptonReduction]: Number of co-enabled transitions 1668 [2021-03-11 11:27:44,986 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-11 11:27:45,413 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-11 11:27:45,550 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-11 11:27:46,931 WARN L205 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2021-03-11 11:27:47,281 WARN L205 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-11 11:27:48,605 WARN L205 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-11 11:27:49,204 WARN L205 SmtUtils]: Spent 596.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-11 11:27:50,586 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-03-11 11:27:50,794 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-11 11:27:50,904 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-11 11:27:53,244 WARN L205 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-11 11:27:53,372 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-11 11:27:53,640 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-11 11:27:53,764 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-11 11:27:53,770 INFO L131 LiptonReduction]: Checked pairs total: 4547 [2021-03-11 11:27:53,770 INFO L133 LiptonReduction]: Total number of compositions: 81 [2021-03-11 11:27:53,778 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2021-03-11 11:27:53,827 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 922 states, 918 states have (on average 3.3681917211328978) internal successors, (3092), 921 states have internal predecessors, (3092), 0 states have call successors, (0), 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-03-11 11:27:53,833 INFO L276 IsEmpty]: Start isEmpty. Operand has 922 states, 918 states have (on average 3.3681917211328978) internal successors, (3092), 921 states have internal predecessors, (3092), 0 states have call successors, (0), 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-03-11 11:27:53,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-03-11 11:27:53,837 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:53,838 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:53,838 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:53,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:53,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1589545331, now seen corresponding path program 1 times [2021-03-11 11:27:53,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:53,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063932678] [2021-03-11 11:27:53,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:54,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:54,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:27:54,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:54,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063932678] [2021-03-11 11:27:54,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:54,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 11:27:54,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860158602] [2021-03-11 11:27:54,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 11:27:54,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:54,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 11:27:54,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:27:54,100 INFO L87 Difference]: Start difference. First operand has 922 states, 918 states have (on average 3.3681917211328978) internal successors, (3092), 921 states have internal predecessors, (3092), 0 states have call successors, (0), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-03-11 11:27:54,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:54,182 INFO L93 Difference]: Finished difference Result 778 states and 2456 transitions. [2021-03-11 11:27:54,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 11:27:54,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-03-11 11:27:54,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:54,208 INFO L225 Difference]: With dead ends: 778 [2021-03-11 11:27:54,208 INFO L226 Difference]: Without dead ends: 658 [2021-03-11 11:27:54,209 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:27:54,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2021-03-11 11:27:54,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 658. [2021-03-11 11:27:54,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 657 states have (on average 3.1202435312024352) internal successors, (2050), 657 states have internal predecessors, (2050), 0 states have call successors, (0), 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-03-11 11:27:54,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 2050 transitions. [2021-03-11 11:27:54,305 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 2050 transitions. Word has length 7 [2021-03-11 11:27:54,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:54,305 INFO L480 AbstractCegarLoop]: Abstraction has 658 states and 2050 transitions. [2021-03-11 11:27:54,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-03-11 11:27:54,305 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 2050 transitions. [2021-03-11 11:27:54,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-03-11 11:27:54,307 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:54,307 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:54,307 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 11:27:54,307 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:54,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:54,308 INFO L82 PathProgramCache]: Analyzing trace with hash -2127661499, now seen corresponding path program 1 times [2021-03-11 11:27:54,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:54,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473364726] [2021-03-11 11:27:54,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:54,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:54,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:27:54,407 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:27:54,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:27:54,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:54,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473364726] [2021-03-11 11:27:54,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:54,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 11:27:54,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346446404] [2021-03-11 11:27:54,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 11:27:54,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:54,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 11:27:54,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:27:54,414 INFO L87 Difference]: Start difference. First operand 658 states and 2050 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-03-11 11:27:54,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:54,488 INFO L93 Difference]: Finished difference Result 754 states and 2256 transitions. [2021-03-11 11:27:54,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:27:54,489 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-03-11 11:27:54,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:54,493 INFO L225 Difference]: With dead ends: 754 [2021-03-11 11:27:54,493 INFO L226 Difference]: Without dead ends: 634 [2021-03-11 11:27:54,494 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:27:54,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2021-03-11 11:27:54,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2021-03-11 11:27:54,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 633 states have (on average 3.0932069510268563) internal successors, (1958), 633 states have internal predecessors, (1958), 0 states have call successors, (0), 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-03-11 11:27:54,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 1958 transitions. [2021-03-11 11:27:54,511 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 1958 transitions. Word has length 10 [2021-03-11 11:27:54,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:54,511 INFO L480 AbstractCegarLoop]: Abstraction has 634 states and 1958 transitions. [2021-03-11 11:27:54,511 INFO L481 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-03-11 11:27:54,512 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 1958 transitions. [2021-03-11 11:27:54,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-03-11 11:27:54,513 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:54,513 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:54,513 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 11:27:54,513 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:54,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:54,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1533144728, now seen corresponding path program 1 times [2021-03-11 11:27:54,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:54,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771865177] [2021-03-11 11:27:54,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:54,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:54,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:27:54,585 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:27:54,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:27:54,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:54,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771865177] [2021-03-11 11:27:54,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:54,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 11:27:54,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431521146] [2021-03-11 11:27:54,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 11:27:54,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:54,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 11:27:54,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:27:54,590 INFO L87 Difference]: Start difference. First operand 634 states and 1958 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-03-11 11:27:54,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:54,621 INFO L93 Difference]: Finished difference Result 634 states and 1886 transitions. [2021-03-11 11:27:54,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:27:54,622 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-03-11 11:27:54,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:54,630 INFO L225 Difference]: With dead ends: 634 [2021-03-11 11:27:54,631 INFO L226 Difference]: Without dead ends: 526 [2021-03-11 11:27:54,632 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:27:54,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2021-03-11 11:27:54,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2021-03-11 11:27:54,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 3.0095238095238095) internal successors, (1580), 525 states have internal predecessors, (1580), 0 states have call successors, (0), 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-03-11 11:27:54,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 1580 transitions. [2021-03-11 11:27:54,646 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 1580 transitions. Word has length 11 [2021-03-11 11:27:54,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:54,646 INFO L480 AbstractCegarLoop]: Abstraction has 526 states and 1580 transitions. [2021-03-11 11:27:54,646 INFO L481 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-03-11 11:27:54,646 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 1580 transitions. [2021-03-11 11:27:54,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-03-11 11:27:54,654 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:54,654 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:54,654 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 11:27:54,654 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:54,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:54,655 INFO L82 PathProgramCache]: Analyzing trace with hash 403958885, now seen corresponding path program 1 times [2021-03-11 11:27:54,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:54,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124369409] [2021-03-11 11:27:54,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:54,850 INFO L142 QuantifierPusher]: treesize reduction 30, result has 34.8 percent of original size [2021-03-11 11:27:54,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 11:27:54,868 INFO L142 QuantifierPusher]: treesize reduction 30, result has 38.8 percent of original size [2021-03-11 11:27:54,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 11:27:54,889 INFO L142 QuantifierPusher]: treesize reduction 72, result has 45.9 percent of original size [2021-03-11 11:27:54,893 INFO L147 QuantifierPusher]: treesize reduction 29, result has 52.5 percent of original size 32 [2021-03-11 11:27:54,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:54,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 11:27:54,936 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.1 percent of original size [2021-03-11 11:27:54,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-11 11:27:54,965 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:27:54,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:27:54,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:54,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124369409] [2021-03-11 11:27:54,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:54,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 11:27:54,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585618622] [2021-03-11 11:27:54,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 11:27:54,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:54,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 11:27:54,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:27:54,974 INFO L87 Difference]: Start difference. First operand 526 states and 1580 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-03-11 11:27:55,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:55,157 INFO L93 Difference]: Finished difference Result 553 states and 1625 transitions. [2021-03-11 11:27:55,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 11:27:55,159 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-03-11 11:27:55,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:55,162 INFO L225 Difference]: With dead ends: 553 [2021-03-11 11:27:55,162 INFO L226 Difference]: Without dead ends: 508 [2021-03-11 11:27:55,162 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 102.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-03-11 11:27:55,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2021-03-11 11:27:55,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 508. [2021-03-11 11:27:55,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 507 states have (on average 2.998027613412229) internal successors, (1520), 507 states have internal predecessors, (1520), 0 states have call successors, (0), 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-03-11 11:27:55,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 1520 transitions. [2021-03-11 11:27:55,176 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 1520 transitions. Word has length 14 [2021-03-11 11:27:55,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:55,176 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 1520 transitions. [2021-03-11 11:27:55,176 INFO L481 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-03-11 11:27:55,177 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 1520 transitions. [2021-03-11 11:27:55,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-03-11 11:27:55,178 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:55,178 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:55,178 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 11:27:55,178 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:55,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:55,179 INFO L82 PathProgramCache]: Analyzing trace with hash -362800808, now seen corresponding path program 1 times [2021-03-11 11:27:55,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:55,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221326660] [2021-03-11 11:27:55,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:55,289 INFO L142 QuantifierPusher]: treesize reduction 10, result has 60.0 percent of original size [2021-03-11 11:27:55,290 INFO L147 QuantifierPusher]: treesize reduction 4, result has 73.3 percent of original size 11 [2021-03-11 11:27:55,301 INFO L142 QuantifierPusher]: treesize reduction 3, result has 80.0 percent of original size [2021-03-11 11:27:55,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-11 11:27:55,310 INFO L142 QuantifierPusher]: treesize reduction 3, result has 86.4 percent of original size [2021-03-11 11:27:55,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 11:27:55,325 INFO L142 QuantifierPusher]: treesize reduction 7, result has 77.4 percent of original size [2021-03-11 11:27:55,326 INFO L147 QuantifierPusher]: treesize reduction 4, result has 83.3 percent of original size 20 [2021-03-11 11:27:55,352 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:27:55,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:27:55,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:55,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221326660] [2021-03-11 11:27:55,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:55,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 11:27:55,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617826597] [2021-03-11 11:27:55,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 11:27:55,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:55,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 11:27:55,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:27:55,360 INFO L87 Difference]: Start difference. First operand 508 states and 1520 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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-03-11 11:27:55,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:55,528 INFO L93 Difference]: Finished difference Result 641 states and 1908 transitions. [2021-03-11 11:27:55,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 11:27:55,529 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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-03-11 11:27:55,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:55,532 INFO L225 Difference]: With dead ends: 641 [2021-03-11 11:27:55,532 INFO L226 Difference]: Without dead ends: 592 [2021-03-11 11:27:55,532 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 100.3ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-03-11 11:27:55,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2021-03-11 11:27:55,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 544. [2021-03-11 11:27:55,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 543 states have (on average 3.014732965009208) internal successors, (1637), 543 states have internal predecessors, (1637), 0 states have call successors, (0), 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-03-11 11:27:55,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 1637 transitions. [2021-03-11 11:27:55,547 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 1637 transitions. Word has length 15 [2021-03-11 11:27:55,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:55,548 INFO L480 AbstractCegarLoop]: Abstraction has 544 states and 1637 transitions. [2021-03-11 11:27:55,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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-03-11 11:27:55,548 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 1637 transitions. [2021-03-11 11:27:55,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-03-11 11:27:55,549 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:55,549 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:55,549 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 11:27:55,549 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:55,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:55,550 INFO L82 PathProgramCache]: Analyzing trace with hash -362166548, now seen corresponding path program 2 times [2021-03-11 11:27:55,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:55,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588616666] [2021-03-11 11:27:55,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:55,679 INFO L142 QuantifierPusher]: treesize reduction 15, result has 42.3 percent of original size [2021-03-11 11:27:55,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 11:27:55,685 INFO L142 QuantifierPusher]: treesize reduction 15, result has 48.3 percent of original size [2021-03-11 11:27:55,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 11:27:55,694 INFO L142 QuantifierPusher]: treesize reduction 15, result has 58.3 percent of original size [2021-03-11 11:27:55,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 11:27:55,708 INFO L142 QuantifierPusher]: treesize reduction 3, result has 91.7 percent of original size [2021-03-11 11:27:55,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-11 11:27:55,739 INFO L142 QuantifierPusher]: treesize reduction 3, result has 86.4 percent of original size [2021-03-11 11:27:55,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 11:27:55,761 INFO L142 QuantifierPusher]: treesize reduction 3, result has 86.4 percent of original size [2021-03-11 11:27:55,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 11:27:55,783 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:27:55,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:27:55,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:55,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588616666] [2021-03-11 11:27:55,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:55,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 11:27:55,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671096518] [2021-03-11 11:27:55,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 11:27:55,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:55,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 11:27:55,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-03-11 11:27:55,790 INFO L87 Difference]: Start difference. First operand 544 states and 1637 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-03-11 11:27:55,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:55,958 INFO L93 Difference]: Finished difference Result 731 states and 2178 transitions. [2021-03-11 11:27:55,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 11:27:55,959 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-03-11 11:27:55,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:55,962 INFO L225 Difference]: With dead ends: 731 [2021-03-11 11:27:55,962 INFO L226 Difference]: Without dead ends: 668 [2021-03-11 11:27:55,963 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 130.6ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-03-11 11:27:55,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2021-03-11 11:27:55,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 580. [2021-03-11 11:27:55,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 579 states have (on average 3.0086355785837653) internal successors, (1742), 579 states have internal predecessors, (1742), 0 states have call successors, (0), 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-03-11 11:27:55,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 1742 transitions. [2021-03-11 11:27:55,978 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 1742 transitions. Word has length 15 [2021-03-11 11:27:55,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:55,978 INFO L480 AbstractCegarLoop]: Abstraction has 580 states and 1742 transitions. [2021-03-11 11:27:55,978 INFO L481 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-03-11 11:27:55,978 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 1742 transitions. [2021-03-11 11:27:55,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-03-11 11:27:55,980 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:55,980 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:55,980 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 11:27:55,980 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:55,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:55,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1167264952, now seen corresponding path program 3 times [2021-03-11 11:27:55,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:55,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351083560] [2021-03-11 11:27:55,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:56,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:56,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:27:56,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:56,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:27:56,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:56,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-11 11:27:56,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:56,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-11 11:27:56,120 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:27:56,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:27:56,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:56,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351083560] [2021-03-11 11:27:56,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:56,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 11:27:56,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133303820] [2021-03-11 11:27:56,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 11:27:56,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:56,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 11:27:56,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:27:56,131 INFO L87 Difference]: Start difference. First operand 580 states and 1742 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 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-03-11 11:27:56,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:56,320 INFO L93 Difference]: Finished difference Result 703 states and 2073 transitions. [2021-03-11 11:27:56,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 11:27:56,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 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-03-11 11:27:56,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:56,323 INFO L225 Difference]: With dead ends: 703 [2021-03-11 11:27:56,324 INFO L226 Difference]: Without dead ends: 646 [2021-03-11 11:27:56,324 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 70.8ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-03-11 11:27:56,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2021-03-11 11:27:56,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 586. [2021-03-11 11:27:56,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 585 states have (on average 2.9811965811965813) internal successors, (1744), 585 states have internal predecessors, (1744), 0 states have call successors, (0), 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-03-11 11:27:56,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 1744 transitions. [2021-03-11 11:27:56,338 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 1744 transitions. Word has length 15 [2021-03-11 11:27:56,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:56,338 INFO L480 AbstractCegarLoop]: Abstraction has 586 states and 1744 transitions. [2021-03-11 11:27:56,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 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-03-11 11:27:56,338 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 1744 transitions. [2021-03-11 11:27:56,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-03-11 11:27:56,339 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:56,339 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:56,339 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 11:27:56,340 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:56,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:56,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1636350218, now seen corresponding path program 1 times [2021-03-11 11:27:56,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:56,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281593215] [2021-03-11 11:27:56,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:56,476 INFO L142 QuantifierPusher]: treesize reduction 17, result has 45.2 percent of original size [2021-03-11 11:27:56,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 11:27:56,483 INFO L142 QuantifierPusher]: treesize reduction 17, result has 50.0 percent of original size [2021-03-11 11:27:56,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 11:27:56,495 INFO L142 QuantifierPusher]: treesize reduction 17, result has 65.3 percent of original size [2021-03-11 11:27:56,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-11 11:27:56,531 INFO L142 QuantifierPusher]: treesize reduction 50, result has 65.3 percent of original size [2021-03-11 11:27:56,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-03-11 11:27:56,575 INFO L142 QuantifierPusher]: treesize reduction 50, result has 66.0 percent of original size [2021-03-11 11:27:56,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 97 [2021-03-11 11:27:56,611 INFO L142 QuantifierPusher]: treesize reduction 3, result has 88.0 percent of original size [2021-03-11 11:27:56,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-11 11:27:56,673 INFO L142 QuantifierPusher]: treesize reduction 3, result has 86.4 percent of original size [2021-03-11 11:27:56,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 11:27:56,697 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:27:56,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:27:56,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:56,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281593215] [2021-03-11 11:27:56,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:56,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-11 11:27:56,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633470330] [2021-03-11 11:27:56,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-11 11:27:56,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:56,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-11 11:27:56,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-11 11:27:56,704 INFO L87 Difference]: Start difference. First operand 586 states and 1744 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-03-11 11:27:56,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:56,967 INFO L93 Difference]: Finished difference Result 694 states and 2036 transitions. [2021-03-11 11:27:56,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 11:27:56,967 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-03-11 11:27:56,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:56,971 INFO L225 Difference]: With dead ends: 694 [2021-03-11 11:27:56,971 INFO L226 Difference]: Without dead ends: 656 [2021-03-11 11:27:56,971 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 268.4ms TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-03-11 11:27:56,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2021-03-11 11:27:57,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 598. [2021-03-11 11:27:57,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 2.9782244556113904) internal successors, (1778), 597 states have internal predecessors, (1778), 0 states have call successors, (0), 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-03-11 11:27:57,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 1778 transitions. [2021-03-11 11:27:57,007 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 1778 transitions. Word has length 16 [2021-03-11 11:27:57,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:57,008 INFO L480 AbstractCegarLoop]: Abstraction has 598 states and 1778 transitions. [2021-03-11 11:27:57,008 INFO L481 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-03-11 11:27:57,008 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 1778 transitions. [2021-03-11 11:27:57,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-03-11 11:27:57,009 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:57,009 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:57,009 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 11:27:57,009 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:57,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:57,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1636111890, now seen corresponding path program 1 times [2021-03-11 11:27:57,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:57,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322066550] [2021-03-11 11:27:57,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:57,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:57,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:27:57,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:57,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 11:27:57,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:57,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-11 11:27:57,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:57,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-11 11:27:57,127 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:27:57,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:27:57,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:57,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322066550] [2021-03-11 11:27:57,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:57,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 11:27:57,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684609407] [2021-03-11 11:27:57,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 11:27:57,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:57,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 11:27:57,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:27:57,135 INFO L87 Difference]: Start difference. First operand 598 states and 1778 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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-03-11 11:27:57,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:57,310 INFO L93 Difference]: Finished difference Result 790 states and 2266 transitions. [2021-03-11 11:27:57,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 11:27:57,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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-03-11 11:27:57,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:57,314 INFO L225 Difference]: With dead ends: 790 [2021-03-11 11:27:57,314 INFO L226 Difference]: Without dead ends: 722 [2021-03-11 11:27:57,314 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 94.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-03-11 11:27:57,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2021-03-11 11:27:57,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 578. [2021-03-11 11:27:57,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 577 states have (on average 2.946273830155979) internal successors, (1700), 577 states have internal predecessors, (1700), 0 states have call successors, (0), 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-03-11 11:27:57,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 1700 transitions. [2021-03-11 11:27:57,336 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 1700 transitions. Word has length 16 [2021-03-11 11:27:57,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:57,337 INFO L480 AbstractCegarLoop]: Abstraction has 578 states and 1700 transitions. [2021-03-11 11:27:57,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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-03-11 11:27:57,337 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 1700 transitions. [2021-03-11 11:27:57,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-03-11 11:27:57,338 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:57,338 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:57,338 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 11:27:57,338 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:57,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:57,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1150816500, now seen corresponding path program 1 times [2021-03-11 11:27:57,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:57,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857792883] [2021-03-11 11:27:57,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:57,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:57,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:27:57,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:57,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:27:57,387 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:27:57,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:27:57,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:57,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857792883] [2021-03-11 11:27:57,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:57,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 11:27:57,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610937464] [2021-03-11 11:27:57,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 11:27:57,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:57,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 11:27:57,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:27:57,392 INFO L87 Difference]: Start difference. First operand 578 states and 1700 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-03-11 11:27:57,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:57,415 INFO L93 Difference]: Finished difference Result 828 states and 2359 transitions. [2021-03-11 11:27:57,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:27:57,415 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-03-11 11:27:57,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:57,419 INFO L225 Difference]: With dead ends: 828 [2021-03-11 11:27:57,419 INFO L226 Difference]: Without dead ends: 450 [2021-03-11 11:27:57,419 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:27:57,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-03-11 11:27:57,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 426. [2021-03-11 11:27:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 425 states have (on average 2.743529411764706) internal successors, (1166), 425 states have internal predecessors, (1166), 0 states have call successors, (0), 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-03-11 11:27:57,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1166 transitions. [2021-03-11 11:27:57,431 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1166 transitions. Word has length 16 [2021-03-11 11:27:57,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:57,433 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 1166 transitions. [2021-03-11 11:27:57,433 INFO L481 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-03-11 11:27:57,433 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1166 transitions. [2021-03-11 11:27:57,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-03-11 11:27:57,434 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:57,434 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:57,434 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 11:27:57,434 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:57,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:57,435 INFO L82 PathProgramCache]: Analyzing trace with hash -821865584, now seen corresponding path program 1 times [2021-03-11 11:27:57,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:57,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495404132] [2021-03-11 11:27:57,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:57,520 INFO L142 QuantifierPusher]: treesize reduction 10, result has 60.0 percent of original size [2021-03-11 11:27:57,521 INFO L147 QuantifierPusher]: treesize reduction 4, result has 73.3 percent of original size 11 [2021-03-11 11:27:57,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:57,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 11:27:57,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:57,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 11:27:57,563 INFO L142 QuantifierPusher]: treesize reduction 3, result has 80.0 percent of original size [2021-03-11 11:27:57,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-11 11:27:57,576 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:27:57,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:27:57,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:57,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495404132] [2021-03-11 11:27:57,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:57,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 11:27:57,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304297159] [2021-03-11 11:27:57,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 11:27:57,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:57,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 11:27:57,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:27:57,585 INFO L87 Difference]: Start difference. First operand 426 states and 1166 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-03-11 11:27:57,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:57,794 INFO L93 Difference]: Finished difference Result 602 states and 1608 transitions. [2021-03-11 11:27:57,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-11 11:27:57,795 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-03-11 11:27:57,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:57,797 INFO L225 Difference]: With dead ends: 602 [2021-03-11 11:27:57,798 INFO L226 Difference]: Without dead ends: 504 [2021-03-11 11:27:57,798 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 129.1ms TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-03-11 11:27:57,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2021-03-11 11:27:57,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 438. [2021-03-11 11:27:57,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 437 states have (on average 2.7414187643020593) internal successors, (1198), 437 states have internal predecessors, (1198), 0 states have call successors, (0), 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-03-11 11:27:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1198 transitions. [2021-03-11 11:27:57,810 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1198 transitions. Word has length 17 [2021-03-11 11:27:57,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:57,810 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 1198 transitions. [2021-03-11 11:27:57,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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-03-11 11:27:57,810 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1198 transitions. [2021-03-11 11:27:57,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-03-11 11:27:57,811 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:57,811 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:57,811 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 11:27:57,811 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:57,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:57,812 INFO L82 PathProgramCache]: Analyzing trace with hash -760284704, now seen corresponding path program 2 times [2021-03-11 11:27:57,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:57,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502495659] [2021-03-11 11:27:57,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:57,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:57,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 11:27:57,922 INFO L142 QuantifierPusher]: treesize reduction 17, result has 71.7 percent of original size [2021-03-11 11:27:57,923 INFO L147 QuantifierPusher]: treesize reduction 9, result has 79.1 percent of original size 34 [2021-03-11 11:27:57,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:57,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:27:57,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:57,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:27:57,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:57,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 11:27:57,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:57,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:27:57,975 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:27:57,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:27:57,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:57,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502495659] [2021-03-11 11:27:57,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:57,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 11:27:57,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964686201] [2021-03-11 11:27:57,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 11:27:57,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:57,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 11:27:57,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-03-11 11:27:57,999 INFO L87 Difference]: Start difference. First operand 438 states and 1198 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 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-03-11 11:27:58,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:58,217 INFO L93 Difference]: Finished difference Result 554 states and 1483 transitions. [2021-03-11 11:27:58,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-11 11:27:58,217 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 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-03-11 11:27:58,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:58,220 INFO L225 Difference]: With dead ends: 554 [2021-03-11 11:27:58,220 INFO L226 Difference]: Without dead ends: 507 [2021-03-11 11:27:58,220 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 126.9ms TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2021-03-11 11:27:58,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2021-03-11 11:27:58,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 436. [2021-03-11 11:27:58,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 435 states have (on average 2.740229885057471) internal successors, (1192), 435 states have internal predecessors, (1192), 0 states have call successors, (0), 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-03-11 11:27:58,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1192 transitions. [2021-03-11 11:27:58,231 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1192 transitions. Word has length 17 [2021-03-11 11:27:58,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:58,231 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 1192 transitions. [2021-03-11 11:27:58,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 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-03-11 11:27:58,231 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1192 transitions. [2021-03-11 11:27:58,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-03-11 11:27:58,232 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:58,232 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:58,232 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 11:27:58,232 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:58,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:58,233 INFO L82 PathProgramCache]: Analyzing trace with hash -150760844, now seen corresponding path program 3 times [2021-03-11 11:27:58,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:58,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787880390] [2021-03-11 11:27:58,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:58,294 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-03-11 11:27:58,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-11 11:27:58,324 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.1 percent of original size [2021-03-11 11:27:58,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-11 11:27:58,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:58,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 11:27:58,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:58,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-11 11:27:58,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:58,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-11 11:27:58,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:58,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-11 11:27:58,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:58,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-11 11:27:58,417 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:27:58,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:27:58,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:58,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787880390] [2021-03-11 11:27:58,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:58,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-11 11:27:58,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932554919] [2021-03-11 11:27:58,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-11 11:27:58,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:58,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-11 11:27:58,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-03-11 11:27:58,426 INFO L87 Difference]: Start difference. First operand 436 states and 1192 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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-03-11 11:27:58,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:58,682 INFO L93 Difference]: Finished difference Result 602 states and 1622 transitions. [2021-03-11 11:27:58,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 11:27:58,683 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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-03-11 11:27:58,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:58,689 INFO L225 Difference]: With dead ends: 602 [2021-03-11 11:27:58,689 INFO L226 Difference]: Without dead ends: 524 [2021-03-11 11:27:58,689 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 244.2ms TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2021-03-11 11:27:58,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2021-03-11 11:27:58,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 448. [2021-03-11 11:27:58,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 2.7315436241610738) internal successors, (1221), 447 states have internal predecessors, (1221), 0 states have call successors, (0), 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-03-11 11:27:58,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1221 transitions. [2021-03-11 11:27:58,700 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 1221 transitions. Word has length 17 [2021-03-11 11:27:58,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:58,700 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 1221 transitions. [2021-03-11 11:27:58,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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-03-11 11:27:58,700 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1221 transitions. [2021-03-11 11:27:58,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-03-11 11:27:58,702 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:58,702 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:58,702 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-11 11:27:58,702 INFO L428 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:58,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:58,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1355643283, now seen corresponding path program 1 times [2021-03-11 11:27:58,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:58,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305816237] [2021-03-11 11:27:58,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:58,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:58,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:27:58,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:58,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:27:58,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:58,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:27:58,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:58,775 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305816237] [2021-03-11 11:27:58,775 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:58,775 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 11:27:58,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548012283] [2021-03-11 11:27:58,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 11:27:58,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:58,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 11:27:58,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:27:58,776 INFO L87 Difference]: Start difference. First operand 448 states and 1221 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-03-11 11:27:58,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:58,798 INFO L93 Difference]: Finished difference Result 436 states and 1042 transitions. [2021-03-11 11:27:58,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:27:58,799 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-03-11 11:27:58,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:58,800 INFO L225 Difference]: With dead ends: 436 [2021-03-11 11:27:58,800 INFO L226 Difference]: Without dead ends: 312 [2021-03-11 11:27:58,800 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:27:58,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-03-11 11:27:58,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2021-03-11 11:27:58,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 2.3183279742765275) internal successors, (721), 311 states have internal predecessors, (721), 0 states have call successors, (0), 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-03-11 11:27:58,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 721 transitions. [2021-03-11 11:27:58,807 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 721 transitions. Word has length 17 [2021-03-11 11:27:58,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:58,807 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 721 transitions. [2021-03-11 11:27:58,807 INFO L481 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-03-11 11:27:58,807 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 721 transitions. [2021-03-11 11:27:58,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-03-11 11:27:58,808 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:58,808 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:58,808 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-11 11:27:58,808 INFO L428 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:58,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:58,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1579049384, now seen corresponding path program 1 times [2021-03-11 11:27:58,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:58,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102787558] [2021-03-11 11:27:58,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:58,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:58,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:27:58,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:58,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:27:58,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:58,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:27:58,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:58,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:27:58,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:58,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102787558] [2021-03-11 11:27:58,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:58,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 11:27:58,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748282738] [2021-03-11 11:27:58,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 11:27:58,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:58,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 11:27:58,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:27:58,921 INFO L87 Difference]: Start difference. First operand 312 states and 721 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-03-11 11:27:58,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:58,952 INFO L93 Difference]: Finished difference Result 254 states and 528 transitions. [2021-03-11 11:27:58,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 11:27:58,952 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-03-11 11:27:58,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:58,953 INFO L225 Difference]: With dead ends: 254 [2021-03-11 11:27:58,953 INFO L226 Difference]: Without dead ends: 192 [2021-03-11 11:27:58,953 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 15.8ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:27:58,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-03-11 11:27:58,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 188. [2021-03-11 11:27:58,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 2.0053475935828877) internal successors, (375), 187 states have internal predecessors, (375), 0 states have call successors, (0), 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-03-11 11:27:58,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 375 transitions. [2021-03-11 11:27:58,957 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 375 transitions. Word has length 18 [2021-03-11 11:27:58,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:58,957 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 375 transitions. [2021-03-11 11:27:58,957 INFO L481 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-03-11 11:27:58,957 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 375 transitions. [2021-03-11 11:27:58,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-03-11 11:27:58,958 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:58,958 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:58,958 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-11 11:27:58,958 INFO L428 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:58,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:58,958 INFO L82 PathProgramCache]: Analyzing trace with hash 216753937, now seen corresponding path program 1 times [2021-03-11 11:27:58,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:58,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570644410] [2021-03-11 11:27:58,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:59,036 INFO L142 QuantifierPusher]: treesize reduction 20, result has 66.1 percent of original size [2021-03-11 11:27:59,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-11 11:27:59,060 INFO L142 QuantifierPusher]: treesize reduction 20, result has 67.7 percent of original size [2021-03-11 11:27:59,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-11 11:27:59,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:59,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-11 11:27:59,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:59,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 11:27:59,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:59,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-11 11:27:59,119 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:59,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-11 11:27:59,128 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:27:59,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:27:59,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:59,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570644410] [2021-03-11 11:27:59,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:59,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 11:27:59,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240064286] [2021-03-11 11:27:59,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 11:27:59,137 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:59,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 11:27:59,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-03-11 11:27:59,138 INFO L87 Difference]: Start difference. First operand 188 states and 375 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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-03-11 11:27:59,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:59,374 INFO L93 Difference]: Finished difference Result 271 states and 533 transitions. [2021-03-11 11:27:59,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-11 11:27:59,375 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2021-03-11 11:27:59,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:59,376 INFO L225 Difference]: With dead ends: 271 [2021-03-11 11:27:59,376 INFO L226 Difference]: Without dead ends: 225 [2021-03-11 11:27:59,376 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 181.4ms TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-03-11 11:27:59,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-03-11 11:27:59,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 192. [2021-03-11 11:27:59,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 2.0157068062827226) internal successors, (385), 191 states have internal predecessors, (385), 0 states have call successors, (0), 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-03-11 11:27:59,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 385 transitions. [2021-03-11 11:27:59,380 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 385 transitions. Word has length 19 [2021-03-11 11:27:59,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:59,380 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 385 transitions. [2021-03-11 11:27:59,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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-03-11 11:27:59,381 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 385 transitions. [2021-03-11 11:27:59,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-03-11 11:27:59,381 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:59,381 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:59,381 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-11 11:27:59,381 INFO L428 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:59,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:59,382 INFO L82 PathProgramCache]: Analyzing trace with hash -701196253, now seen corresponding path program 2 times [2021-03-11 11:27:59,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:59,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130398794] [2021-03-11 11:27:59,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:59,447 INFO L142 QuantifierPusher]: treesize reduction 30, result has 25.0 percent of original size [2021-03-11 11:27:59,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:27:59,453 INFO L142 QuantifierPusher]: treesize reduction 30, result has 30.2 percent of original size [2021-03-11 11:27:59,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:27:59,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:59,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:27:59,473 INFO L142 QuantifierPusher]: treesize reduction 17, result has 71.7 percent of original size [2021-03-11 11:27:59,474 INFO L147 QuantifierPusher]: treesize reduction 9, result has 79.1 percent of original size 34 [2021-03-11 11:27:59,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:59,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:27:59,505 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:27:59,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:27:59,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:59,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130398794] [2021-03-11 11:27:59,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:59,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 11:27:59,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128663502] [2021-03-11 11:27:59,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 11:27:59,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:59,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 11:27:59,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-11 11:27:59,518 INFO L87 Difference]: Start difference. First operand 192 states and 385 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-03-11 11:27:59,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:59,670 INFO L93 Difference]: Finished difference Result 270 states and 532 transitions. [2021-03-11 11:27:59,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 11:27:59,670 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2021-03-11 11:27:59,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:59,671 INFO L225 Difference]: With dead ends: 270 [2021-03-11 11:27:59,671 INFO L226 Difference]: Without dead ends: 195 [2021-03-11 11:27:59,672 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 69.5ms TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-03-11 11:27:59,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2021-03-11 11:27:59,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2021-03-11 11:27:59,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 2.0) internal successors, (382), 191 states have internal predecessors, (382), 0 states have call successors, (0), 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-03-11 11:27:59,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 382 transitions. [2021-03-11 11:27:59,676 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 382 transitions. Word has length 19 [2021-03-11 11:27:59,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:59,676 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 382 transitions. [2021-03-11 11:27:59,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-03-11 11:27:59,676 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 382 transitions. [2021-03-11 11:27:59,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-03-11 11:27:59,676 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:59,677 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:59,677 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-11 11:27:59,677 INFO L428 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:59,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:59,677 INFO L82 PathProgramCache]: Analyzing trace with hash 781878961, now seen corresponding path program 3 times [2021-03-11 11:27:59,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:59,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44042697] [2021-03-11 11:27:59,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:59,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:59,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:27:59,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:59,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:27:59,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:59,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 11:27:59,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:59,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-11 11:27:59,770 INFO L142 QuantifierPusher]: treesize reduction 3, result has 83.3 percent of original size [2021-03-11 11:27:59,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-11 11:27:59,781 INFO L142 QuantifierPusher]: treesize reduction 3, result has 72.7 percent of original size [2021-03-11 11:27:59,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-11 11:27:59,790 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:27:59,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:27:59,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:59,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44042697] [2021-03-11 11:27:59,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:59,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 11:27:59,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236747776] [2021-03-11 11:27:59,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 11:27:59,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:59,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 11:27:59,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-03-11 11:27:59,801 INFO L87 Difference]: Start difference. First operand 192 states and 382 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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-03-11 11:28:00,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:28:00,117 INFO L93 Difference]: Finished difference Result 291 states and 574 transitions. [2021-03-11 11:28:00,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-11 11:28:00,117 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2021-03-11 11:28:00,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:28:00,118 INFO L225 Difference]: With dead ends: 291 [2021-03-11 11:28:00,118 INFO L226 Difference]: Without dead ends: 245 [2021-03-11 11:28:00,119 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 183.1ms TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2021-03-11 11:28:00,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-03-11 11:28:00,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 196. [2021-03-11 11:28:00,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 2.01025641025641) internal successors, (392), 195 states have internal predecessors, (392), 0 states have call successors, (0), 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-03-11 11:28:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 392 transitions. [2021-03-11 11:28:00,122 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 392 transitions. Word has length 19 [2021-03-11 11:28:00,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:28:00,123 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 392 transitions. [2021-03-11 11:28:00,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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-03-11 11:28:00,123 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 392 transitions. [2021-03-11 11:28:00,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-03-11 11:28:00,123 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:28:00,123 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:28:00,123 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-11 11:28:00,123 INFO L428 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:28:00,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:28:00,124 INFO L82 PathProgramCache]: Analyzing trace with hash -136071229, now seen corresponding path program 4 times [2021-03-11 11:28:00,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:28:00,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460250609] [2021-03-11 11:28:00,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:28:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:28:00,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:00,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:28:00,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:00,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:28:00,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:00,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 11:28:00,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:00,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:28:00,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:00,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 11:28:00,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:00,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 11:28:00,243 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:28:00,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:28:00,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:28:00,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460250609] [2021-03-11 11:28:00,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:28:00,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 11:28:00,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353948451] [2021-03-11 11:28:00,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 11:28:00,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:28:00,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 11:28:00,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-03-11 11:28:00,252 INFO L87 Difference]: Start difference. First operand 196 states and 392 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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-03-11 11:28:00,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:28:00,539 INFO L93 Difference]: Finished difference Result 280 states and 551 transitions. [2021-03-11 11:28:00,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-11 11:28:00,540 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2021-03-11 11:28:00,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:28:00,540 INFO L225 Difference]: With dead ends: 280 [2021-03-11 11:28:00,541 INFO L226 Difference]: Without dead ends: 222 [2021-03-11 11:28:00,541 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 143.1ms TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-03-11 11:28:00,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-03-11 11:28:00,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 196. [2021-03-11 11:28:00,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 1.994871794871795) internal successors, (389), 195 states have internal predecessors, (389), 0 states have call successors, (0), 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-03-11 11:28:00,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 389 transitions. [2021-03-11 11:28:00,545 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 389 transitions. Word has length 19 [2021-03-11 11:28:00,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:28:00,545 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 389 transitions. [2021-03-11 11:28:00,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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-03-11 11:28:00,545 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 389 transitions. [2021-03-11 11:28:00,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-03-11 11:28:00,546 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:28:00,546 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:28:00,546 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-11 11:28:00,546 INFO L428 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:28:00,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:28:00,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1533653137, now seen corresponding path program 5 times [2021-03-11 11:28:00,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:28:00,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336249518] [2021-03-11 11:28:00,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:28:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:28:00,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:00,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:28:00,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:00,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:28:00,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:00,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-11 11:28:00,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:00,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:28:00,638 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:28:00,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:28:00,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:28:00,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336249518] [2021-03-11 11:28:00,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:28:00,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 11:28:00,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038876221] [2021-03-11 11:28:00,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 11:28:00,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:28:00,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 11:28:00,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:28:00,646 INFO L87 Difference]: Start difference. First operand 196 states and 389 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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-03-11 11:28:00,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:28:00,870 INFO L93 Difference]: Finished difference Result 286 states and 559 transitions. [2021-03-11 11:28:00,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-11 11:28:00,871 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2021-03-11 11:28:00,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:28:00,872 INFO L225 Difference]: With dead ends: 286 [2021-03-11 11:28:00,872 INFO L226 Difference]: Without dead ends: 234 [2021-03-11 11:28:00,872 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 123.5ms TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-03-11 11:28:00,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-03-11 11:28:00,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 196. [2021-03-11 11:28:00,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 1.9794871794871796) internal successors, (386), 195 states have internal predecessors, (386), 0 states have call successors, (0), 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-03-11 11:28:00,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 386 transitions. [2021-03-11 11:28:00,876 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 386 transitions. Word has length 19 [2021-03-11 11:28:00,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:28:00,876 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 386 transitions. [2021-03-11 11:28:00,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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-03-11 11:28:00,876 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 386 transitions. [2021-03-11 11:28:00,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-03-11 11:28:00,876 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:28:00,876 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:28:00,877 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-11 11:28:00,877 INFO L428 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:28:00,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:28:00,877 INFO L82 PathProgramCache]: Analyzing trace with hash 615702947, now seen corresponding path program 6 times [2021-03-11 11:28:00,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:28:00,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347305357] [2021-03-11 11:28:00,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:28:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:28:00,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:00,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:28:00,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:00,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 11:28:00,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:00,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 11:28:00,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:00,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-11 11:28:00,990 INFO L142 QuantifierPusher]: treesize reduction 22, result has 85.6 percent of original size [2021-03-11 11:28:00,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 131 [2021-03-11 11:28:01,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:01,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-11 11:28:01,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:01,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-11 11:28:01,073 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:28:01,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:28:01,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:28:01,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347305357] [2021-03-11 11:28:01,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:28:01,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 11:28:01,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596865284] [2021-03-11 11:28:01,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 11:28:01,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:28:01,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 11:28:01,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-11 11:28:01,080 INFO L87 Difference]: Start difference. First operand 196 states and 386 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-03-11 11:28:01,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:28:01,390 INFO L93 Difference]: Finished difference Result 264 states and 509 transitions. [2021-03-11 11:28:01,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 11:28:01,390 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2021-03-11 11:28:01,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:28:01,391 INFO L225 Difference]: With dead ends: 264 [2021-03-11 11:28:01,391 INFO L226 Difference]: Without dead ends: 138 [2021-03-11 11:28:01,391 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 245.9ms TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2021-03-11 11:28:01,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-03-11 11:28:01,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 128. [2021-03-11 11:28:01,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.8425196850393701) internal successors, (234), 127 states have internal predecessors, (234), 0 states have call successors, (0), 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-03-11 11:28:01,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 234 transitions. [2021-03-11 11:28:01,395 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 234 transitions. Word has length 19 [2021-03-11 11:28:01,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:28:01,395 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 234 transitions. [2021-03-11 11:28:01,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 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-03-11 11:28:01,395 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 234 transitions. [2021-03-11 11:28:01,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-11 11:28:01,395 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:28:01,396 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:28:01,396 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-11 11:28:01,396 INFO L428 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:28:01,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:28:01,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1539092178, now seen corresponding path program 1 times [2021-03-11 11:28:01,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:28:01,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654796834] [2021-03-11 11:28:01,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:28:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:28:01,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:01,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:28:01,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:01,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:28:01,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:01,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:28:01,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:01,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:28:01,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:01,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:28:01,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:28:01,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654796834] [2021-03-11 11:28:01,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:28:01,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 11:28:01,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257925818] [2021-03-11 11:28:01,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 11:28:01,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:28:01,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 11:28:01,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:28:01,468 INFO L87 Difference]: Start difference. First operand 128 states and 234 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-03-11 11:28:01,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:28:01,503 INFO L93 Difference]: Finished difference Result 111 states and 199 transitions. [2021-03-11 11:28:01,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 11:28:01,504 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-03-11 11:28:01,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:28:01,504 INFO L225 Difference]: With dead ends: 111 [2021-03-11 11:28:01,504 INFO L226 Difference]: Without dead ends: 82 [2021-03-11 11:28:01,505 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 19.3ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:28:01,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-03-11 11:28:01,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2021-03-11 11:28:01,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.6883116883116882) internal successors, (130), 77 states have internal predecessors, (130), 0 states have call successors, (0), 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-03-11 11:28:01,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 130 transitions. [2021-03-11 11:28:01,506 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 130 transitions. Word has length 20 [2021-03-11 11:28:01,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:28:01,507 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 130 transitions. [2021-03-11 11:28:01,507 INFO L481 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-03-11 11:28:01,507 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 130 transitions. [2021-03-11 11:28:01,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-03-11 11:28:01,507 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:28:01,507 INFO L519 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-03-11 11:28:01,507 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-11 11:28:01,507 INFO L428 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:28:01,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:28:01,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1074816341, now seen corresponding path program 1 times [2021-03-11 11:28:01,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:28:01,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050321559] [2021-03-11 11:28:01,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:28:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:28:01,633 INFO L142 QuantifierPusher]: treesize reduction 30, result has 30.2 percent of original size [2021-03-11 11:28:01,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:28:01,641 INFO L142 QuantifierPusher]: treesize reduction 30, result has 34.8 percent of original size [2021-03-11 11:28:01,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 11:28:01,650 INFO L142 QuantifierPusher]: treesize reduction 29, result has 56.1 percent of original size [2021-03-11 11:28:01,652 INFO L147 QuantifierPusher]: treesize reduction 8, result has 78.4 percent of original size 29 [2021-03-11 11:28:01,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:01,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-11 11:28:01,690 INFO L142 QuantifierPusher]: treesize reduction 34, result has 72.8 percent of original size [2021-03-11 11:28:01,695 INFO L147 QuantifierPusher]: treesize reduction 18, result has 80.2 percent of original size 73 [2021-03-11 11:28:01,744 INFO L142 QuantifierPusher]: treesize reduction 17, result has 76.4 percent of original size [2021-03-11 11:28:01,746 INFO L147 QuantifierPusher]: treesize reduction 9, result has 83.6 percent of original size 46 [2021-03-11 11:28:01,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:01,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:28:01,789 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:28:01,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:28:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:28:01,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050321559] [2021-03-11 11:28:01,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:28:01,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-11 11:28:01,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543691165] [2021-03-11 11:28:01,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-11 11:28:01,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:28:01,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-11 11:28:01,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-03-11 11:28:01,799 INFO L87 Difference]: Start difference. First operand 78 states and 130 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 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-03-11 11:28:02,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:28:02,065 INFO L93 Difference]: Finished difference Result 110 states and 183 transitions. [2021-03-11 11:28:02,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-11 11:28:02,066 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-03-11 11:28:02,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:28:02,066 INFO L225 Difference]: With dead ends: 110 [2021-03-11 11:28:02,066 INFO L226 Difference]: Without dead ends: 75 [2021-03-11 11:28:02,066 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 271.4ms TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2021-03-11 11:28:02,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-03-11 11:28:02,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-03-11 11:28:02,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.6756756756756757) internal successors, (124), 74 states have internal predecessors, (124), 0 states have call successors, (0), 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-03-11 11:28:02,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 124 transitions. [2021-03-11 11:28:02,068 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 124 transitions. Word has length 22 [2021-03-11 11:28:02,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:28:02,068 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 124 transitions. [2021-03-11 11:28:02,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 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-03-11 11:28:02,068 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 124 transitions. [2021-03-11 11:28:02,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-03-11 11:28:02,069 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:28:02,069 INFO L519 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-03-11 11:28:02,069 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-03-11 11:28:02,069 INFO L428 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:28:02,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:28:02,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1602837449, now seen corresponding path program 2 times [2021-03-11 11:28:02,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:28:02,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598532428] [2021-03-11 11:28:02,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:28:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:28:02,142 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-11 11:28:02,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-11 11:28:02,166 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-11 11:28:02,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-11 11:28:02,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:02,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:28:02,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:02,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-11 11:28:02,218 INFO L142 QuantifierPusher]: treesize reduction 5, result has 91.4 percent of original size [2021-03-11 11:28:02,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-11 11:28:02,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:02,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-11 11:28:02,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:02,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-11 11:28:02,283 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:28:02,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:28:02,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:28:02,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598532428] [2021-03-11 11:28:02,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:28:02,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-11 11:28:02,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237219451] [2021-03-11 11:28:02,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-11 11:28:02,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:28:02,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-11 11:28:02,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-03-11 11:28:02,293 INFO L87 Difference]: Start difference. First operand 75 states and 124 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 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-03-11 11:28:02,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:28:02,606 INFO L93 Difference]: Finished difference Result 99 states and 163 transitions. [2021-03-11 11:28:02,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-11 11:28:02,607 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-03-11 11:28:02,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:28:02,607 INFO L225 Difference]: With dead ends: 99 [2021-03-11 11:28:02,607 INFO L226 Difference]: Without dead ends: 78 [2021-03-11 11:28:02,608 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 305.9ms TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2021-03-11 11:28:02,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-03-11 11:28:02,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2021-03-11 11:28:02,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.676056338028169) internal successors, (119), 71 states have internal predecessors, (119), 0 states have call successors, (0), 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-03-11 11:28:02,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 119 transitions. [2021-03-11 11:28:02,609 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 119 transitions. Word has length 22 [2021-03-11 11:28:02,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:28:02,610 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 119 transitions. [2021-03-11 11:28:02,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 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-03-11 11:28:02,610 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 119 transitions. [2021-03-11 11:28:02,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-03-11 11:28:02,610 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:28:02,610 INFO L519 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-03-11 11:28:02,610 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-03-11 11:28:02,610 INFO L428 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:28:02,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:28:02,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1125588085, now seen corresponding path program 3 times [2021-03-11 11:28:02,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:28:02,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352827063] [2021-03-11 11:28:02,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:28:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:28:02,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:02,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:28:02,706 INFO L142 QuantifierPusher]: treesize reduction 37, result has 46.4 percent of original size [2021-03-11 11:28:02,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-11 11:28:02,711 INFO L142 QuantifierPusher]: treesize reduction 37, result has 52.6 percent of original size [2021-03-11 11:28:02,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-11 11:28:02,738 INFO L142 QuantifierPusher]: treesize reduction 87, result has 34.6 percent of original size [2021-03-11 11:28:02,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-11 11:28:02,772 INFO L142 QuantifierPusher]: treesize reduction 132, result has 37.7 percent of original size [2021-03-11 11:28:02,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 80 [2021-03-11 11:28:02,831 INFO L142 QuantifierPusher]: treesize reduction 13, result has 74.0 percent of original size [2021-03-11 11:28:02,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-11 11:28:02,872 INFO L142 QuantifierPusher]: treesize reduction 8, result has 69.2 percent of original size [2021-03-11 11:28:02,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-11 11:28:02,892 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:28:02,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:28:02,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:28:02,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352827063] [2021-03-11 11:28:02,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:28:02,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-11 11:28:02,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670236820] [2021-03-11 11:28:02,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-11 11:28:02,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:28:02,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-11 11:28:02,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-03-11 11:28:02,900 INFO L87 Difference]: Start difference. First operand 72 states and 119 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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-03-11 11:28:03,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:28:03,222 INFO L93 Difference]: Finished difference Result 103 states and 172 transitions. [2021-03-11 11:28:03,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-11 11:28:03,223 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-03-11 11:28:03,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:28:03,223 INFO L225 Difference]: With dead ends: 103 [2021-03-11 11:28:03,223 INFO L226 Difference]: Without dead ends: 69 [2021-03-11 11:28:03,223 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 356.2ms TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2021-03-11 11:28:03,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-03-11 11:28:03,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 53. [2021-03-11 11:28:03,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 52 states have internal predecessors, (85), 0 states have call successors, (0), 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-03-11 11:28:03,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 85 transitions. [2021-03-11 11:28:03,225 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 85 transitions. Word has length 22 [2021-03-11 11:28:03,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:28:03,225 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 85 transitions. [2021-03-11 11:28:03,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 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-03-11 11:28:03,225 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 85 transitions. [2021-03-11 11:28:03,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-03-11 11:28:03,225 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:28:03,225 INFO L519 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-03-11 11:28:03,226 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-03-11 11:28:03,226 INFO L428 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:28:03,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:28:03,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1283715531, now seen corresponding path program 4 times [2021-03-11 11:28:03,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:28:03,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321655024] [2021-03-11 11:28:03,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:28:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:28:03,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:03,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-11 11:28:03,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:03,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-11 11:28:03,371 INFO L142 QuantifierPusher]: treesize reduction 28, result has 68.5 percent of original size [2021-03-11 11:28:03,372 INFO L147 QuantifierPusher]: treesize reduction 9, result has 85.2 percent of original size 52 [2021-03-11 11:28:03,414 INFO L142 QuantifierPusher]: treesize reduction 5, result has 92.2 percent of original size [2021-03-11 11:28:03,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 59 [2021-03-11 11:28:03,464 INFO L142 QuantifierPusher]: treesize reduction 38, result has 62.7 percent of original size [2021-03-11 11:28:03,464 INFO L147 QuantifierPusher]: treesize reduction 8, result has 87.5 percent of original size 56 [2021-03-11 11:28:03,513 INFO L142 QuantifierPusher]: treesize reduction 196, result has 53.8 percent of original size [2021-03-11 11:28:03,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 228 [2021-03-11 11:28:03,571 INFO L142 QuantifierPusher]: treesize reduction 15, result has 64.3 percent of original size [2021-03-11 11:28:03,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-11 11:28:03,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:03,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-11 11:28:03,613 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:28:03,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:28:03,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:28:03,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321655024] [2021-03-11 11:28:03,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:28:03,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-11 11:28:03,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929589072] [2021-03-11 11:28:03,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-11 11:28:03,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:28:03,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-11 11:28:03,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-03-11 11:28:03,625 INFO L87 Difference]: Start difference. First operand 53 states and 85 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 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-03-11 11:28:04,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:28:04,217 INFO L93 Difference]: Finished difference Result 72 states and 114 transitions. [2021-03-11 11:28:04,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-11 11:28:04,217 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-03-11 11:28:04,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:28:04,218 INFO L225 Difference]: With dead ends: 72 [2021-03-11 11:28:04,218 INFO L226 Difference]: Without dead ends: 48 [2021-03-11 11:28:04,218 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 670.7ms TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2021-03-11 11:28:04,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2021-03-11 11:28:04,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2021-03-11 11:28:04,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 43 states have internal predecessors, (68), 0 states have call successors, (0), 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-03-11 11:28:04,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 68 transitions. [2021-03-11 11:28:04,219 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 68 transitions. Word has length 22 [2021-03-11 11:28:04,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:28:04,219 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 68 transitions. [2021-03-11 11:28:04,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 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-03-11 11:28:04,219 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 68 transitions. [2021-03-11 11:28:04,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-03-11 11:28:04,220 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:28:04,220 INFO L519 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-03-11 11:28:04,220 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-03-11 11:28:04,220 INFO L428 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:28:04,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:28:04,220 INFO L82 PathProgramCache]: Analyzing trace with hash 547004695, now seen corresponding path program 5 times [2021-03-11 11:28:04,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:28:04,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759849514] [2021-03-11 11:28:04,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:28:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:28:04,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:04,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:28:04,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:04,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:28:04,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:04,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 11:28:04,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:04,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:28:04,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:28:04,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:28:04,318 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 11:28:04,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 11:28:04,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:28:04,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759849514] [2021-03-11 11:28:04,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:28:04,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-11 11:28:04,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994655365] [2021-03-11 11:28:04,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-11 11:28:04,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:28:04,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-11 11:28:04,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-11 11:28:04,326 INFO L87 Difference]: Start difference. First operand 44 states and 68 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 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-03-11 11:28:04,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:28:04,448 INFO L93 Difference]: Finished difference Result 69 states and 110 transitions. [2021-03-11 11:28:04,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 11:28:04,448 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-03-11 11:28:04,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:28:04,449 INFO L225 Difference]: With dead ends: 69 [2021-03-11 11:28:04,449 INFO L226 Difference]: Without dead ends: 38 [2021-03-11 11:28:04,449 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 67.2ms TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-03-11 11:28:04,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-03-11 11:28:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-03-11 11:28:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 0 states have call successors, (0), 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-03-11 11:28:04,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2021-03-11 11:28:04,450 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 22 [2021-03-11 11:28:04,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:28:04,450 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2021-03-11 11:28:04,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 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-03-11 11:28:04,450 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2021-03-11 11:28:04,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-03-11 11:28:04,450 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:28:04,450 INFO L519 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-03-11 11:28:04,451 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-03-11 11:28:04,451 INFO L428 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:28:04,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:28:04,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1470918251, now seen corresponding path program 6 times [2021-03-11 11:28:04,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:28:04,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910071518] [2021-03-11 11:28:04,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:28:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 11:28:04,533 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 11:28:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 11:28:04,628 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 11:28:04,673 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 11:28:04,673 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 11:28:04,673 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-03-11 11:28:04,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 11:28:04 BasicIcfg [2021-03-11 11:28:04,771 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 11:28:04,772 INFO L168 Benchmark]: Toolchain (without parser) took 24085.98 ms. Allocated memory was 255.9 MB in the beginning and 788.5 MB in the end (delta: 532.7 MB). Free memory was 235.4 MB in the beginning and 432.5 MB in the end (delta: -197.0 MB). Peak memory consumption was 335.2 MB. Max. memory is 16.0 GB. [2021-03-11 11:28:04,772 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 11:28:04,772 INFO L168 Benchmark]: CACSL2BoogieTranslator took 536.01 ms. Allocated memory was 255.9 MB in the beginning and 360.7 MB in the end (delta: 104.9 MB). Free memory was 234.8 MB in the beginning and 318.1 MB in the end (delta: -83.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.0 GB. [2021-03-11 11:28:04,772 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.65 ms. Allocated memory is still 360.7 MB. Free memory was 318.1 MB in the beginning and 315.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 11:28:04,772 INFO L168 Benchmark]: Boogie Preprocessor took 69.24 ms. Allocated memory is still 360.7 MB. Free memory was 315.2 MB in the beginning and 311.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-11 11:28:04,773 INFO L168 Benchmark]: RCFGBuilder took 2989.11 ms. Allocated memory was 360.7 MB in the beginning and 434.1 MB in the end (delta: 73.4 MB). Free memory was 311.9 MB in the beginning and 401.3 MB in the end (delta: -89.4 MB). Peak memory consumption was 137.9 MB. Max. memory is 16.0 GB. [2021-03-11 11:28:04,773 INFO L168 Benchmark]: TraceAbstraction took 20405.37 ms. Allocated memory was 434.1 MB in the beginning and 788.5 MB in the end (delta: 354.4 MB). Free memory was 401.3 MB in the beginning and 432.5 MB in the end (delta: -31.2 MB). Peak memory consumption was 323.2 MB. Max. memory is 16.0 GB. [2021-03-11 11:28:04,777 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.18 ms. Allocated memory is still 255.9 MB. Free memory is still 238.0 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 536.01 ms. Allocated memory was 255.9 MB in the beginning and 360.7 MB in the end (delta: 104.9 MB). Free memory was 234.8 MB in the beginning and 318.1 MB in the end (delta: -83.3 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 78.65 ms. Allocated memory is still 360.7 MB. Free memory was 318.1 MB in the beginning and 315.2 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 69.24 ms. Allocated memory is still 360.7 MB. Free memory was 315.2 MB in the beginning and 311.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2989.11 ms. Allocated memory was 360.7 MB in the beginning and 434.1 MB in the end (delta: 73.4 MB). Free memory was 311.9 MB in the beginning and 401.3 MB in the end (delta: -89.4 MB). Peak memory consumption was 137.9 MB. Max. memory is 16.0 GB. * TraceAbstraction took 20405.37 ms. Allocated memory was 434.1 MB in the beginning and 788.5 MB in the end (delta: 354.4 MB). Free memory was 401.3 MB in the beginning and 432.5 MB in the end (delta: -31.2 MB). Peak memory consumption was 323.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9199.3ms, 105 PlacesBefore, 37 PlacesAfterwards, 97 TransitionsBefore, 28 TransitionsAfterwards, 1668 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, 4547 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1938, positive: 1789, positive conditional: 0, positive unconditional: 1789, negative: 149, negative conditional: 0, negative unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1131, positive: 1088, positive conditional: 0, positive unconditional: 1088, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1131, positive: 1059, positive conditional: 0, positive unconditional: 1059, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 72, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1279, positive: 111, positive conditional: 0, positive unconditional: 111, negative: 1168, negative conditional: 0, negative unconditional: 1168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1938, positive: 701, positive conditional: 0, positive unconditional: 701, negative: 106, negative conditional: 0, negative unconditional: 106, unknown: 1131, unknown conditional: 0, unknown unconditional: 1131] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 106, Positive conditional cache size: 0, Positive unconditional cache size: 106, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2546; [L850] FCALL, FORK 0 pthread_create(&t2546, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2547; [L852] FCALL, FORK 0 pthread_create(&t2547, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2548; [L854] FCALL, FORK 0 pthread_create(&t2548, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 3 !(!expression) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, 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=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20144.8ms, OverallIterations: 28, TraceHistogramMax: 1, EmptinessCheckTime: 37.4ms, AutomataDifference: 5412.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9295.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 690 SDtfs, 1164 SDslu, 1958 SDs, 0 SdLazy, 1661 SolverSat, 559 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2474.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 3975.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=922occurred in iteration=0, InterpolantAutomatonStates: 214, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 313.4ms AutomataMinimizationTime, 27 MinimizatonAttempts, 828 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 107.8ms SsaConstructionTime, 910.2ms SatisfiabilityAnalysisTime, 3620.8ms InterpolantComputationTime, 487 NumberOfCodeBlocks, 487 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 438 ConstructedInterpolants, 0 QuantifiedInterpolants, 5242 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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! Received shutdown request...