/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 02:08:36,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 02:08:36,366 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 02:08:36,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 02:08:36,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 02:08:36,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 02:08:36,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 02:08:36,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 02:08:36,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 02:08:36,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 02:08:36,408 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 02:08:36,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 02:08:36,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 02:08:36,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 02:08:36,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 02:08:36,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 02:08:36,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 02:08:36,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 02:08:36,419 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 02:08:36,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 02:08:36,428 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 02:08:36,433 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 02:08:36,434 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 02:08:36,435 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 02:08:36,437 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 02:08:36,437 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 02:08:36,438 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 02:08:36,439 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 02:08:36,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 02:08:36,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 02:08:36,442 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 02:08:36,443 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 02:08:36,444 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 02:08:36,445 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 02:08:36,446 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 02:08:36,446 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 02:08:36,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 02:08:36,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 02:08:36,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 02:08:36,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 02:08:36,449 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 02:08:36,450 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-NoLbe.epf [2019-12-19 02:08:36,474 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 02:08:36,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 02:08:36,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 02:08:36,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 02:08:36,476 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 02:08:36,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 02:08:36,476 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 02:08:36,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 02:08:36,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 02:08:36,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 02:08:36,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 02:08:36,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 02:08:36,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 02:08:36,478 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 02:08:36,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 02:08:36,478 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 02:08:36,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 02:08:36,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 02:08:36,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 02:08:36,479 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 02:08:36,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 02:08:36,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 02:08:36,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 02:08:36,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 02:08:36,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 02:08:36,480 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 02:08:36,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 02:08:36,480 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 02:08:36,481 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 02:08:36,481 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 02:08:36,771 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 02:08:36,782 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 02:08:36,786 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 02:08:36,787 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 02:08:36,787 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 02:08:36,788 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.oepc.i [2019-12-19 02:08:36,857 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e245c8e3b/9b61fe49a90144ecb9471b41f6aabedf/FLAG594e9dd10 [2019-12-19 02:08:37,398 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 02:08:37,399 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_pso.oepc.i [2019-12-19 02:08:37,414 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e245c8e3b/9b61fe49a90144ecb9471b41f6aabedf/FLAG594e9dd10 [2019-12-19 02:08:37,744 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e245c8e3b/9b61fe49a90144ecb9471b41f6aabedf [2019-12-19 02:08:37,753 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 02:08:37,755 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 02:08:37,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 02:08:37,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 02:08:37,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 02:08:37,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:08:37" (1/1) ... [2019-12-19 02:08:37,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a58602b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:37, skipping insertion in model container [2019-12-19 02:08:37,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:08:37" (1/1) ... [2019-12-19 02:08:37,774 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 02:08:37,829 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 02:08:38,400 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 02:08:38,416 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 02:08:38,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 02:08:38,542 INFO L208 MainTranslator]: Completed translation [2019-12-19 02:08:38,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:38 WrapperNode [2019-12-19 02:08:38,543 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 02:08:38,544 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 02:08:38,544 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 02:08:38,544 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 02:08:38,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:38" (1/1) ... [2019-12-19 02:08:38,572 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:38" (1/1) ... [2019-12-19 02:08:38,605 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 02:08:38,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 02:08:38,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 02:08:38,606 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 02:08:38,616 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:38" (1/1) ... [2019-12-19 02:08:38,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:38" (1/1) ... [2019-12-19 02:08:38,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:38" (1/1) ... [2019-12-19 02:08:38,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:38" (1/1) ... [2019-12-19 02:08:38,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:38" (1/1) ... [2019-12-19 02:08:38,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:38" (1/1) ... [2019-12-19 02:08:38,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:38" (1/1) ... [2019-12-19 02:08:38,644 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 02:08:38,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 02:08:38,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 02:08:38,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 02:08:38,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:38" (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 [2019-12-19 02:08:38,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 02:08:38,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 02:08:38,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 02:08:38,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 02:08:38,723 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 02:08:38,723 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 02:08:38,723 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 02:08:38,723 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 02:08:38,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 02:08:38,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 02:08:38,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 02:08:38,726 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 02:08:39,410 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 02:08:39,410 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 02:08:39,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:08:39 BoogieIcfgContainer [2019-12-19 02:08:39,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 02:08:39,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 02:08:39,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 02:08:39,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 02:08:39,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 02:08:37" (1/3) ... [2019-12-19 02:08:39,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700308c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:08:39, skipping insertion in model container [2019-12-19 02:08:39,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:38" (2/3) ... [2019-12-19 02:08:39,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700308c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:08:39, skipping insertion in model container [2019-12-19 02:08:39,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:08:39" (3/3) ... [2019-12-19 02:08:39,426 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_pso.oepc.i [2019-12-19 02:08:39,436 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 02:08:39,437 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 02:08:39,444 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 02:08:39,445 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 02:08:39,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,488 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,489 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,489 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,489 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,489 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,490 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,490 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,491 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,492 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,493 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,499 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,505 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,505 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,534 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,535 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,547 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,548 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,575 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,575 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,576 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,581 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,584 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:39,600 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 02:08:39,622 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 02:08:39,622 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 02:08:39,622 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 02:08:39,622 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 02:08:39,623 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 02:08:39,623 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 02:08:39,623 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 02:08:39,623 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 02:08:39,637 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 149 places, 183 transitions [2019-12-19 02:08:41,617 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32593 states. [2019-12-19 02:08:41,619 INFO L276 IsEmpty]: Start isEmpty. Operand 32593 states. [2019-12-19 02:08:41,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-19 02:08:41,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:41,628 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:08:41,629 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:41,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:41,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1674583442, now seen corresponding path program 1 times [2019-12-19 02:08:41,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:41,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865247683] [2019-12-19 02:08:41,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:08:41,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865247683] [2019-12-19 02:08:41,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:41,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:08:41,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174252240] [2019-12-19 02:08:41,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:08:41,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:41,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:08:41,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:08:41,994 INFO L87 Difference]: Start difference. First operand 32593 states. Second operand 4 states. [2019-12-19 02:08:43,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:43,595 INFO L93 Difference]: Finished difference Result 33593 states and 129570 transitions. [2019-12-19 02:08:43,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:08:43,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-19 02:08:43,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:43,818 INFO L225 Difference]: With dead ends: 33593 [2019-12-19 02:08:43,818 INFO L226 Difference]: Without dead ends: 25705 [2019-12-19 02:08:43,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:08:44,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25705 states. [2019-12-19 02:08:44,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25705 to 25705. [2019-12-19 02:08:44,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25705 states. [2019-12-19 02:08:45,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25705 states to 25705 states and 99586 transitions. [2019-12-19 02:08:45,357 INFO L78 Accepts]: Start accepts. Automaton has 25705 states and 99586 transitions. Word has length 36 [2019-12-19 02:08:45,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:45,359 INFO L462 AbstractCegarLoop]: Abstraction has 25705 states and 99586 transitions. [2019-12-19 02:08:45,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:08:45,359 INFO L276 IsEmpty]: Start isEmpty. Operand 25705 states and 99586 transitions. [2019-12-19 02:08:45,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-19 02:08:45,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:45,374 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:08:45,375 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:45,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:45,375 INFO L82 PathProgramCache]: Analyzing trace with hash -196337745, now seen corresponding path program 1 times [2019-12-19 02:08:45,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:45,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132717897] [2019-12-19 02:08:45,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:45,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:08:45,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132717897] [2019-12-19 02:08:45,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:45,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:08:45,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375991832] [2019-12-19 02:08:45,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:08:45,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:45,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:08:45,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:08:45,560 INFO L87 Difference]: Start difference. First operand 25705 states and 99586 transitions. Second operand 5 states. [2019-12-19 02:08:46,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:46,377 INFO L93 Difference]: Finished difference Result 41083 states and 150433 transitions. [2019-12-19 02:08:46,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:08:46,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-19 02:08:46,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:46,581 INFO L225 Difference]: With dead ends: 41083 [2019-12-19 02:08:46,581 INFO L226 Difference]: Without dead ends: 40547 [2019-12-19 02:08:46,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:08:48,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40547 states. [2019-12-19 02:08:49,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40547 to 38927. [2019-12-19 02:08:49,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38927 states. [2019-12-19 02:08:49,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38927 states to 38927 states and 143583 transitions. [2019-12-19 02:08:49,222 INFO L78 Accepts]: Start accepts. Automaton has 38927 states and 143583 transitions. Word has length 48 [2019-12-19 02:08:49,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:49,224 INFO L462 AbstractCegarLoop]: Abstraction has 38927 states and 143583 transitions. [2019-12-19 02:08:49,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:08:49,224 INFO L276 IsEmpty]: Start isEmpty. Operand 38927 states and 143583 transitions. [2019-12-19 02:08:49,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-19 02:08:49,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:49,230 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:08:49,230 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:49,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:49,231 INFO L82 PathProgramCache]: Analyzing trace with hash -207257985, now seen corresponding path program 1 times [2019-12-19 02:08:49,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:49,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993144722] [2019-12-19 02:08:49,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:49,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:08:49,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993144722] [2019-12-19 02:08:49,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:49,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:08:49,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307827405] [2019-12-19 02:08:49,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:08:49,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:49,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:08:49,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:08:49,337 INFO L87 Difference]: Start difference. First operand 38927 states and 143583 transitions. Second operand 5 states. [2019-12-19 02:08:50,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:50,210 INFO L93 Difference]: Finished difference Result 49780 states and 180635 transitions. [2019-12-19 02:08:50,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:08:50,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-19 02:08:50,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:50,417 INFO L225 Difference]: With dead ends: 49780 [2019-12-19 02:08:50,417 INFO L226 Difference]: Without dead ends: 49276 [2019-12-19 02:08:50,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:08:50,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49276 states. [2019-12-19 02:08:53,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49276 to 42679. [2019-12-19 02:08:53,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42679 states. [2019-12-19 02:08:53,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42679 states to 42679 states and 156594 transitions. [2019-12-19 02:08:53,235 INFO L78 Accepts]: Start accepts. Automaton has 42679 states and 156594 transitions. Word has length 49 [2019-12-19 02:08:53,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:53,236 INFO L462 AbstractCegarLoop]: Abstraction has 42679 states and 156594 transitions. [2019-12-19 02:08:53,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:08:53,236 INFO L276 IsEmpty]: Start isEmpty. Operand 42679 states and 156594 transitions. [2019-12-19 02:08:53,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-19 02:08:53,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:53,245 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:08:53,246 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:53,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:53,246 INFO L82 PathProgramCache]: Analyzing trace with hash -635197403, now seen corresponding path program 1 times [2019-12-19 02:08:53,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:53,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999540432] [2019-12-19 02:08:53,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:53,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:08:53,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999540432] [2019-12-19 02:08:53,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:53,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:08:53,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034368354] [2019-12-19 02:08:53,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:08:53,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:53,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:08:53,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:08:53,304 INFO L87 Difference]: Start difference. First operand 42679 states and 156594 transitions. Second operand 3 states. [2019-12-19 02:08:53,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:53,958 INFO L93 Difference]: Finished difference Result 61089 states and 221432 transitions. [2019-12-19 02:08:53,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:08:53,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-19 02:08:53,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:54,156 INFO L225 Difference]: With dead ends: 61089 [2019-12-19 02:08:54,156 INFO L226 Difference]: Without dead ends: 61089 [2019-12-19 02:08:54,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:08:54,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61089 states. [2019-12-19 02:08:56,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61089 to 48018. [2019-12-19 02:08:56,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48018 states. [2019-12-19 02:08:57,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48018 states to 48018 states and 174181 transitions. [2019-12-19 02:08:57,116 INFO L78 Accepts]: Start accepts. Automaton has 48018 states and 174181 transitions. Word has length 51 [2019-12-19 02:08:57,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:08:57,116 INFO L462 AbstractCegarLoop]: Abstraction has 48018 states and 174181 transitions. [2019-12-19 02:08:57,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:08:57,116 INFO L276 IsEmpty]: Start isEmpty. Operand 48018 states and 174181 transitions. [2019-12-19 02:08:57,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 02:08:57,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:57,132 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:08:57,132 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:57,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:57,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1064293156, now seen corresponding path program 1 times [2019-12-19 02:08:57,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:57,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264009526] [2019-12-19 02:08:57,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:57,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:08:57,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264009526] [2019-12-19 02:08:57,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:57,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:08:57,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993228256] [2019-12-19 02:08:57,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:08:57,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:57,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:08:57,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:08:57,266 INFO L87 Difference]: Start difference. First operand 48018 states and 174181 transitions. Second operand 6 states. [2019-12-19 02:08:58,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:58,210 INFO L93 Difference]: Finished difference Result 63758 states and 229381 transitions. [2019-12-19 02:08:58,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:08:58,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-19 02:08:58,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:58,405 INFO L225 Difference]: With dead ends: 63758 [2019-12-19 02:08:58,405 INFO L226 Difference]: Without dead ends: 63758 [2019-12-19 02:08:58,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:08:59,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63758 states. [2019-12-19 02:08:59,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63758 to 59951. [2019-12-19 02:08:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59951 states. [2019-12-19 02:09:02,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59951 states to 59951 states and 215674 transitions. [2019-12-19 02:09:02,608 INFO L78 Accepts]: Start accepts. Automaton has 59951 states and 215674 transitions. Word has length 55 [2019-12-19 02:09:02,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:02,609 INFO L462 AbstractCegarLoop]: Abstraction has 59951 states and 215674 transitions. [2019-12-19 02:09:02,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:09:02,609 INFO L276 IsEmpty]: Start isEmpty. Operand 59951 states and 215674 transitions. [2019-12-19 02:09:02,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 02:09:02,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:02,627 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:02,628 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:02,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:02,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1433722781, now seen corresponding path program 1 times [2019-12-19 02:09:02,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:02,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766192360] [2019-12-19 02:09:02,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:02,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:02,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766192360] [2019-12-19 02:09:02,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:02,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:09:02,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971481053] [2019-12-19 02:09:02,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:09:02,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:02,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:09:02,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:09:02,781 INFO L87 Difference]: Start difference. First operand 59951 states and 215674 transitions. Second operand 7 states. [2019-12-19 02:09:04,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:04,097 INFO L93 Difference]: Finished difference Result 83687 states and 290099 transitions. [2019-12-19 02:09:04,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 02:09:04,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-19 02:09:04,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:04,283 INFO L225 Difference]: With dead ends: 83687 [2019-12-19 02:09:04,283 INFO L226 Difference]: Without dead ends: 83687 [2019-12-19 02:09:04,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 02:09:04,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83687 states. [2019-12-19 02:09:05,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83687 to 71014. [2019-12-19 02:09:05,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71014 states. [2019-12-19 02:09:06,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71014 states to 71014 states and 249888 transitions. [2019-12-19 02:09:06,095 INFO L78 Accepts]: Start accepts. Automaton has 71014 states and 249888 transitions. Word has length 55 [2019-12-19 02:09:06,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:06,095 INFO L462 AbstractCegarLoop]: Abstraction has 71014 states and 249888 transitions. [2019-12-19 02:09:06,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:09:06,096 INFO L276 IsEmpty]: Start isEmpty. Operand 71014 states and 249888 transitions. [2019-12-19 02:09:06,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 02:09:06,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:06,109 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:06,110 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:06,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:06,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1973740834, now seen corresponding path program 1 times [2019-12-19 02:09:06,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:06,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224883711] [2019-12-19 02:09:06,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:06,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:06,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224883711] [2019-12-19 02:09:06,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:06,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:09:06,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241700429] [2019-12-19 02:09:06,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:09:06,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:06,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:09:06,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:09:06,188 INFO L87 Difference]: Start difference. First operand 71014 states and 249888 transitions. Second operand 4 states. [2019-12-19 02:09:06,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:06,776 INFO L93 Difference]: Finished difference Result 12161 states and 37831 transitions. [2019-12-19 02:09:06,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:09:06,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-19 02:09:06,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:06,800 INFO L225 Difference]: With dead ends: 12161 [2019-12-19 02:09:06,800 INFO L226 Difference]: Without dead ends: 10676 [2019-12-19 02:09:06,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:06,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10676 states. [2019-12-19 02:09:06,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10676 to 10627. [2019-12-19 02:09:06,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10627 states. [2019-12-19 02:09:06,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10627 states to 10627 states and 32593 transitions. [2019-12-19 02:09:06,959 INFO L78 Accepts]: Start accepts. Automaton has 10627 states and 32593 transitions. Word has length 55 [2019-12-19 02:09:06,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:06,960 INFO L462 AbstractCegarLoop]: Abstraction has 10627 states and 32593 transitions. [2019-12-19 02:09:06,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:09:06,960 INFO L276 IsEmpty]: Start isEmpty. Operand 10627 states and 32593 transitions. [2019-12-19 02:09:06,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 02:09:06,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:06,962 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:06,962 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:06,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:06,962 INFO L82 PathProgramCache]: Analyzing trace with hash -984017040, now seen corresponding path program 1 times [2019-12-19 02:09:06,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:06,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818291325] [2019-12-19 02:09:06,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:07,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:07,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818291325] [2019-12-19 02:09:07,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:07,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:09:07,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226185600] [2019-12-19 02:09:07,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:09:07,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:07,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:09:07,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:07,034 INFO L87 Difference]: Start difference. First operand 10627 states and 32593 transitions. Second operand 6 states. [2019-12-19 02:09:07,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:07,523 INFO L93 Difference]: Finished difference Result 13184 states and 39874 transitions. [2019-12-19 02:09:07,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 02:09:07,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-19 02:09:07,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:07,550 INFO L225 Difference]: With dead ends: 13184 [2019-12-19 02:09:07,550 INFO L226 Difference]: Without dead ends: 13121 [2019-12-19 02:09:07,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-19 02:09:07,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13121 states. [2019-12-19 02:09:07,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13121 to 11050. [2019-12-19 02:09:07,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11050 states. [2019-12-19 02:09:07,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11050 states to 11050 states and 33787 transitions. [2019-12-19 02:09:07,713 INFO L78 Accepts]: Start accepts. Automaton has 11050 states and 33787 transitions. Word has length 55 [2019-12-19 02:09:07,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:07,713 INFO L462 AbstractCegarLoop]: Abstraction has 11050 states and 33787 transitions. [2019-12-19 02:09:07,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:09:07,713 INFO L276 IsEmpty]: Start isEmpty. Operand 11050 states and 33787 transitions. [2019-12-19 02:09:07,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-19 02:09:07,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:07,717 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:07,717 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:07,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:07,717 INFO L82 PathProgramCache]: Analyzing trace with hash 721551436, now seen corresponding path program 1 times [2019-12-19 02:09:07,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:07,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323142836] [2019-12-19 02:09:07,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:07,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:07,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323142836] [2019-12-19 02:09:07,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:07,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:09:07,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380449612] [2019-12-19 02:09:07,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:09:07,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:07,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:09:07,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:09:07,777 INFO L87 Difference]: Start difference. First operand 11050 states and 33787 transitions. Second operand 4 states. [2019-12-19 02:09:07,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:07,902 INFO L93 Difference]: Finished difference Result 12864 states and 39393 transitions. [2019-12-19 02:09:07,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:09:07,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-19 02:09:07,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:07,924 INFO L225 Difference]: With dead ends: 12864 [2019-12-19 02:09:07,924 INFO L226 Difference]: Without dead ends: 12864 [2019-12-19 02:09:07,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:07,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12864 states. [2019-12-19 02:09:08,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12864 to 11695. [2019-12-19 02:09:08,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11695 states. [2019-12-19 02:09:08,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11695 states to 11695 states and 35764 transitions. [2019-12-19 02:09:08,077 INFO L78 Accepts]: Start accepts. Automaton has 11695 states and 35764 transitions. Word has length 63 [2019-12-19 02:09:08,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:08,078 INFO L462 AbstractCegarLoop]: Abstraction has 11695 states and 35764 transitions. [2019-12-19 02:09:08,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:09:08,078 INFO L276 IsEmpty]: Start isEmpty. Operand 11695 states and 35764 transitions. [2019-12-19 02:09:08,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-19 02:09:08,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:08,081 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:08,081 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:08,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:08,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1830605525, now seen corresponding path program 1 times [2019-12-19 02:09:08,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:08,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329016365] [2019-12-19 02:09:08,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:08,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:08,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329016365] [2019-12-19 02:09:08,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:08,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:09:08,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520620206] [2019-12-19 02:09:08,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:09:08,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:08,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:09:08,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:08,141 INFO L87 Difference]: Start difference. First operand 11695 states and 35764 transitions. Second operand 6 states. [2019-12-19 02:09:08,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:08,545 INFO L93 Difference]: Finished difference Result 14221 states and 42862 transitions. [2019-12-19 02:09:08,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 02:09:08,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-12-19 02:09:08,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:08,566 INFO L225 Difference]: With dead ends: 14221 [2019-12-19 02:09:08,566 INFO L226 Difference]: Without dead ends: 14160 [2019-12-19 02:09:08,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 02:09:08,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14160 states. [2019-12-19 02:09:08,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14160 to 13463. [2019-12-19 02:09:08,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13463 states. [2019-12-19 02:09:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13463 states to 13463 states and 40781 transitions. [2019-12-19 02:09:08,744 INFO L78 Accepts]: Start accepts. Automaton has 13463 states and 40781 transitions. Word has length 63 [2019-12-19 02:09:08,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:08,745 INFO L462 AbstractCegarLoop]: Abstraction has 13463 states and 40781 transitions. [2019-12-19 02:09:08,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:09:08,745 INFO L276 IsEmpty]: Start isEmpty. Operand 13463 states and 40781 transitions. [2019-12-19 02:09:08,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 02:09:08,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:08,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:08,753 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:08,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:08,753 INFO L82 PathProgramCache]: Analyzing trace with hash -827165457, now seen corresponding path program 1 times [2019-12-19 02:09:08,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:08,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809612201] [2019-12-19 02:09:08,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:09,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:09,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809612201] [2019-12-19 02:09:09,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:09,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:09:09,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076310934] [2019-12-19 02:09:09,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:09:09,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:09,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:09:09,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:09:09,009 INFO L87 Difference]: Start difference. First operand 13463 states and 40781 transitions. Second operand 3 states. [2019-12-19 02:09:09,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:09,234 INFO L93 Difference]: Finished difference Result 14051 states and 42317 transitions. [2019-12-19 02:09:09,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:09:09,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-19 02:09:09,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:09,256 INFO L225 Difference]: With dead ends: 14051 [2019-12-19 02:09:09,256 INFO L226 Difference]: Without dead ends: 14051 [2019-12-19 02:09:09,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:09:09,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14051 states. [2019-12-19 02:09:09,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14051 to 13757. [2019-12-19 02:09:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13757 states. [2019-12-19 02:09:09,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13757 states to 13757 states and 41549 transitions. [2019-12-19 02:09:09,440 INFO L78 Accepts]: Start accepts. Automaton has 13757 states and 41549 transitions. Word has length 67 [2019-12-19 02:09:09,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:09,440 INFO L462 AbstractCegarLoop]: Abstraction has 13757 states and 41549 transitions. [2019-12-19 02:09:09,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:09:09,440 INFO L276 IsEmpty]: Start isEmpty. Operand 13757 states and 41549 transitions. [2019-12-19 02:09:09,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 02:09:09,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:09,447 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:09,447 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:09,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:09,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1250043886, now seen corresponding path program 1 times [2019-12-19 02:09:09,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:09,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952044628] [2019-12-19 02:09:09,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:09,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:09,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952044628] [2019-12-19 02:09:09,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:09,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:09:09,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442389275] [2019-12-19 02:09:09,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:09:09,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:09,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:09:09,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:09:09,504 INFO L87 Difference]: Start difference. First operand 13757 states and 41549 transitions. Second operand 4 states. [2019-12-19 02:09:09,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:09,829 INFO L93 Difference]: Finished difference Result 16799 states and 50141 transitions. [2019-12-19 02:09:09,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:09:09,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-19 02:09:09,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:09,854 INFO L225 Difference]: With dead ends: 16799 [2019-12-19 02:09:09,854 INFO L226 Difference]: Without dead ends: 16799 [2019-12-19 02:09:09,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:09:09,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16799 states. [2019-12-19 02:09:10,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16799 to 15278. [2019-12-19 02:09:10,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15278 states. [2019-12-19 02:09:10,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15278 states to 15278 states and 45730 transitions. [2019-12-19 02:09:10,065 INFO L78 Accepts]: Start accepts. Automaton has 15278 states and 45730 transitions. Word has length 67 [2019-12-19 02:09:10,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:10,065 INFO L462 AbstractCegarLoop]: Abstraction has 15278 states and 45730 transitions. [2019-12-19 02:09:10,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:09:10,065 INFO L276 IsEmpty]: Start isEmpty. Operand 15278 states and 45730 transitions. [2019-12-19 02:09:10,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:09:10,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:10,074 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:10,074 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:10,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:10,074 INFO L82 PathProgramCache]: Analyzing trace with hash -750353405, now seen corresponding path program 1 times [2019-12-19 02:09:10,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:10,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698319145] [2019-12-19 02:09:10,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:10,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:10,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698319145] [2019-12-19 02:09:10,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:10,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:09:10,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459380952] [2019-12-19 02:09:10,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:09:10,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:10,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:09:10,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:10,173 INFO L87 Difference]: Start difference. First operand 15278 states and 45730 transitions. Second operand 6 states. [2019-12-19 02:09:10,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:10,746 INFO L93 Difference]: Finished difference Result 16275 states and 48105 transitions. [2019-12-19 02:09:10,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:09:10,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-19 02:09:10,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:10,770 INFO L225 Difference]: With dead ends: 16275 [2019-12-19 02:09:10,770 INFO L226 Difference]: Without dead ends: 16275 [2019-12-19 02:09:10,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:09:10,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16275 states. [2019-12-19 02:09:10,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16275 to 15851. [2019-12-19 02:09:10,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15851 states. [2019-12-19 02:09:10,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15851 states to 15851 states and 47027 transitions. [2019-12-19 02:09:10,999 INFO L78 Accepts]: Start accepts. Automaton has 15851 states and 47027 transitions. Word has length 69 [2019-12-19 02:09:10,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:10,999 INFO L462 AbstractCegarLoop]: Abstraction has 15851 states and 47027 transitions. [2019-12-19 02:09:10,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:09:10,999 INFO L276 IsEmpty]: Start isEmpty. Operand 15851 states and 47027 transitions. [2019-12-19 02:09:11,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:09:11,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:11,009 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:11,009 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:11,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:11,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1467404548, now seen corresponding path program 1 times [2019-12-19 02:09:11,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:11,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547662333] [2019-12-19 02:09:11,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:11,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:11,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547662333] [2019-12-19 02:09:11,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:11,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:09:11,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999902410] [2019-12-19 02:09:11,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:09:11,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:11,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:09:11,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:11,104 INFO L87 Difference]: Start difference. First operand 15851 states and 47027 transitions. Second operand 6 states. [2019-12-19 02:09:11,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:11,673 INFO L93 Difference]: Finished difference Result 18162 states and 52355 transitions. [2019-12-19 02:09:11,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:09:11,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-19 02:09:11,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:11,698 INFO L225 Difference]: With dead ends: 18162 [2019-12-19 02:09:11,698 INFO L226 Difference]: Without dead ends: 18162 [2019-12-19 02:09:11,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:09:11,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18162 states. [2019-12-19 02:09:11,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18162 to 16543. [2019-12-19 02:09:11,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16543 states. [2019-12-19 02:09:11,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16543 states to 16543 states and 48247 transitions. [2019-12-19 02:09:11,908 INFO L78 Accepts]: Start accepts. Automaton has 16543 states and 48247 transitions. Word has length 69 [2019-12-19 02:09:11,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:11,909 INFO L462 AbstractCegarLoop]: Abstraction has 16543 states and 48247 transitions. [2019-12-19 02:09:11,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:09:11,909 INFO L276 IsEmpty]: Start isEmpty. Operand 16543 states and 48247 transitions. [2019-12-19 02:09:11,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:09:11,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:11,918 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:11,919 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:11,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:11,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1678755461, now seen corresponding path program 1 times [2019-12-19 02:09:11,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:11,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519888007] [2019-12-19 02:09:11,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:11,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:11,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519888007] [2019-12-19 02:09:11,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:11,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:11,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856343300] [2019-12-19 02:09:11,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:11,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:11,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:11,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:11,990 INFO L87 Difference]: Start difference. First operand 16543 states and 48247 transitions. Second operand 5 states. [2019-12-19 02:09:12,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:12,356 INFO L93 Difference]: Finished difference Result 21457 states and 62487 transitions. [2019-12-19 02:09:12,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:09:12,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-19 02:09:12,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:12,387 INFO L225 Difference]: With dead ends: 21457 [2019-12-19 02:09:12,387 INFO L226 Difference]: Without dead ends: 21457 [2019-12-19 02:09:12,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:09:12,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21457 states. [2019-12-19 02:09:12,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21457 to 19522. [2019-12-19 02:09:12,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19522 states. [2019-12-19 02:09:12,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19522 states to 19522 states and 56656 transitions. [2019-12-19 02:09:12,646 INFO L78 Accepts]: Start accepts. Automaton has 19522 states and 56656 transitions. Word has length 69 [2019-12-19 02:09:12,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:12,647 INFO L462 AbstractCegarLoop]: Abstraction has 19522 states and 56656 transitions. [2019-12-19 02:09:12,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:12,647 INFO L276 IsEmpty]: Start isEmpty. Operand 19522 states and 56656 transitions. [2019-12-19 02:09:12,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:09:12,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:12,658 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:12,658 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:12,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:12,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1168221284, now seen corresponding path program 1 times [2019-12-19 02:09:12,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:12,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144779513] [2019-12-19 02:09:12,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:12,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:12,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144779513] [2019-12-19 02:09:12,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:12,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:12,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747734060] [2019-12-19 02:09:12,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:12,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:12,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:12,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:12,713 INFO L87 Difference]: Start difference. First operand 19522 states and 56656 transitions. Second operand 5 states. [2019-12-19 02:09:13,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:13,267 INFO L93 Difference]: Finished difference Result 26409 states and 76314 transitions. [2019-12-19 02:09:13,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:09:13,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-19 02:09:13,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:13,305 INFO L225 Difference]: With dead ends: 26409 [2019-12-19 02:09:13,305 INFO L226 Difference]: Without dead ends: 26409 [2019-12-19 02:09:13,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:09:13,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26409 states. [2019-12-19 02:09:13,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26409 to 21410. [2019-12-19 02:09:13,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21410 states. [2019-12-19 02:09:13,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21410 states to 21410 states and 61930 transitions. [2019-12-19 02:09:13,861 INFO L78 Accepts]: Start accepts. Automaton has 21410 states and 61930 transitions. Word has length 69 [2019-12-19 02:09:13,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:13,861 INFO L462 AbstractCegarLoop]: Abstraction has 21410 states and 61930 transitions. [2019-12-19 02:09:13,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:13,861 INFO L276 IsEmpty]: Start isEmpty. Operand 21410 states and 61930 transitions. [2019-12-19 02:09:13,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:09:13,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:13,872 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:13,872 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:13,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:13,872 INFO L82 PathProgramCache]: Analyzing trace with hash -639233179, now seen corresponding path program 1 times [2019-12-19 02:09:13,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:13,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24186722] [2019-12-19 02:09:13,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:13,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24186722] [2019-12-19 02:09:13,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:13,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:09:13,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288825648] [2019-12-19 02:09:13,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:09:13,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:13,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:09:13,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:09:13,927 INFO L87 Difference]: Start difference. First operand 21410 states and 61930 transitions. Second operand 4 states. [2019-12-19 02:09:14,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:14,559 INFO L93 Difference]: Finished difference Result 27971 states and 81352 transitions. [2019-12-19 02:09:14,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:09:14,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-19 02:09:14,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:14,602 INFO L225 Difference]: With dead ends: 27971 [2019-12-19 02:09:14,602 INFO L226 Difference]: Without dead ends: 27836 [2019-12-19 02:09:14,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:14,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27836 states. [2019-12-19 02:09:14,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27836 to 25847. [2019-12-19 02:09:14,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25847 states. [2019-12-19 02:09:14,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25847 states to 25847 states and 75190 transitions. [2019-12-19 02:09:14,975 INFO L78 Accepts]: Start accepts. Automaton has 25847 states and 75190 transitions. Word has length 69 [2019-12-19 02:09:14,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:14,975 INFO L462 AbstractCegarLoop]: Abstraction has 25847 states and 75190 transitions. [2019-12-19 02:09:14,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:09:14,975 INFO L276 IsEmpty]: Start isEmpty. Operand 25847 states and 75190 transitions. [2019-12-19 02:09:14,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:09:14,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:14,985 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:14,985 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:14,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:14,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1858782758, now seen corresponding path program 1 times [2019-12-19 02:09:14,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:14,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832953615] [2019-12-19 02:09:14,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:15,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:15,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832953615] [2019-12-19 02:09:15,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:15,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:09:15,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930601594] [2019-12-19 02:09:15,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:09:15,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:15,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:09:15,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:09:15,139 INFO L87 Difference]: Start difference. First operand 25847 states and 75190 transitions. Second operand 7 states. [2019-12-19 02:09:15,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:15,744 INFO L93 Difference]: Finished difference Result 23115 states and 64212 transitions. [2019-12-19 02:09:15,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 02:09:15,744 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-19 02:09:15,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:15,777 INFO L225 Difference]: With dead ends: 23115 [2019-12-19 02:09:15,777 INFO L226 Difference]: Without dead ends: 23115 [2019-12-19 02:09:15,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-19 02:09:15,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23115 states. [2019-12-19 02:09:16,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23115 to 18811. [2019-12-19 02:09:16,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18811 states. [2019-12-19 02:09:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18811 states to 18811 states and 52247 transitions. [2019-12-19 02:09:16,039 INFO L78 Accepts]: Start accepts. Automaton has 18811 states and 52247 transitions. Word has length 69 [2019-12-19 02:09:16,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:16,039 INFO L462 AbstractCegarLoop]: Abstraction has 18811 states and 52247 transitions. [2019-12-19 02:09:16,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:09:16,039 INFO L276 IsEmpty]: Start isEmpty. Operand 18811 states and 52247 transitions. [2019-12-19 02:09:16,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:09:16,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:16,047 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:16,047 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:16,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:16,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1548680857, now seen corresponding path program 1 times [2019-12-19 02:09:16,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:16,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81270609] [2019-12-19 02:09:16,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:16,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:16,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81270609] [2019-12-19 02:09:16,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:16,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:16,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860690818] [2019-12-19 02:09:16,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:16,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:16,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:16,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:16,127 INFO L87 Difference]: Start difference. First operand 18811 states and 52247 transitions. Second operand 5 states. [2019-12-19 02:09:16,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:16,186 INFO L93 Difference]: Finished difference Result 6133 states and 14464 transitions. [2019-12-19 02:09:16,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:09:16,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-19 02:09:16,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:16,194 INFO L225 Difference]: With dead ends: 6133 [2019-12-19 02:09:16,194 INFO L226 Difference]: Without dead ends: 5263 [2019-12-19 02:09:16,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:09:16,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2019-12-19 02:09:16,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 4728. [2019-12-19 02:09:16,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4728 states. [2019-12-19 02:09:16,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4728 states to 4728 states and 10823 transitions. [2019-12-19 02:09:16,257 INFO L78 Accepts]: Start accepts. Automaton has 4728 states and 10823 transitions. Word has length 69 [2019-12-19 02:09:16,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:16,258 INFO L462 AbstractCegarLoop]: Abstraction has 4728 states and 10823 transitions. [2019-12-19 02:09:16,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:16,258 INFO L276 IsEmpty]: Start isEmpty. Operand 4728 states and 10823 transitions. [2019-12-19 02:09:16,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:09:16,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:16,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:16,262 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:16,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:16,262 INFO L82 PathProgramCache]: Analyzing trace with hash -839136164, now seen corresponding path program 1 times [2019-12-19 02:09:16,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:16,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756046607] [2019-12-19 02:09:16,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:16,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:16,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756046607] [2019-12-19 02:09:16,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:16,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:09:16,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769789021] [2019-12-19 02:09:16,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:09:16,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:16,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:09:16,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:09:16,294 INFO L87 Difference]: Start difference. First operand 4728 states and 10823 transitions. Second operand 3 states. [2019-12-19 02:09:16,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:16,340 INFO L93 Difference]: Finished difference Result 5858 states and 13189 transitions. [2019-12-19 02:09:16,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:09:16,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-19 02:09:16,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:16,347 INFO L225 Difference]: With dead ends: 5858 [2019-12-19 02:09:16,347 INFO L226 Difference]: Without dead ends: 5858 [2019-12-19 02:09:16,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:09:16,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5858 states. [2019-12-19 02:09:16,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5858 to 4663. [2019-12-19 02:09:16,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4663 states. [2019-12-19 02:09:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4663 states to 4663 states and 10385 transitions. [2019-12-19 02:09:16,395 INFO L78 Accepts]: Start accepts. Automaton has 4663 states and 10385 transitions. Word has length 69 [2019-12-19 02:09:16,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:16,395 INFO L462 AbstractCegarLoop]: Abstraction has 4663 states and 10385 transitions. [2019-12-19 02:09:16,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:09:16,395 INFO L276 IsEmpty]: Start isEmpty. Operand 4663 states and 10385 transitions. [2019-12-19 02:09:16,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-19 02:09:16,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:16,400 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:16,402 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:16,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:16,404 INFO L82 PathProgramCache]: Analyzing trace with hash -537618065, now seen corresponding path program 1 times [2019-12-19 02:09:16,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:16,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111225092] [2019-12-19 02:09:16,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:16,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:16,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111225092] [2019-12-19 02:09:16,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:16,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:16,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596390732] [2019-12-19 02:09:16,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:16,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:16,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:16,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:16,541 INFO L87 Difference]: Start difference. First operand 4663 states and 10385 transitions. Second operand 5 states. [2019-12-19 02:09:16,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:16,710 INFO L93 Difference]: Finished difference Result 5724 states and 12814 transitions. [2019-12-19 02:09:16,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:09:16,710 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-12-19 02:09:16,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:16,718 INFO L225 Difference]: With dead ends: 5724 [2019-12-19 02:09:16,718 INFO L226 Difference]: Without dead ends: 5724 [2019-12-19 02:09:16,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:09:16,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5724 states. [2019-12-19 02:09:16,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5724 to 5083. [2019-12-19 02:09:16,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5083 states. [2019-12-19 02:09:16,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5083 states to 5083 states and 11343 transitions. [2019-12-19 02:09:16,772 INFO L78 Accepts]: Start accepts. Automaton has 5083 states and 11343 transitions. Word has length 75 [2019-12-19 02:09:16,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:16,772 INFO L462 AbstractCegarLoop]: Abstraction has 5083 states and 11343 transitions. [2019-12-19 02:09:16,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:16,772 INFO L276 IsEmpty]: Start isEmpty. Operand 5083 states and 11343 transitions. [2019-12-19 02:09:16,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-19 02:09:16,777 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:16,777 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:16,777 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:16,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:16,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1205192270, now seen corresponding path program 1 times [2019-12-19 02:09:16,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:16,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788907202] [2019-12-19 02:09:16,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:16,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:16,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788907202] [2019-12-19 02:09:16,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:16,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:09:16,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958323037] [2019-12-19 02:09:16,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:09:16,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:16,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:09:16,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:09:16,849 INFO L87 Difference]: Start difference. First operand 5083 states and 11343 transitions. Second operand 7 states. [2019-12-19 02:09:17,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:17,286 INFO L93 Difference]: Finished difference Result 5823 states and 12866 transitions. [2019-12-19 02:09:17,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 02:09:17,287 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-12-19 02:09:17,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:17,294 INFO L225 Difference]: With dead ends: 5823 [2019-12-19 02:09:17,294 INFO L226 Difference]: Without dead ends: 5770 [2019-12-19 02:09:17,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-19 02:09:17,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5770 states. [2019-12-19 02:09:17,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5770 to 5170. [2019-12-19 02:09:17,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5170 states. [2019-12-19 02:09:17,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5170 states to 5170 states and 11432 transitions. [2019-12-19 02:09:17,345 INFO L78 Accepts]: Start accepts. Automaton has 5170 states and 11432 transitions. Word has length 75 [2019-12-19 02:09:17,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:17,345 INFO L462 AbstractCegarLoop]: Abstraction has 5170 states and 11432 transitions. [2019-12-19 02:09:17,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:09:17,345 INFO L276 IsEmpty]: Start isEmpty. Operand 5170 states and 11432 transitions. [2019-12-19 02:09:17,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 02:09:17,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:17,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:17,350 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:17,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:17,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1470478578, now seen corresponding path program 1 times [2019-12-19 02:09:17,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:17,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796422198] [2019-12-19 02:09:17,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:17,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:17,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796422198] [2019-12-19 02:09:17,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:17,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:17,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96741534] [2019-12-19 02:09:17,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:17,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:17,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:17,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:17,420 INFO L87 Difference]: Start difference. First operand 5170 states and 11432 transitions. Second operand 5 states. [2019-12-19 02:09:17,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:17,738 INFO L93 Difference]: Finished difference Result 6012 states and 13224 transitions. [2019-12-19 02:09:17,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:09:17,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-19 02:09:17,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:17,746 INFO L225 Difference]: With dead ends: 6012 [2019-12-19 02:09:17,747 INFO L226 Difference]: Without dead ends: 6012 [2019-12-19 02:09:17,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:09:17,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2019-12-19 02:09:17,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 5315. [2019-12-19 02:09:17,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5315 states. [2019-12-19 02:09:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5315 states to 5315 states and 11747 transitions. [2019-12-19 02:09:17,798 INFO L78 Accepts]: Start accepts. Automaton has 5315 states and 11747 transitions. Word has length 96 [2019-12-19 02:09:17,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:17,798 INFO L462 AbstractCegarLoop]: Abstraction has 5315 states and 11747 transitions. [2019-12-19 02:09:17,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:17,798 INFO L276 IsEmpty]: Start isEmpty. Operand 5315 states and 11747 transitions. [2019-12-19 02:09:17,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 02:09:17,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:17,805 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:17,806 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:17,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:17,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1713375192, now seen corresponding path program 2 times [2019-12-19 02:09:17,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:17,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719351772] [2019-12-19 02:09:17,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:17,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:17,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719351772] [2019-12-19 02:09:17,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:17,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:09:17,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963264465] [2019-12-19 02:09:17,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:09:17,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:17,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:09:17,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:09:17,873 INFO L87 Difference]: Start difference. First operand 5315 states and 11747 transitions. Second operand 4 states. [2019-12-19 02:09:17,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:17,982 INFO L93 Difference]: Finished difference Result 6278 states and 13796 transitions. [2019-12-19 02:09:17,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:09:17,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-19 02:09:17,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:17,988 INFO L225 Difference]: With dead ends: 6278 [2019-12-19 02:09:17,988 INFO L226 Difference]: Without dead ends: 6278 [2019-12-19 02:09:17,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:17,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6278 states. [2019-12-19 02:09:18,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6278 to 5509. [2019-12-19 02:09:18,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5509 states. [2019-12-19 02:09:18,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5509 states to 5509 states and 12153 transitions. [2019-12-19 02:09:18,043 INFO L78 Accepts]: Start accepts. Automaton has 5509 states and 12153 transitions. Word has length 96 [2019-12-19 02:09:18,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:18,043 INFO L462 AbstractCegarLoop]: Abstraction has 5509 states and 12153 transitions. [2019-12-19 02:09:18,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:09:18,043 INFO L276 IsEmpty]: Start isEmpty. Operand 5509 states and 12153 transitions. [2019-12-19 02:09:18,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:18,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:18,048 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:18,048 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:18,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:18,048 INFO L82 PathProgramCache]: Analyzing trace with hash -319220326, now seen corresponding path program 1 times [2019-12-19 02:09:18,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:18,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816015822] [2019-12-19 02:09:18,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:18,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:18,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816015822] [2019-12-19 02:09:18,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:18,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:18,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372440391] [2019-12-19 02:09:18,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:18,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:18,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:18,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:18,117 INFO L87 Difference]: Start difference. First operand 5509 states and 12153 transitions. Second operand 5 states. [2019-12-19 02:09:18,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:18,237 INFO L93 Difference]: Finished difference Result 5979 states and 13177 transitions. [2019-12-19 02:09:18,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:09:18,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-12-19 02:09:18,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:18,244 INFO L225 Difference]: With dead ends: 5979 [2019-12-19 02:09:18,245 INFO L226 Difference]: Without dead ends: 5979 [2019-12-19 02:09:18,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:09:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5979 states. [2019-12-19 02:09:18,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5979 to 4609. [2019-12-19 02:09:18,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4609 states. [2019-12-19 02:09:18,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4609 states to 4609 states and 10154 transitions. [2019-12-19 02:09:18,290 INFO L78 Accepts]: Start accepts. Automaton has 4609 states and 10154 transitions. Word has length 98 [2019-12-19 02:09:18,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:18,290 INFO L462 AbstractCegarLoop]: Abstraction has 4609 states and 10154 transitions. [2019-12-19 02:09:18,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:18,290 INFO L276 IsEmpty]: Start isEmpty. Operand 4609 states and 10154 transitions. [2019-12-19 02:09:18,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:18,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:18,298 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:18,298 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:18,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:18,298 INFO L82 PathProgramCache]: Analyzing trace with hash -307904199, now seen corresponding path program 1 times [2019-12-19 02:09:18,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:18,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409141964] [2019-12-19 02:09:18,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:18,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:18,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409141964] [2019-12-19 02:09:18,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:18,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:09:18,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499585525] [2019-12-19 02:09:18,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:09:18,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:18,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:09:18,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:18,433 INFO L87 Difference]: Start difference. First operand 4609 states and 10154 transitions. Second operand 6 states. [2019-12-19 02:09:18,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:18,738 INFO L93 Difference]: Finished difference Result 5093 states and 11141 transitions. [2019-12-19 02:09:18,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:09:18,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-12-19 02:09:18,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:18,748 INFO L225 Difference]: With dead ends: 5093 [2019-12-19 02:09:18,748 INFO L226 Difference]: Without dead ends: 5093 [2019-12-19 02:09:18,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:18,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5093 states. [2019-12-19 02:09:18,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5093 to 4503. [2019-12-19 02:09:18,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4503 states. [2019-12-19 02:09:18,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4503 states to 4503 states and 9963 transitions. [2019-12-19 02:09:18,831 INFO L78 Accepts]: Start accepts. Automaton has 4503 states and 9963 transitions. Word has length 98 [2019-12-19 02:09:18,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:18,831 INFO L462 AbstractCegarLoop]: Abstraction has 4503 states and 9963 transitions. [2019-12-19 02:09:18,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:09:18,832 INFO L276 IsEmpty]: Start isEmpty. Operand 4503 states and 9963 transitions. [2019-12-19 02:09:18,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:18,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:18,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:18,841 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:18,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:18,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1153746234, now seen corresponding path program 1 times [2019-12-19 02:09:18,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:18,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465636965] [2019-12-19 02:09:18,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:18,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:18,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465636965] [2019-12-19 02:09:18,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:18,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:09:18,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352851710] [2019-12-19 02:09:18,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:09:18,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:18,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:09:18,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:09:18,944 INFO L87 Difference]: Start difference. First operand 4503 states and 9963 transitions. Second operand 4 states. [2019-12-19 02:09:19,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:19,252 INFO L93 Difference]: Finished difference Result 5718 states and 12590 transitions. [2019-12-19 02:09:19,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:09:19,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-19 02:09:19,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:19,259 INFO L225 Difference]: With dead ends: 5718 [2019-12-19 02:09:19,259 INFO L226 Difference]: Without dead ends: 5662 [2019-12-19 02:09:19,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:19,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5662 states. [2019-12-19 02:09:19,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5662 to 5357. [2019-12-19 02:09:19,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5357 states. [2019-12-19 02:09:19,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5357 states to 5357 states and 11821 transitions. [2019-12-19 02:09:19,339 INFO L78 Accepts]: Start accepts. Automaton has 5357 states and 11821 transitions. Word has length 98 [2019-12-19 02:09:19,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:19,339 INFO L462 AbstractCegarLoop]: Abstraction has 5357 states and 11821 transitions. [2019-12-19 02:09:19,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:09:19,339 INFO L276 IsEmpty]: Start isEmpty. Operand 5357 states and 11821 transitions. [2019-12-19 02:09:19,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:19,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:19,347 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:19,347 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:19,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:19,349 INFO L82 PathProgramCache]: Analyzing trace with hash -923463109, now seen corresponding path program 1 times [2019-12-19 02:09:19,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:19,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016221321] [2019-12-19 02:09:19,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:19,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:19,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016221321] [2019-12-19 02:09:19,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:19,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 02:09:19,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361269845] [2019-12-19 02:09:19,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 02:09:19,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:19,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 02:09:19,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:09:19,530 INFO L87 Difference]: Start difference. First operand 5357 states and 11821 transitions. Second operand 9 states. [2019-12-19 02:09:20,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:20,283 INFO L93 Difference]: Finished difference Result 6848 states and 14977 transitions. [2019-12-19 02:09:20,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 02:09:20,284 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-12-19 02:09:20,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:20,292 INFO L225 Difference]: With dead ends: 6848 [2019-12-19 02:09:20,293 INFO L226 Difference]: Without dead ends: 6848 [2019-12-19 02:09:20,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-12-19 02:09:20,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6848 states. [2019-12-19 02:09:20,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6848 to 5826. [2019-12-19 02:09:20,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5826 states. [2019-12-19 02:09:20,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5826 states to 5826 states and 12786 transitions. [2019-12-19 02:09:20,355 INFO L78 Accepts]: Start accepts. Automaton has 5826 states and 12786 transitions. Word has length 98 [2019-12-19 02:09:20,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:20,356 INFO L462 AbstractCegarLoop]: Abstraction has 5826 states and 12786 transitions. [2019-12-19 02:09:20,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 02:09:20,356 INFO L276 IsEmpty]: Start isEmpty. Operand 5826 states and 12786 transitions. [2019-12-19 02:09:20,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:20,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:20,362 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:20,362 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:20,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:20,362 INFO L82 PathProgramCache]: Analyzing trace with hash -712112196, now seen corresponding path program 1 times [2019-12-19 02:09:20,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:20,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645199668] [2019-12-19 02:09:20,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:20,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:20,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645199668] [2019-12-19 02:09:20,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:20,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 02:09:20,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527575189] [2019-12-19 02:09:20,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 02:09:20,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:20,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 02:09:20,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:09:20,564 INFO L87 Difference]: Start difference. First operand 5826 states and 12786 transitions. Second operand 9 states. [2019-12-19 02:09:21,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:21,139 INFO L93 Difference]: Finished difference Result 6708 states and 14664 transitions. [2019-12-19 02:09:21,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-19 02:09:21,139 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-12-19 02:09:21,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:21,148 INFO L225 Difference]: With dead ends: 6708 [2019-12-19 02:09:21,148 INFO L226 Difference]: Without dead ends: 6680 [2019-12-19 02:09:21,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-12-19 02:09:21,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6680 states. [2019-12-19 02:09:21,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6680 to 5791. [2019-12-19 02:09:21,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5791 states. [2019-12-19 02:09:21,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5791 states to 5791 states and 12703 transitions. [2019-12-19 02:09:21,215 INFO L78 Accepts]: Start accepts. Automaton has 5791 states and 12703 transitions. Word has length 98 [2019-12-19 02:09:21,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:21,215 INFO L462 AbstractCegarLoop]: Abstraction has 5791 states and 12703 transitions. [2019-12-19 02:09:21,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 02:09:21,215 INFO L276 IsEmpty]: Start isEmpty. Operand 5791 states and 12703 transitions. [2019-12-19 02:09:21,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:21,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:21,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:21,222 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:21,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:21,222 INFO L82 PathProgramCache]: Analyzing trace with hash 175391485, now seen corresponding path program 1 times [2019-12-19 02:09:21,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:21,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271584030] [2019-12-19 02:09:21,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:21,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:21,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271584030] [2019-12-19 02:09:21,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:21,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-19 02:09:21,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039000873] [2019-12-19 02:09:21,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-19 02:09:21,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:21,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-19 02:09:21,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-19 02:09:21,351 INFO L87 Difference]: Start difference. First operand 5791 states and 12703 transitions. Second operand 10 states. [2019-12-19 02:09:21,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:21,835 INFO L93 Difference]: Finished difference Result 17698 states and 39417 transitions. [2019-12-19 02:09:21,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-19 02:09:21,835 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2019-12-19 02:09:21,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:21,852 INFO L225 Difference]: With dead ends: 17698 [2019-12-19 02:09:21,852 INFO L226 Difference]: Without dead ends: 11790 [2019-12-19 02:09:21,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-19 02:09:21,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11790 states. [2019-12-19 02:09:21,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11790 to 5763. [2019-12-19 02:09:21,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5763 states. [2019-12-19 02:09:21,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5763 states to 5763 states and 12568 transitions. [2019-12-19 02:09:21,940 INFO L78 Accepts]: Start accepts. Automaton has 5763 states and 12568 transitions. Word has length 98 [2019-12-19 02:09:21,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:21,941 INFO L462 AbstractCegarLoop]: Abstraction has 5763 states and 12568 transitions. [2019-12-19 02:09:21,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-19 02:09:21,941 INFO L276 IsEmpty]: Start isEmpty. Operand 5763 states and 12568 transitions. [2019-12-19 02:09:21,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:21,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:21,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:21,946 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:21,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:21,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1812352579, now seen corresponding path program 1 times [2019-12-19 02:09:21,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:21,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439568058] [2019-12-19 02:09:21,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:22,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:22,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439568058] [2019-12-19 02:09:22,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:22,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:22,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515606242] [2019-12-19 02:09:22,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:22,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:22,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:22,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:22,012 INFO L87 Difference]: Start difference. First operand 5763 states and 12568 transitions. Second operand 5 states. [2019-12-19 02:09:22,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:22,302 INFO L93 Difference]: Finished difference Result 5279 states and 11441 transitions. [2019-12-19 02:09:22,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:09:22,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-12-19 02:09:22,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:22,309 INFO L225 Difference]: With dead ends: 5279 [2019-12-19 02:09:22,309 INFO L226 Difference]: Without dead ends: 5279 [2019-12-19 02:09:22,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:22,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5279 states. [2019-12-19 02:09:22,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5279 to 4879. [2019-12-19 02:09:22,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4879 states. [2019-12-19 02:09:22,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4879 states to 4879 states and 10622 transitions. [2019-12-19 02:09:22,357 INFO L78 Accepts]: Start accepts. Automaton has 4879 states and 10622 transitions. Word has length 98 [2019-12-19 02:09:22,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:22,357 INFO L462 AbstractCegarLoop]: Abstraction has 4879 states and 10622 transitions. [2019-12-19 02:09:22,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:22,357 INFO L276 IsEmpty]: Start isEmpty. Operand 4879 states and 10622 transitions. [2019-12-19 02:09:22,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:22,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:22,362 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:22,362 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:22,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:22,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1130623483, now seen corresponding path program 1 times [2019-12-19 02:09:22,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:22,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058703618] [2019-12-19 02:09:22,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:22,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058703618] [2019-12-19 02:09:22,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:22,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:09:22,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268975428] [2019-12-19 02:09:22,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:09:22,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:22,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:09:22,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:22,527 INFO L87 Difference]: Start difference. First operand 4879 states and 10622 transitions. Second operand 6 states. [2019-12-19 02:09:22,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:22,778 INFO L93 Difference]: Finished difference Result 5527 states and 11938 transitions. [2019-12-19 02:09:22,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:09:22,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-12-19 02:09:22,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:22,788 INFO L225 Difference]: With dead ends: 5527 [2019-12-19 02:09:22,788 INFO L226 Difference]: Without dead ends: 5479 [2019-12-19 02:09:22,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:09:22,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5479 states. [2019-12-19 02:09:22,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5479 to 4879. [2019-12-19 02:09:22,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4879 states. [2019-12-19 02:09:22,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4879 states to 4879 states and 10555 transitions. [2019-12-19 02:09:22,889 INFO L78 Accepts]: Start accepts. Automaton has 4879 states and 10555 transitions. Word has length 98 [2019-12-19 02:09:22,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:22,889 INFO L462 AbstractCegarLoop]: Abstraction has 4879 states and 10555 transitions. [2019-12-19 02:09:22,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:09:22,889 INFO L276 IsEmpty]: Start isEmpty. Operand 4879 states and 10555 transitions. [2019-12-19 02:09:22,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:22,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:22,898 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:22,899 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:22,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:22,899 INFO L82 PathProgramCache]: Analyzing trace with hash -961810619, now seen corresponding path program 2 times [2019-12-19 02:09:22,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:22,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668461518] [2019-12-19 02:09:22,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:23,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:23,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668461518] [2019-12-19 02:09:23,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:23,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 02:09:23,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662841776] [2019-12-19 02:09:23,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 02:09:23,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:23,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 02:09:23,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:09:23,155 INFO L87 Difference]: Start difference. First operand 4879 states and 10555 transitions. Second operand 9 states. [2019-12-19 02:09:23,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:23,765 INFO L93 Difference]: Finished difference Result 5551 states and 11981 transitions. [2019-12-19 02:09:23,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 02:09:23,765 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-12-19 02:09:23,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:23,772 INFO L225 Difference]: With dead ends: 5551 [2019-12-19 02:09:23,773 INFO L226 Difference]: Without dead ends: 5545 [2019-12-19 02:09:23,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-19 02:09:23,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5545 states. [2019-12-19 02:09:23,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5545 to 5019. [2019-12-19 02:09:23,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5019 states. [2019-12-19 02:09:23,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5019 states to 5019 states and 10877 transitions. [2019-12-19 02:09:23,825 INFO L78 Accepts]: Start accepts. Automaton has 5019 states and 10877 transitions. Word has length 98 [2019-12-19 02:09:23,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:23,825 INFO L462 AbstractCegarLoop]: Abstraction has 5019 states and 10877 transitions. [2019-12-19 02:09:23,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 02:09:23,826 INFO L276 IsEmpty]: Start isEmpty. Operand 5019 states and 10877 transitions. [2019-12-19 02:09:23,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:23,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:23,831 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:23,831 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:23,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:23,831 INFO L82 PathProgramCache]: Analyzing trace with hash -750459706, now seen corresponding path program 1 times [2019-12-19 02:09:23,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:23,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391155715] [2019-12-19 02:09:23,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:23,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:23,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391155715] [2019-12-19 02:09:23,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:23,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:09:23,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115573806] [2019-12-19 02:09:23,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:09:23,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:23,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:09:23,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:23,914 INFO L87 Difference]: Start difference. First operand 5019 states and 10877 transitions. Second operand 6 states. [2019-12-19 02:09:24,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:24,110 INFO L93 Difference]: Finished difference Result 5133 states and 11088 transitions. [2019-12-19 02:09:24,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:09:24,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-12-19 02:09:24,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:24,118 INFO L225 Difference]: With dead ends: 5133 [2019-12-19 02:09:24,118 INFO L226 Difference]: Without dead ends: 5133 [2019-12-19 02:09:24,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:09:24,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5133 states. [2019-12-19 02:09:24,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5133 to 4886. [2019-12-19 02:09:24,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4886 states. [2019-12-19 02:09:24,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4886 states to 4886 states and 10567 transitions. [2019-12-19 02:09:24,167 INFO L78 Accepts]: Start accepts. Automaton has 4886 states and 10567 transitions. Word has length 98 [2019-12-19 02:09:24,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:24,167 INFO L462 AbstractCegarLoop]: Abstraction has 4886 states and 10567 transitions. [2019-12-19 02:09:24,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:09:24,167 INFO L276 IsEmpty]: Start isEmpty. Operand 4886 states and 10567 transitions. [2019-12-19 02:09:24,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:24,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:24,172 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:24,172 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:24,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:24,172 INFO L82 PathProgramCache]: Analyzing trace with hash -800857722, now seen corresponding path program 1 times [2019-12-19 02:09:24,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:24,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971357249] [2019-12-19 02:09:24,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:24,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:24,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971357249] [2019-12-19 02:09:24,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:24,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 02:09:24,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167896310] [2019-12-19 02:09:24,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 02:09:24,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:24,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 02:09:24,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:09:24,295 INFO L87 Difference]: Start difference. First operand 4886 states and 10567 transitions. Second operand 8 states. [2019-12-19 02:09:24,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:24,746 INFO L93 Difference]: Finished difference Result 6177 states and 13258 transitions. [2019-12-19 02:09:24,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 02:09:24,746 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 98 [2019-12-19 02:09:24,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:24,752 INFO L225 Difference]: With dead ends: 6177 [2019-12-19 02:09:24,752 INFO L226 Difference]: Without dead ends: 6177 [2019-12-19 02:09:24,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-19 02:09:24,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6177 states. [2019-12-19 02:09:24,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6177 to 4986. [2019-12-19 02:09:24,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4986 states. [2019-12-19 02:09:24,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4986 states to 4986 states and 10795 transitions. [2019-12-19 02:09:24,803 INFO L78 Accepts]: Start accepts. Automaton has 4986 states and 10795 transitions. Word has length 98 [2019-12-19 02:09:24,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:24,803 INFO L462 AbstractCegarLoop]: Abstraction has 4986 states and 10795 transitions. [2019-12-19 02:09:24,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 02:09:24,803 INFO L276 IsEmpty]: Start isEmpty. Operand 4986 states and 10795 transitions. [2019-12-19 02:09:24,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:24,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:24,808 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:24,808 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:24,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:24,808 INFO L82 PathProgramCache]: Analyzing trace with hash -589506809, now seen corresponding path program 2 times [2019-12-19 02:09:24,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:24,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590303238] [2019-12-19 02:09:24,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:24,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 02:09:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 02:09:24,972 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 02:09:24,973 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 02:09:25,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 02:09:25 BasicIcfg [2019-12-19 02:09:25,171 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 02:09:25,177 INFO L168 Benchmark]: Toolchain (without parser) took 47422.21 ms. Allocated memory was 145.8 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 102.2 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-19 02:09:25,178 INFO L168 Benchmark]: CDTParser took 1.37 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-19 02:09:25,178 INFO L168 Benchmark]: CACSL2BoogieTranslator took 785.41 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.8 MB in the beginning and 157.7 MB in the end (delta: -55.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-19 02:09:25,179 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.70 ms. Allocated memory is still 202.9 MB. Free memory was 157.0 MB in the beginning and 155.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-19 02:09:25,179 INFO L168 Benchmark]: Boogie Preprocessor took 38.27 ms. Allocated memory is still 202.9 MB. Free memory was 155.0 MB in the beginning and 152.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-19 02:09:25,179 INFO L168 Benchmark]: RCFGBuilder took 767.87 ms. Allocated memory is still 202.9 MB. Free memory was 152.4 MB in the beginning and 107.8 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. [2019-12-19 02:09:25,180 INFO L168 Benchmark]: TraceAbstraction took 45757.86 ms. Allocated memory was 202.9 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 107.8 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-19 02:09:25,182 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.37 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 785.41 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 101.8 MB in the beginning and 157.7 MB in the end (delta: -55.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.70 ms. Allocated memory is still 202.9 MB. Free memory was 157.0 MB in the beginning and 155.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.27 ms. Allocated memory is still 202.9 MB. Free memory was 155.0 MB in the beginning and 152.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 767.87 ms. Allocated memory is still 202.9 MB. Free memory was 152.4 MB in the beginning and 107.8 MB in the end (delta: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 45757.86 ms. Allocated memory was 202.9 MB in the beginning and 2.3 GB in the end (delta: 2.1 GB). Free memory was 107.8 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L700] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L701] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L702] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L704] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L708] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L709] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L710] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L711] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L712] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L713] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L714] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L715] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L716] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L717] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L718] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L719] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L720] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L721] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L722] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L723] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L724] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 0 pthread_t t901; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] FCALL, FORK 0 pthread_create(&t901, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L805] 0 pthread_t t902; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L728] 1 z$w_buff1 = z$w_buff0 [L729] 1 z$w_buff0 = 1 [L730] 1 z$w_buff1_used = z$w_buff0_used [L731] 1 z$w_buff0_used = (_Bool)1 [L806] FCALL, FORK 0 pthread_create(&t902, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L775] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 z = z$flush_delayed ? z$mem_tmp : z [L778] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L745] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=1] [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=1, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=1] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L813] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L816] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L819] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 45.3s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 18.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9768 SDtfs, 10749 SDslu, 22538 SDs, 0 SdLazy, 8779 SolverSat, 508 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 366 GetRequests, 94 SyntacticMatches, 32 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71014occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 19.9s AutomataMinimizationTime, 35 MinimizatonAttempts, 76443 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2734 NumberOfCodeBlocks, 2734 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2601 ConstructedInterpolants, 0 QuantifiedInterpolants, 542558 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...