/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-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:31:40,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:31:40,283 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:31:40,300 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:31:40,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:31:40,303 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:31:40,305 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:31:40,315 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:31:40,319 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:31:40,322 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:31:40,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:31:40,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:31:40,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:31:40,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:31:40,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:31:40,331 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:31:40,333 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:31:40,334 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:31:40,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:31:40,340 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:31:40,344 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:31:40,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:31:40,349 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:31:40,350 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:31:40,352 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:31:40,353 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:31:40,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:31:40,354 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:31:40,356 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:31:40,356 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:31:40,357 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:31:40,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:31:40,359 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:31:40,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:31:40,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:31:40,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:31:40,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:31:40,363 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:31:40,363 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:31:40,364 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:31:40,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:31:40,366 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:31:40,399 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:31:40,399 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:31:40,401 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:31:40,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:31:40,404 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:31:40,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:31:40,405 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:31:40,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:31:40,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:31:40,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:31:40,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:31:40,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:31:40,406 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:31:40,406 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:31:40,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:31:40,406 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:31:40,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:31:40,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:31:40,408 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:31:40,408 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:31:40,408 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:31:40,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:31:40,409 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:31:40,409 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:31:40,409 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:31:40,409 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:31:40,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:31:40,410 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:31:40,410 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:31:40,410 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:31:40,410 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:31:40,702 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:31:40,721 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:31:40,724 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:31:40,726 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:31:40,726 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:31:40,727 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.oepc.i [2019-12-27 17:31:40,800 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5402d8802/a83477fbc17f46cd82030c5dbdcc0a0b/FLAG831c8320d [2019-12-27 17:31:41,439 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:31:41,439 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_power.oepc.i [2019-12-27 17:31:41,457 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5402d8802/a83477fbc17f46cd82030c5dbdcc0a0b/FLAG831c8320d [2019-12-27 17:31:41,668 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5402d8802/a83477fbc17f46cd82030c5dbdcc0a0b [2019-12-27 17:31:41,678 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:31:41,680 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:31:41,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:31:41,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:31:41,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:31:41,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:31:41" (1/1) ... [2019-12-27 17:31:41,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@645a8af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:31:41, skipping insertion in model container [2019-12-27 17:31:41,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:31:41" (1/1) ... [2019-12-27 17:31:41,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:31:41,756 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:31:42,322 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:31:42,346 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:31:42,431 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:31:42,502 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:31:42,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:31:42 WrapperNode [2019-12-27 17:31:42,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:31:42,504 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:31:42,504 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:31:42,504 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:31:42,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:31:42" (1/1) ... [2019-12-27 17:31:42,534 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:31:42" (1/1) ... [2019-12-27 17:31:42,569 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:31:42,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:31:42,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:31:42,570 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:31:42,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:31:42" (1/1) ... [2019-12-27 17:31:42,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:31:42" (1/1) ... [2019-12-27 17:31:42,584 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:31:42" (1/1) ... [2019-12-27 17:31:42,585 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:31:42" (1/1) ... [2019-12-27 17:31:42,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:31:42" (1/1) ... [2019-12-27 17:31:42,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:31:42" (1/1) ... [2019-12-27 17:31:42,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:31:42" (1/1) ... [2019-12-27 17:31:42,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:31:42,609 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:31:42,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:31:42,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:31:42,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:31:42" (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-27 17:31:42,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:31:42,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:31:42,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:31:42,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:31:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:31:42,691 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:31:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:31:42,691 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:31:42,692 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:31:42,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:31:42,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:31:42,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:31:42,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:31:42,695 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:31:43,645 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:31:43,646 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:31:43,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:31:43 BoogieIcfgContainer [2019-12-27 17:31:43,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:31:43,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:31:43,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:31:43,652 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:31:43,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:31:41" (1/3) ... [2019-12-27 17:31:43,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45fab9e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:31:43, skipping insertion in model container [2019-12-27 17:31:43,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:31:42" (2/3) ... [2019-12-27 17:31:43,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45fab9e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:31:43, skipping insertion in model container [2019-12-27 17:31:43,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:31:43" (3/3) ... [2019-12-27 17:31:43,656 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_power.oepc.i [2019-12-27 17:31:43,667 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:31:43,667 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:31:43,675 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:31:43,676 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:31:43,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,719 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,739 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,739 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,740 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,744 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,750 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,752 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,752 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,765 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,765 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,793 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,793 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,793 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,796 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,797 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,801 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,804 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:31:43,827 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 17:31:43,848 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:31:43,848 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:31:43,848 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:31:43,848 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:31:43,848 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:31:43,848 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:31:43,849 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:31:43,849 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:31:43,867 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 17:31:43,869 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 17:31:43,978 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 17:31:43,978 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:31:43,999 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 430 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 17:31:44,022 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 17:31:44,104 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 17:31:44,104 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:31:44,113 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 430 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 17:31:44,135 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 17:31:44,136 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:31:49,717 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 17:31:49,834 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 17:31:49,859 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77200 [2019-12-27 17:31:49,860 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 17:31:49,864 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-27 17:32:03,870 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-27 17:32:03,872 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-27 17:32:03,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 17:32:03,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:03,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 17:32:03,879 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:03,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:03,886 INFO L82 PathProgramCache]: Analyzing trace with hash 909908, now seen corresponding path program 1 times [2019-12-27 17:32:03,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:03,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534801284] [2019-12-27 17:32:03,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:04,144 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-27 17:32:04,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534801284] [2019-12-27 17:32:04,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:04,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:32:04,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1817849229] [2019-12-27 17:32:04,147 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:04,151 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:04,163 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 17:32:04,163 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:04,167 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:32:04,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:32:04,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:04,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:32:04,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:32:04,180 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-27 17:32:07,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:07,733 INFO L93 Difference]: Finished difference Result 101472 states and 432734 transitions. [2019-12-27 17:32:07,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:32:07,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 17:32:07,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:08,390 INFO L225 Difference]: With dead ends: 101472 [2019-12-27 17:32:08,390 INFO L226 Difference]: Without dead ends: 95232 [2019-12-27 17:32:08,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-27 17:32:13,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95232 states. [2019-12-27 17:32:15,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95232 to 95232. [2019-12-27 17:32:15,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95232 states. [2019-12-27 17:32:16,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95232 states to 95232 states and 405538 transitions. [2019-12-27 17:32:16,121 INFO L78 Accepts]: Start accepts. Automaton has 95232 states and 405538 transitions. Word has length 3 [2019-12-27 17:32:16,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:16,121 INFO L462 AbstractCegarLoop]: Abstraction has 95232 states and 405538 transitions. [2019-12-27 17:32:16,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:32:16,122 INFO L276 IsEmpty]: Start isEmpty. Operand 95232 states and 405538 transitions. [2019-12-27 17:32:16,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:32:16,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:16,126 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:32:16,126 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:16,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:16,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1729820714, now seen corresponding path program 1 times [2019-12-27 17:32:16,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:16,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475992933] [2019-12-27 17:32:16,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:16,261 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-27 17:32:16,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475992933] [2019-12-27 17:32:16,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:16,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:32:16,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2059163687] [2019-12-27 17:32:16,263 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:16,265 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:16,267 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:32:16,268 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:16,268 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:32:16,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:32:16,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:16,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:32:16,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:32:16,272 INFO L87 Difference]: Start difference. First operand 95232 states and 405538 transitions. Second operand 4 states. [2019-12-27 17:32:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:20,641 INFO L93 Difference]: Finished difference Result 151692 states and 619304 transitions. [2019-12-27 17:32:20,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:32:20,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:32:20,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:21,222 INFO L225 Difference]: With dead ends: 151692 [2019-12-27 17:32:21,222 INFO L226 Difference]: Without dead ends: 151643 [2019-12-27 17:32:21,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-27 17:32:25,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151643 states. [2019-12-27 17:32:28,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151643 to 138429. [2019-12-27 17:32:28,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138429 states. [2019-12-27 17:32:35,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138429 states to 138429 states and 572602 transitions. [2019-12-27 17:32:35,236 INFO L78 Accepts]: Start accepts. Automaton has 138429 states and 572602 transitions. Word has length 11 [2019-12-27 17:32:35,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:35,237 INFO L462 AbstractCegarLoop]: Abstraction has 138429 states and 572602 transitions. [2019-12-27 17:32:35,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:32:35,237 INFO L276 IsEmpty]: Start isEmpty. Operand 138429 states and 572602 transitions. [2019-12-27 17:32:35,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 17:32:35,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:35,242 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:32:35,243 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:35,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:35,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1791451612, now seen corresponding path program 1 times [2019-12-27 17:32:35,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:35,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656092450] [2019-12-27 17:32:35,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:35,302 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-27 17:32:35,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656092450] [2019-12-27 17:32:35,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:35,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:32:35,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [689437053] [2019-12-27 17:32:35,303 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:35,304 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:35,306 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 17:32:35,306 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:35,307 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:32:35,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:32:35,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:35,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:32:35,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:32:35,308 INFO L87 Difference]: Start difference. First operand 138429 states and 572602 transitions. Second operand 3 states. [2019-12-27 17:32:35,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:35,449 INFO L93 Difference]: Finished difference Result 30955 states and 100617 transitions. [2019-12-27 17:32:35,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:32:35,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 17:32:35,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:35,499 INFO L225 Difference]: With dead ends: 30955 [2019-12-27 17:32:35,499 INFO L226 Difference]: Without dead ends: 30955 [2019-12-27 17:32:35,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-27 17:32:35,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30955 states. [2019-12-27 17:32:35,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30955 to 30955. [2019-12-27 17:32:35,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30955 states. [2019-12-27 17:32:36,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30955 states to 30955 states and 100617 transitions. [2019-12-27 17:32:36,057 INFO L78 Accepts]: Start accepts. Automaton has 30955 states and 100617 transitions. Word has length 13 [2019-12-27 17:32:36,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:36,058 INFO L462 AbstractCegarLoop]: Abstraction has 30955 states and 100617 transitions. [2019-12-27 17:32:36,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:32:36,058 INFO L276 IsEmpty]: Start isEmpty. Operand 30955 states and 100617 transitions. [2019-12-27 17:32:36,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:32:36,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:36,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:32:36,061 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:36,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:36,061 INFO L82 PathProgramCache]: Analyzing trace with hash -137996123, now seen corresponding path program 1 times [2019-12-27 17:32:36,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:36,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593175168] [2019-12-27 17:32:36,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:36,116 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-27 17:32:36,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593175168] [2019-12-27 17:32:36,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:36,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:32:36,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [544584048] [2019-12-27 17:32:36,118 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:36,124 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:36,126 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 17:32:36,127 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:36,127 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:32:36,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:32:36,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:36,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:32:36,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:32:36,129 INFO L87 Difference]: Start difference. First operand 30955 states and 100617 transitions. Second operand 3 states. [2019-12-27 17:32:36,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:36,342 INFO L93 Difference]: Finished difference Result 47061 states and 152507 transitions. [2019-12-27 17:32:36,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:32:36,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 17:32:36,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:37,723 INFO L225 Difference]: With dead ends: 47061 [2019-12-27 17:32:37,723 INFO L226 Difference]: Without dead ends: 47061 [2019-12-27 17:32:37,724 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-27 17:32:37,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47061 states. [2019-12-27 17:32:38,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47061 to 33925. [2019-12-27 17:32:38,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33925 states. [2019-12-27 17:32:38,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33925 states to 33925 states and 111057 transitions. [2019-12-27 17:32:38,346 INFO L78 Accepts]: Start accepts. Automaton has 33925 states and 111057 transitions. Word has length 16 [2019-12-27 17:32:38,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:38,347 INFO L462 AbstractCegarLoop]: Abstraction has 33925 states and 111057 transitions. [2019-12-27 17:32:38,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:32:38,348 INFO L276 IsEmpty]: Start isEmpty. Operand 33925 states and 111057 transitions. [2019-12-27 17:32:38,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:32:38,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:38,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:32:38,350 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:38,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:38,351 INFO L82 PathProgramCache]: Analyzing trace with hash -137876649, now seen corresponding path program 1 times [2019-12-27 17:32:38,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:38,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260468919] [2019-12-27 17:32:38,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:38,461 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-27 17:32:38,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260468919] [2019-12-27 17:32:38,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:38,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:32:38,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [661387889] [2019-12-27 17:32:38,463 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:38,465 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:38,468 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 17:32:38,468 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:38,469 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:32:38,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:32:38,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:38,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:32:38,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:32:38,470 INFO L87 Difference]: Start difference. First operand 33925 states and 111057 transitions. Second operand 4 states. [2019-12-27 17:32:38,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:38,834 INFO L93 Difference]: Finished difference Result 41000 states and 132194 transitions. [2019-12-27 17:32:38,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:32:38,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 17:32:38,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:38,900 INFO L225 Difference]: With dead ends: 41000 [2019-12-27 17:32:38,901 INFO L226 Difference]: Without dead ends: 41000 [2019-12-27 17:32:38,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-27 17:32:39,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41000 states. [2019-12-27 17:32:41,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41000 to 37405. [2019-12-27 17:32:41,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37405 states. [2019-12-27 17:32:41,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37405 states to 37405 states and 121522 transitions. [2019-12-27 17:32:41,866 INFO L78 Accepts]: Start accepts. Automaton has 37405 states and 121522 transitions. Word has length 16 [2019-12-27 17:32:41,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:41,867 INFO L462 AbstractCegarLoop]: Abstraction has 37405 states and 121522 transitions. [2019-12-27 17:32:41,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:32:41,867 INFO L276 IsEmpty]: Start isEmpty. Operand 37405 states and 121522 transitions. [2019-12-27 17:32:41,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:32:41,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:41,870 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:32:41,870 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:41,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:41,870 INFO L82 PathProgramCache]: Analyzing trace with hash -219444717, now seen corresponding path program 1 times [2019-12-27 17:32:41,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:41,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675219515] [2019-12-27 17:32:41,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:41,927 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-27 17:32:41,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675219515] [2019-12-27 17:32:41,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:41,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:32:41,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [207421974] [2019-12-27 17:32:41,929 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:41,934 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:41,936 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 17:32:41,937 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:41,937 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:32:41,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:32:41,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:41,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:32:41,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:32:41,938 INFO L87 Difference]: Start difference. First operand 37405 states and 121522 transitions. Second operand 4 states. [2019-12-27 17:32:42,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:42,284 INFO L93 Difference]: Finished difference Result 45062 states and 145323 transitions. [2019-12-27 17:32:42,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:32:42,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 17:32:42,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:42,359 INFO L225 Difference]: With dead ends: 45062 [2019-12-27 17:32:42,359 INFO L226 Difference]: Without dead ends: 45062 [2019-12-27 17:32:42,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-27 17:32:42,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45062 states. [2019-12-27 17:32:42,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45062 to 38365. [2019-12-27 17:32:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38365 states. [2019-12-27 17:32:43,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38365 states to 38365 states and 124903 transitions. [2019-12-27 17:32:43,044 INFO L78 Accepts]: Start accepts. Automaton has 38365 states and 124903 transitions. Word has length 16 [2019-12-27 17:32:43,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:43,045 INFO L462 AbstractCegarLoop]: Abstraction has 38365 states and 124903 transitions. [2019-12-27 17:32:43,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:32:43,045 INFO L276 IsEmpty]: Start isEmpty. Operand 38365 states and 124903 transitions. [2019-12-27 17:32:43,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 17:32:43,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:43,055 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] [2019-12-27 17:32:43,055 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:43,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:43,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1066994180, now seen corresponding path program 1 times [2019-12-27 17:32:43,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:43,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472998191] [2019-12-27 17:32:43,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:43,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-27 17:32:43,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472998191] [2019-12-27 17:32:43,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:43,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:32:43,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1340070755] [2019-12-27 17:32:43,139 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:43,142 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:43,152 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 58 transitions. [2019-12-27 17:32:43,153 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:43,154 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:32:43,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:32:43,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:43,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:32:43,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:32:43,155 INFO L87 Difference]: Start difference. First operand 38365 states and 124903 transitions. Second operand 5 states. [2019-12-27 17:32:44,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:44,169 INFO L93 Difference]: Finished difference Result 53898 states and 171065 transitions. [2019-12-27 17:32:44,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 17:32:44,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 17:32:44,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:44,257 INFO L225 Difference]: With dead ends: 53898 [2019-12-27 17:32:44,257 INFO L226 Difference]: Without dead ends: 53891 [2019-12-27 17:32:44,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 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-27 17:32:44,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53891 states. [2019-12-27 17:32:44,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53891 to 39721. [2019-12-27 17:32:44,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39721 states. [2019-12-27 17:32:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39721 states to 39721 states and 129036 transitions. [2019-12-27 17:32:44,986 INFO L78 Accepts]: Start accepts. Automaton has 39721 states and 129036 transitions. Word has length 22 [2019-12-27 17:32:44,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:44,986 INFO L462 AbstractCegarLoop]: Abstraction has 39721 states and 129036 transitions. [2019-12-27 17:32:44,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:32:44,987 INFO L276 IsEmpty]: Start isEmpty. Operand 39721 states and 129036 transitions. [2019-12-27 17:32:44,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 17:32:44,995 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:44,995 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] [2019-12-27 17:32:44,995 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:44,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:44,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1734556852, now seen corresponding path program 1 times [2019-12-27 17:32:44,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:44,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641132717] [2019-12-27 17:32:44,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:45,092 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-27 17:32:45,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641132717] [2019-12-27 17:32:45,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:45,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:32:45,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [360567866] [2019-12-27 17:32:45,093 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:45,096 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:45,103 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 44 transitions. [2019-12-27 17:32:45,103 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:45,108 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:32:45,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:32:45,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:45,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:32:45,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:32:45,109 INFO L87 Difference]: Start difference. First operand 39721 states and 129036 transitions. Second operand 5 states. [2019-12-27 17:32:45,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:45,836 INFO L93 Difference]: Finished difference Result 56181 states and 177938 transitions. [2019-12-27 17:32:45,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 17:32:45,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 17:32:45,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:45,980 INFO L225 Difference]: With dead ends: 56181 [2019-12-27 17:32:45,980 INFO L226 Difference]: Without dead ends: 56174 [2019-12-27 17:32:45,982 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-27 17:32:46,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56174 states. [2019-12-27 17:32:47,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56174 to 38054. [2019-12-27 17:32:47,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38054 states. [2019-12-27 17:32:47,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38054 states to 38054 states and 123745 transitions. [2019-12-27 17:32:47,182 INFO L78 Accepts]: Start accepts. Automaton has 38054 states and 123745 transitions. Word has length 22 [2019-12-27 17:32:47,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:47,182 INFO L462 AbstractCegarLoop]: Abstraction has 38054 states and 123745 transitions. [2019-12-27 17:32:47,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:32:47,182 INFO L276 IsEmpty]: Start isEmpty. Operand 38054 states and 123745 transitions. [2019-12-27 17:32:47,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:32:47,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:47,193 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] [2019-12-27 17:32:47,193 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:47,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:47,194 INFO L82 PathProgramCache]: Analyzing trace with hash -779030427, now seen corresponding path program 1 times [2019-12-27 17:32:47,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:47,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565147698] [2019-12-27 17:32:47,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:47,249 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-27 17:32:47,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565147698] [2019-12-27 17:32:47,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:47,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:32:47,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [969282621] [2019-12-27 17:32:47,250 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:47,255 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:47,266 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 17:32:47,266 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:47,316 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:32:47,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:32:47,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:47,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:32:47,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:32:47,318 INFO L87 Difference]: Start difference. First operand 38054 states and 123745 transitions. Second operand 5 states. [2019-12-27 17:32:47,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:47,392 INFO L93 Difference]: Finished difference Result 15260 states and 46817 transitions. [2019-12-27 17:32:47,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:32:47,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 17:32:47,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:47,415 INFO L225 Difference]: With dead ends: 15260 [2019-12-27 17:32:47,415 INFO L226 Difference]: Without dead ends: 15260 [2019-12-27 17:32:47,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:32:47,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15260 states. [2019-12-27 17:32:47,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15260 to 14988. [2019-12-27 17:32:47,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14988 states. [2019-12-27 17:32:47,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14988 states to 14988 states and 46041 transitions. [2019-12-27 17:32:47,640 INFO L78 Accepts]: Start accepts. Automaton has 14988 states and 46041 transitions. Word has length 25 [2019-12-27 17:32:47,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:47,640 INFO L462 AbstractCegarLoop]: Abstraction has 14988 states and 46041 transitions. [2019-12-27 17:32:47,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:32:47,641 INFO L276 IsEmpty]: Start isEmpty. Operand 14988 states and 46041 transitions. [2019-12-27 17:32:47,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:32:47,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:47,653 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] [2019-12-27 17:32:47,653 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:47,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:47,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1740727520, now seen corresponding path program 1 times [2019-12-27 17:32:47,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:47,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921257109] [2019-12-27 17:32:47,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:47,740 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-27 17:32:47,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921257109] [2019-12-27 17:32:47,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:47,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:32:47,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [648461694] [2019-12-27 17:32:47,742 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:47,753 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:47,760 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 17:32:47,760 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:47,761 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:32:47,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:32:47,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:47,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:32:47,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:32:47,763 INFO L87 Difference]: Start difference. First operand 14988 states and 46041 transitions. Second operand 5 states. [2019-12-27 17:32:48,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:48,140 INFO L93 Difference]: Finished difference Result 19496 states and 58771 transitions. [2019-12-27 17:32:48,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:32:48,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 17:32:48,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:48,178 INFO L225 Difference]: With dead ends: 19496 [2019-12-27 17:32:48,179 INFO L226 Difference]: Without dead ends: 19496 [2019-12-27 17:32:48,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:32:48,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19496 states. [2019-12-27 17:32:48,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19496 to 18230. [2019-12-27 17:32:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18230 states. [2019-12-27 17:32:48,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18230 states to 18230 states and 55601 transitions. [2019-12-27 17:32:48,481 INFO L78 Accepts]: Start accepts. Automaton has 18230 states and 55601 transitions. Word has length 27 [2019-12-27 17:32:48,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:48,482 INFO L462 AbstractCegarLoop]: Abstraction has 18230 states and 55601 transitions. [2019-12-27 17:32:48,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:32:48,482 INFO L276 IsEmpty]: Start isEmpty. Operand 18230 states and 55601 transitions. [2019-12-27 17:32:48,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 17:32:48,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:48,495 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] [2019-12-27 17:32:48,495 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:48,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:48,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1978987791, now seen corresponding path program 1 times [2019-12-27 17:32:48,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:48,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997731314] [2019-12-27 17:32:48,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:48,557 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-27 17:32:48,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997731314] [2019-12-27 17:32:48,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:48,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:32:48,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [447324408] [2019-12-27 17:32:48,558 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:48,563 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:48,571 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 17:32:48,572 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:48,572 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:32:48,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:32:48,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:48,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:32:48,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:32:48,574 INFO L87 Difference]: Start difference. First operand 18230 states and 55601 transitions. Second operand 5 states. [2019-12-27 17:32:49,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:49,012 INFO L93 Difference]: Finished difference Result 21384 states and 64177 transitions. [2019-12-27 17:32:49,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:32:49,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 17:32:49,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:49,050 INFO L225 Difference]: With dead ends: 21384 [2019-12-27 17:32:49,050 INFO L226 Difference]: Without dead ends: 21384 [2019-12-27 17:32:49,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:32:49,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21384 states. [2019-12-27 17:32:49,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21384 to 17323. [2019-12-27 17:32:49,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17323 states. [2019-12-27 17:32:49,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17323 states to 17323 states and 52883 transitions. [2019-12-27 17:32:49,553 INFO L78 Accepts]: Start accepts. Automaton has 17323 states and 52883 transitions. Word has length 28 [2019-12-27 17:32:49,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:49,554 INFO L462 AbstractCegarLoop]: Abstraction has 17323 states and 52883 transitions. [2019-12-27 17:32:49,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:32:49,554 INFO L276 IsEmpty]: Start isEmpty. Operand 17323 states and 52883 transitions. [2019-12-27 17:32:49,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 17:32:49,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:49,571 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] [2019-12-27 17:32:49,571 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:49,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:49,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1850577991, now seen corresponding path program 1 times [2019-12-27 17:32:49,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:49,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059356044] [2019-12-27 17:32:49,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:49,674 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-27 17:32:49,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059356044] [2019-12-27 17:32:49,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:49,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:32:49,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [484805733] [2019-12-27 17:32:49,675 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:49,682 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:49,698 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 79 transitions. [2019-12-27 17:32:49,698 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:49,701 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:32:49,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:32:49,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:49,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:32:49,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:32:49,702 INFO L87 Difference]: Start difference. First operand 17323 states and 52883 transitions. Second operand 7 states. [2019-12-27 17:32:50,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:50,618 INFO L93 Difference]: Finished difference Result 25126 states and 74494 transitions. [2019-12-27 17:32:50,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 17:32:50,619 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 17:32:50,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:50,657 INFO L225 Difference]: With dead ends: 25126 [2019-12-27 17:32:50,658 INFO L226 Difference]: Without dead ends: 25126 [2019-12-27 17:32:50,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-12-27 17:32:50,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25126 states. [2019-12-27 17:32:50,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25126 to 18107. [2019-12-27 17:32:50,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18107 states. [2019-12-27 17:32:50,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18107 states to 18107 states and 55159 transitions. [2019-12-27 17:32:50,957 INFO L78 Accepts]: Start accepts. Automaton has 18107 states and 55159 transitions. Word has length 33 [2019-12-27 17:32:50,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:50,958 INFO L462 AbstractCegarLoop]: Abstraction has 18107 states and 55159 transitions. [2019-12-27 17:32:50,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:32:50,958 INFO L276 IsEmpty]: Start isEmpty. Operand 18107 states and 55159 transitions. [2019-12-27 17:32:50,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 17:32:50,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:50,976 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] [2019-12-27 17:32:50,976 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:50,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:50,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1137221687, now seen corresponding path program 2 times [2019-12-27 17:32:50,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:50,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406742254] [2019-12-27 17:32:50,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:51,074 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-27 17:32:51,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406742254] [2019-12-27 17:32:51,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:51,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:32:51,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1122156154] [2019-12-27 17:32:51,075 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:51,080 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:51,095 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 52 states and 69 transitions. [2019-12-27 17:32:51,096 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:51,097 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:32:51,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:32:51,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:51,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:32:51,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:32:51,098 INFO L87 Difference]: Start difference. First operand 18107 states and 55159 transitions. Second operand 7 states. [2019-12-27 17:32:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:51,860 INFO L93 Difference]: Finished difference Result 24455 states and 73048 transitions. [2019-12-27 17:32:51,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 17:32:51,861 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 17:32:51,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:51,895 INFO L225 Difference]: With dead ends: 24455 [2019-12-27 17:32:51,895 INFO L226 Difference]: Without dead ends: 24455 [2019-12-27 17:32:51,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:32:51,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24455 states. [2019-12-27 17:32:52,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24455 to 18692. [2019-12-27 17:32:52,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18692 states. [2019-12-27 17:32:52,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18692 states to 18692 states and 56797 transitions. [2019-12-27 17:32:52,217 INFO L78 Accepts]: Start accepts. Automaton has 18692 states and 56797 transitions. Word has length 33 [2019-12-27 17:32:52,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:52,217 INFO L462 AbstractCegarLoop]: Abstraction has 18692 states and 56797 transitions. [2019-12-27 17:32:52,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:32:52,218 INFO L276 IsEmpty]: Start isEmpty. Operand 18692 states and 56797 transitions. [2019-12-27 17:32:52,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 17:32:52,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:52,240 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] [2019-12-27 17:32:52,241 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:52,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:52,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1933444630, now seen corresponding path program 1 times [2019-12-27 17:32:52,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:52,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230973664] [2019-12-27 17:32:52,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:52,310 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-27 17:32:52,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230973664] [2019-12-27 17:32:52,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:52,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:32:52,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [45099178] [2019-12-27 17:32:52,311 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:52,317 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:52,335 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 70 transitions. [2019-12-27 17:32:52,335 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:52,336 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:32:52,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:32:52,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:52,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:32:52,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:32:52,337 INFO L87 Difference]: Start difference. First operand 18692 states and 56797 transitions. Second operand 6 states. [2019-12-27 17:32:53,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:53,047 INFO L93 Difference]: Finished difference Result 23844 states and 71207 transitions. [2019-12-27 17:32:53,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 17:32:53,048 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-27 17:32:53,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:53,079 INFO L225 Difference]: With dead ends: 23844 [2019-12-27 17:32:53,080 INFO L226 Difference]: Without dead ends: 23844 [2019-12-27 17:32:53,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:32:53,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23844 states. [2019-12-27 17:32:53,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23844 to 15883. [2019-12-27 17:32:53,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15883 states. [2019-12-27 17:32:53,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15883 states to 15883 states and 48655 transitions. [2019-12-27 17:32:53,507 INFO L78 Accepts]: Start accepts. Automaton has 15883 states and 48655 transitions. Word has length 34 [2019-12-27 17:32:53,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:53,508 INFO L462 AbstractCegarLoop]: Abstraction has 15883 states and 48655 transitions. [2019-12-27 17:32:53,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:32:53,508 INFO L276 IsEmpty]: Start isEmpty. Operand 15883 states and 48655 transitions. [2019-12-27 17:32:53,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 17:32:53,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:53,523 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] [2019-12-27 17:32:53,524 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:53,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:53,524 INFO L82 PathProgramCache]: Analyzing trace with hash -390301387, now seen corresponding path program 1 times [2019-12-27 17:32:53,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:53,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51009894] [2019-12-27 17:32:53,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:53,580 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-27 17:32:53,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51009894] [2019-12-27 17:32:53,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:53,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:32:53,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1686962157] [2019-12-27 17:32:53,582 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:53,589 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:53,650 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 168 states and 336 transitions. [2019-12-27 17:32:53,650 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:53,724 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 17:32:53,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:32:53,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:53,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:32:53,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:32:53,725 INFO L87 Difference]: Start difference. First operand 15883 states and 48655 transitions. Second operand 6 states. [2019-12-27 17:32:54,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:54,050 INFO L93 Difference]: Finished difference Result 38132 states and 116365 transitions. [2019-12-27 17:32:54,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:32:54,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-27 17:32:54,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:54,087 INFO L225 Difference]: With dead ends: 38132 [2019-12-27 17:32:54,087 INFO L226 Difference]: Without dead ends: 24584 [2019-12-27 17:32:54,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:32:54,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24584 states. [2019-12-27 17:32:54,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24584 to 16169. [2019-12-27 17:32:54,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16169 states. [2019-12-27 17:32:54,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16169 states to 16169 states and 48293 transitions. [2019-12-27 17:32:54,370 INFO L78 Accepts]: Start accepts. Automaton has 16169 states and 48293 transitions. Word has length 39 [2019-12-27 17:32:54,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:54,371 INFO L462 AbstractCegarLoop]: Abstraction has 16169 states and 48293 transitions. [2019-12-27 17:32:54,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:32:54,371 INFO L276 IsEmpty]: Start isEmpty. Operand 16169 states and 48293 transitions. [2019-12-27 17:32:54,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 17:32:54,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:54,386 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] [2019-12-27 17:32:54,386 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:54,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:54,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1543157030, now seen corresponding path program 1 times [2019-12-27 17:32:54,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:54,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764272834] [2019-12-27 17:32:54,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:54,451 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-27 17:32:54,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764272834] [2019-12-27 17:32:54,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:54,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:32:54,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [936758674] [2019-12-27 17:32:54,452 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:54,463 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:54,520 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 265 transitions. [2019-12-27 17:32:54,520 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:54,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:32:54,784 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 17:32:54,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 17:32:54,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:54,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 17:32:54,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:32:54,785 INFO L87 Difference]: Start difference. First operand 16169 states and 48293 transitions. Second operand 12 states. [2019-12-27 17:32:55,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:55,849 INFO L93 Difference]: Finished difference Result 23749 states and 70281 transitions. [2019-12-27 17:32:55,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:32:55,850 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2019-12-27 17:32:55,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:55,882 INFO L225 Difference]: With dead ends: 23749 [2019-12-27 17:32:55,882 INFO L226 Difference]: Without dead ends: 23749 [2019-12-27 17:32:55,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:32:55,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23749 states. [2019-12-27 17:32:56,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23749 to 21864. [2019-12-27 17:32:56,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21864 states. [2019-12-27 17:32:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21864 states to 21864 states and 65238 transitions. [2019-12-27 17:32:56,212 INFO L78 Accepts]: Start accepts. Automaton has 21864 states and 65238 transitions. Word has length 40 [2019-12-27 17:32:56,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:56,212 INFO L462 AbstractCegarLoop]: Abstraction has 21864 states and 65238 transitions. [2019-12-27 17:32:56,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 17:32:56,212 INFO L276 IsEmpty]: Start isEmpty. Operand 21864 states and 65238 transitions. [2019-12-27 17:32:56,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 17:32:56,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:56,237 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] [2019-12-27 17:32:56,237 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:56,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:56,238 INFO L82 PathProgramCache]: Analyzing trace with hash 838743556, now seen corresponding path program 2 times [2019-12-27 17:32:56,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:56,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147023314] [2019-12-27 17:32:56,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:56,284 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-27 17:32:56,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147023314] [2019-12-27 17:32:56,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:56,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:32:56,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2128770369] [2019-12-27 17:32:56,285 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:56,293 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:56,365 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 201 states and 393 transitions. [2019-12-27 17:32:56,365 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:56,400 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 17:32:56,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:32:56,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:56,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:32:56,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:32:56,401 INFO L87 Difference]: Start difference. First operand 21864 states and 65238 transitions. Second operand 7 states. [2019-12-27 17:32:56,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:56,509 INFO L93 Difference]: Finished difference Result 20613 states and 62322 transitions. [2019-12-27 17:32:56,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:32:56,509 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 17:32:56,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:56,535 INFO L225 Difference]: With dead ends: 20613 [2019-12-27 17:32:56,536 INFO L226 Difference]: Without dead ends: 19054 [2019-12-27 17:32:56,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:32:56,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19054 states. [2019-12-27 17:32:56,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19054 to 18179. [2019-12-27 17:32:56,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18179 states. [2019-12-27 17:32:56,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18179 states to 18179 states and 56550 transitions. [2019-12-27 17:32:56,927 INFO L78 Accepts]: Start accepts. Automaton has 18179 states and 56550 transitions. Word has length 40 [2019-12-27 17:32:56,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:56,927 INFO L462 AbstractCegarLoop]: Abstraction has 18179 states and 56550 transitions. [2019-12-27 17:32:56,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:32:56,927 INFO L276 IsEmpty]: Start isEmpty. Operand 18179 states and 56550 transitions. [2019-12-27 17:32:56,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:32:56,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:56,953 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] [2019-12-27 17:32:56,953 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:56,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:56,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1449191354, now seen corresponding path program 1 times [2019-12-27 17:32:56,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:56,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870212873] [2019-12-27 17:32:56,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:57,001 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-27 17:32:57,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870212873] [2019-12-27 17:32:57,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:57,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:32:57,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [538881494] [2019-12-27 17:32:57,002 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:57,022 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:57,191 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 321 transitions. [2019-12-27 17:32:57,191 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:57,195 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:32:57,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:32:57,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:57,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:32:57,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:32:57,196 INFO L87 Difference]: Start difference. First operand 18179 states and 56550 transitions. Second operand 3 states. [2019-12-27 17:32:57,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:57,322 INFO L93 Difference]: Finished difference Result 24282 states and 72991 transitions. [2019-12-27 17:32:57,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:32:57,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 17:32:57,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:57,364 INFO L225 Difference]: With dead ends: 24282 [2019-12-27 17:32:57,364 INFO L226 Difference]: Without dead ends: 24282 [2019-12-27 17:32:57,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:32:57,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24282 states. [2019-12-27 17:32:57,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24282 to 18333. [2019-12-27 17:32:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18333 states. [2019-12-27 17:32:57,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18333 states to 18333 states and 55361 transitions. [2019-12-27 17:32:57,714 INFO L78 Accepts]: Start accepts. Automaton has 18333 states and 55361 transitions. Word has length 64 [2019-12-27 17:32:57,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:32:57,714 INFO L462 AbstractCegarLoop]: Abstraction has 18333 states and 55361 transitions. [2019-12-27 17:32:57,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:32:57,714 INFO L276 IsEmpty]: Start isEmpty. Operand 18333 states and 55361 transitions. [2019-12-27 17:32:57,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:32:57,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:32:57,737 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] [2019-12-27 17:32:57,737 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:32:57,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:32:57,737 INFO L82 PathProgramCache]: Analyzing trace with hash -237391966, now seen corresponding path program 1 times [2019-12-27 17:32:57,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:32:57,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273240299] [2019-12-27 17:32:57,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:32:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:32:57,856 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-27 17:32:57,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273240299] [2019-12-27 17:32:57,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:32:57,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:32:57,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1722732226] [2019-12-27 17:32:57,857 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:32:57,902 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:32:58,105 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 321 transitions. [2019-12-27 17:32:58,105 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:32:58,176 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 17:32:58,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:32:58,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:32:58,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:32:58,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:32:58,177 INFO L87 Difference]: Start difference. First operand 18333 states and 55361 transitions. Second operand 10 states. [2019-12-27 17:32:59,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:32:59,589 INFO L93 Difference]: Finished difference Result 76360 states and 229119 transitions. [2019-12-27 17:32:59,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 17:32:59,589 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 17:32:59,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:32:59,867 INFO L225 Difference]: With dead ends: 76360 [2019-12-27 17:32:59,867 INFO L226 Difference]: Without dead ends: 57160 [2019-12-27 17:32:59,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2019-12-27 17:32:59,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57160 states. [2019-12-27 17:33:00,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57160 to 20949. [2019-12-27 17:33:00,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20949 states. [2019-12-27 17:33:00,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20949 states to 20949 states and 63578 transitions. [2019-12-27 17:33:00,390 INFO L78 Accepts]: Start accepts. Automaton has 20949 states and 63578 transitions. Word has length 64 [2019-12-27 17:33:00,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:00,390 INFO L462 AbstractCegarLoop]: Abstraction has 20949 states and 63578 transitions. [2019-12-27 17:33:00,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:33:00,390 INFO L276 IsEmpty]: Start isEmpty. Operand 20949 states and 63578 transitions. [2019-12-27 17:33:00,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:33:00,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:00,413 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] [2019-12-27 17:33:00,414 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:33:00,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:00,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1797634292, now seen corresponding path program 2 times [2019-12-27 17:33:00,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:00,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380464684] [2019-12-27 17:33:00,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:00,499 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-27 17:33:00,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380464684] [2019-12-27 17:33:00,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:00,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:33:00,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1345204474] [2019-12-27 17:33:00,500 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:00,519 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:00,698 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 220 states and 379 transitions. [2019-12-27 17:33:00,698 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:00,879 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 17:33:00,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:33:00,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:00,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:33:00,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:33:00,880 INFO L87 Difference]: Start difference. First operand 20949 states and 63578 transitions. Second operand 14 states. [2019-12-27 17:33:03,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:03,801 INFO L93 Difference]: Finished difference Result 70757 states and 211502 transitions. [2019-12-27 17:33:03,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 17:33:03,801 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 64 [2019-12-27 17:33:03,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:03,877 INFO L225 Difference]: With dead ends: 70757 [2019-12-27 17:33:03,877 INFO L226 Difference]: Without dead ends: 51876 [2019-12-27 17:33:03,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2019-12-27 17:33:03,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51876 states. [2019-12-27 17:33:04,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51876 to 24268. [2019-12-27 17:33:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24268 states. [2019-12-27 17:33:04,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24268 states to 24268 states and 73074 transitions. [2019-12-27 17:33:04,614 INFO L78 Accepts]: Start accepts. Automaton has 24268 states and 73074 transitions. Word has length 64 [2019-12-27 17:33:04,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:04,615 INFO L462 AbstractCegarLoop]: Abstraction has 24268 states and 73074 transitions. [2019-12-27 17:33:04,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:33:04,615 INFO L276 IsEmpty]: Start isEmpty. Operand 24268 states and 73074 transitions. [2019-12-27 17:33:04,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:33:04,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:04,641 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] [2019-12-27 17:33:04,641 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:33:04,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:04,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1864819808, now seen corresponding path program 3 times [2019-12-27 17:33:04,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:04,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554223831] [2019-12-27 17:33:04,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:04,735 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-27 17:33:04,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554223831] [2019-12-27 17:33:04,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:04,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:33:04,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1545232516] [2019-12-27 17:33:04,737 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:04,755 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:04,884 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 326 transitions. [2019-12-27 17:33:04,884 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:05,097 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 27 times. [2019-12-27 17:33:05,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 17:33:05,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:05,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 17:33:05,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:33:05,099 INFO L87 Difference]: Start difference. First operand 24268 states and 73074 transitions. Second operand 13 states. [2019-12-27 17:33:08,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:08,276 INFO L93 Difference]: Finished difference Result 109490 states and 325608 transitions. [2019-12-27 17:33:08,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 17:33:08,277 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-27 17:33:08,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:08,440 INFO L225 Difference]: With dead ends: 109490 [2019-12-27 17:33:08,440 INFO L226 Difference]: Without dead ends: 105753 [2019-12-27 17:33:08,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 29 SyntacticMatches, 12 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=522, Invalid=2028, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 17:33:08,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105753 states. [2019-12-27 17:33:09,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105753 to 24335. [2019-12-27 17:33:09,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24335 states. [2019-12-27 17:33:09,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24335 states to 24335 states and 73406 transitions. [2019-12-27 17:33:09,651 INFO L78 Accepts]: Start accepts. Automaton has 24335 states and 73406 transitions. Word has length 64 [2019-12-27 17:33:09,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:09,651 INFO L462 AbstractCegarLoop]: Abstraction has 24335 states and 73406 transitions. [2019-12-27 17:33:09,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 17:33:09,651 INFO L276 IsEmpty]: Start isEmpty. Operand 24335 states and 73406 transitions. [2019-12-27 17:33:09,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:33:09,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:09,679 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] [2019-12-27 17:33:09,679 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:33:09,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:09,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1299608434, now seen corresponding path program 4 times [2019-12-27 17:33:09,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:09,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745051982] [2019-12-27 17:33:09,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:09,745 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-27 17:33:09,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745051982] [2019-12-27 17:33:09,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:09,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:33:09,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [988621866] [2019-12-27 17:33:09,746 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:09,764 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:09,990 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 207 states and 365 transitions. [2019-12-27 17:33:09,990 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:10,206 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 17:33:10,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 17:33:10,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:10,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 17:33:10,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:33:10,207 INFO L87 Difference]: Start difference. First operand 24335 states and 73406 transitions. Second operand 12 states. [2019-12-27 17:33:12,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:12,293 INFO L93 Difference]: Finished difference Result 70059 states and 206979 transitions. [2019-12-27 17:33:12,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 17:33:12,293 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-12-27 17:33:12,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:12,389 INFO L225 Difference]: With dead ends: 70059 [2019-12-27 17:33:12,389 INFO L226 Difference]: Without dead ends: 61423 [2019-12-27 17:33:12,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2019-12-27 17:33:12,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61423 states. [2019-12-27 17:33:13,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61423 to 24643. [2019-12-27 17:33:13,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24643 states. [2019-12-27 17:33:13,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24643 states to 24643 states and 74357 transitions. [2019-12-27 17:33:13,289 INFO L78 Accepts]: Start accepts. Automaton has 24643 states and 74357 transitions. Word has length 64 [2019-12-27 17:33:13,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:13,289 INFO L462 AbstractCegarLoop]: Abstraction has 24643 states and 74357 transitions. [2019-12-27 17:33:13,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 17:33:13,289 INFO L276 IsEmpty]: Start isEmpty. Operand 24643 states and 74357 transitions. [2019-12-27 17:33:13,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:33:13,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:13,318 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] [2019-12-27 17:33:13,318 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:33:13,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:13,319 INFO L82 PathProgramCache]: Analyzing trace with hash 2138548684, now seen corresponding path program 5 times [2019-12-27 17:33:13,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:13,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548218528] [2019-12-27 17:33:13,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:13,402 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-27 17:33:13,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548218528] [2019-12-27 17:33:13,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:13,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:33:13,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [408920606] [2019-12-27 17:33:13,404 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:13,423 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:13,738 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 252 states and 431 transitions. [2019-12-27 17:33:13,738 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:14,033 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 17:33:14,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 17:33:14,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:14,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 17:33:14,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:33:14,034 INFO L87 Difference]: Start difference. First operand 24643 states and 74357 transitions. Second operand 13 states. [2019-12-27 17:33:17,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:17,829 INFO L93 Difference]: Finished difference Result 97183 states and 289294 transitions. [2019-12-27 17:33:17,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 17:33:17,829 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-27 17:33:17,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:17,976 INFO L225 Difference]: With dead ends: 97183 [2019-12-27 17:33:17,976 INFO L226 Difference]: Without dead ends: 96930 [2019-12-27 17:33:17,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=350, Invalid=840, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 17:33:18,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96930 states. [2019-12-27 17:33:19,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96930 to 26453. [2019-12-27 17:33:19,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26453 states. [2019-12-27 17:33:19,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26453 states to 26453 states and 80130 transitions. [2019-12-27 17:33:19,195 INFO L78 Accepts]: Start accepts. Automaton has 26453 states and 80130 transitions. Word has length 64 [2019-12-27 17:33:19,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:19,196 INFO L462 AbstractCegarLoop]: Abstraction has 26453 states and 80130 transitions. [2019-12-27 17:33:19,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 17:33:19,196 INFO L276 IsEmpty]: Start isEmpty. Operand 26453 states and 80130 transitions. [2019-12-27 17:33:19,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:33:19,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:19,225 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] [2019-12-27 17:33:19,225 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:33:19,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:19,226 INFO L82 PathProgramCache]: Analyzing trace with hash -203791434, now seen corresponding path program 6 times [2019-12-27 17:33:19,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:19,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018123522] [2019-12-27 17:33:19,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:19,294 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-27 17:33:19,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018123522] [2019-12-27 17:33:19,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:19,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:33:19,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2018867950] [2019-12-27 17:33:19,295 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:19,313 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:19,559 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 236 states and 388 transitions. [2019-12-27 17:33:19,559 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:19,564 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:33:19,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:33:19,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:19,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:33:19,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:33:19,566 INFO L87 Difference]: Start difference. First operand 26453 states and 80130 transitions. Second operand 5 states. [2019-12-27 17:33:19,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:19,916 INFO L93 Difference]: Finished difference Result 28478 states and 85832 transitions. [2019-12-27 17:33:19,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:33:19,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-27 17:33:19,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:19,956 INFO L225 Difference]: With dead ends: 28478 [2019-12-27 17:33:19,956 INFO L226 Difference]: Without dead ends: 28478 [2019-12-27 17:33:19,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:33:20,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28478 states. [2019-12-27 17:33:20,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28478 to 26881. [2019-12-27 17:33:20,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26881 states. [2019-12-27 17:33:20,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26881 states to 26881 states and 81458 transitions. [2019-12-27 17:33:20,380 INFO L78 Accepts]: Start accepts. Automaton has 26881 states and 81458 transitions. Word has length 64 [2019-12-27 17:33:20,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:20,380 INFO L462 AbstractCegarLoop]: Abstraction has 26881 states and 81458 transitions. [2019-12-27 17:33:20,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:33:20,380 INFO L276 IsEmpty]: Start isEmpty. Operand 26881 states and 81458 transitions. [2019-12-27 17:33:20,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:33:20,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:20,408 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] [2019-12-27 17:33:20,408 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:33:20,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:20,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1288865556, now seen corresponding path program 7 times [2019-12-27 17:33:20,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:20,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245454078] [2019-12-27 17:33:20,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:20,524 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-27 17:33:20,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245454078] [2019-12-27 17:33:20,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:20,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:33:20,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [545377022] [2019-12-27 17:33:20,525 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:20,543 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:20,758 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 256 states and 439 transitions. [2019-12-27 17:33:20,758 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:21,301 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 17:33:21,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 17:33:21,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:21,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 17:33:21,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-12-27 17:33:21,302 INFO L87 Difference]: Start difference. First operand 26881 states and 81458 transitions. Second operand 15 states. [2019-12-27 17:33:29,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:29,769 INFO L93 Difference]: Finished difference Result 107746 states and 317176 transitions. [2019-12-27 17:33:29,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-12-27 17:33:29,770 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 64 [2019-12-27 17:33:29,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:29,938 INFO L225 Difference]: With dead ends: 107746 [2019-12-27 17:33:29,938 INFO L226 Difference]: Without dead ends: 107450 [2019-12-27 17:33:29,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2606 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1402, Invalid=6254, Unknown=0, NotChecked=0, Total=7656 [2019-12-27 17:33:30,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107450 states. [2019-12-27 17:33:31,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107450 to 27201. [2019-12-27 17:33:31,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27201 states. [2019-12-27 17:33:31,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27201 states to 27201 states and 82465 transitions. [2019-12-27 17:33:31,308 INFO L78 Accepts]: Start accepts. Automaton has 27201 states and 82465 transitions. Word has length 64 [2019-12-27 17:33:31,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:31,308 INFO L462 AbstractCegarLoop]: Abstraction has 27201 states and 82465 transitions. [2019-12-27 17:33:31,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 17:33:31,309 INFO L276 IsEmpty]: Start isEmpty. Operand 27201 states and 82465 transitions. [2019-12-27 17:33:31,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:33:31,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:31,341 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] [2019-12-27 17:33:31,341 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:33:31,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:31,341 INFO L82 PathProgramCache]: Analyzing trace with hash 2115336524, now seen corresponding path program 8 times [2019-12-27 17:33:31,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:31,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953436863] [2019-12-27 17:33:31,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:31,448 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-27 17:33:31,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953436863] [2019-12-27 17:33:31,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:31,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:33:31,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1439224810] [2019-12-27 17:33:31,449 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:31,467 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:31,746 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 255 states and 431 transitions. [2019-12-27 17:33:31,746 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:31,827 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 17:33:31,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:33:31,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:31,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:33:31,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:33:31,828 INFO L87 Difference]: Start difference. First operand 27201 states and 82465 transitions. Second operand 10 states. [2019-12-27 17:33:34,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:34,268 INFO L93 Difference]: Finished difference Result 65221 states and 199589 transitions. [2019-12-27 17:33:34,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 17:33:34,268 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 17:33:34,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:34,369 INFO L225 Difference]: With dead ends: 65221 [2019-12-27 17:33:34,369 INFO L226 Difference]: Without dead ends: 65221 [2019-12-27 17:33:34,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 24 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=218, Invalid=712, Unknown=0, NotChecked=0, Total=930 [2019-12-27 17:33:34,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65221 states. [2019-12-27 17:33:35,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65221 to 26998. [2019-12-27 17:33:35,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26998 states. [2019-12-27 17:33:35,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26998 states to 26998 states and 81886 transitions. [2019-12-27 17:33:35,420 INFO L78 Accepts]: Start accepts. Automaton has 26998 states and 81886 transitions. Word has length 64 [2019-12-27 17:33:35,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:35,420 INFO L462 AbstractCegarLoop]: Abstraction has 26998 states and 81886 transitions. [2019-12-27 17:33:35,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:33:35,420 INFO L276 IsEmpty]: Start isEmpty. Operand 26998 states and 81886 transitions. [2019-12-27 17:33:35,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:33:35,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:35,451 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] [2019-12-27 17:33:35,451 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:33:35,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:35,452 INFO L82 PathProgramCache]: Analyzing trace with hash 576481680, now seen corresponding path program 9 times [2019-12-27 17:33:35,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:35,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975975975] [2019-12-27 17:33:35,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:35,528 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-27 17:33:35,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975975975] [2019-12-27 17:33:35,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:35,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:33:35,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [782495371] [2019-12-27 17:33:35,529 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:35,545 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:35,799 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 251 states and 419 transitions. [2019-12-27 17:33:35,799 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:35,856 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 17:33:35,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:33:35,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:35,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:33:35,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:33:35,857 INFO L87 Difference]: Start difference. First operand 26998 states and 81886 transitions. Second operand 7 states. [2019-12-27 17:33:36,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:36,936 INFO L93 Difference]: Finished difference Result 48095 states and 144124 transitions. [2019-12-27 17:33:36,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 17:33:36,936 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 17:33:36,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:37,004 INFO L225 Difference]: With dead ends: 48095 [2019-12-27 17:33:37,004 INFO L226 Difference]: Without dead ends: 47875 [2019-12-27 17:33:37,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:33:37,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47875 states. [2019-12-27 17:33:37,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47875 to 32207. [2019-12-27 17:33:37,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32207 states. [2019-12-27 17:33:37,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32207 states to 32207 states and 96935 transitions. [2019-12-27 17:33:37,602 INFO L78 Accepts]: Start accepts. Automaton has 32207 states and 96935 transitions. Word has length 64 [2019-12-27 17:33:37,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:37,602 INFO L462 AbstractCegarLoop]: Abstraction has 32207 states and 96935 transitions. [2019-12-27 17:33:37,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:33:37,602 INFO L276 IsEmpty]: Start isEmpty. Operand 32207 states and 96935 transitions. [2019-12-27 17:33:37,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:33:37,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:37,636 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] [2019-12-27 17:33:37,636 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:33:37,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:37,637 INFO L82 PathProgramCache]: Analyzing trace with hash 883747876, now seen corresponding path program 10 times [2019-12-27 17:33:37,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:37,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099328947] [2019-12-27 17:33:37,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:37,733 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-27 17:33:37,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099328947] [2019-12-27 17:33:37,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:37,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:33:37,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1848108884] [2019-12-27 17:33:37,734 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:37,749 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:37,987 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 272 states and 467 transitions. [2019-12-27 17:33:37,987 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:38,061 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 17:33:38,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:33:38,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:38,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:33:38,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:33:38,062 INFO L87 Difference]: Start difference. First operand 32207 states and 96935 transitions. Second operand 9 states. [2019-12-27 17:33:39,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:39,505 INFO L93 Difference]: Finished difference Result 47769 states and 143276 transitions. [2019-12-27 17:33:39,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 17:33:39,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 17:33:39,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:39,567 INFO L225 Difference]: With dead ends: 47769 [2019-12-27 17:33:39,567 INFO L226 Difference]: Without dead ends: 47769 [2019-12-27 17:33:39,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:33:39,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47769 states. [2019-12-27 17:33:40,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47769 to 29924. [2019-12-27 17:33:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29924 states. [2019-12-27 17:33:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29924 states to 29924 states and 90430 transitions. [2019-12-27 17:33:40,121 INFO L78 Accepts]: Start accepts. Automaton has 29924 states and 90430 transitions. Word has length 64 [2019-12-27 17:33:40,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:40,122 INFO L462 AbstractCegarLoop]: Abstraction has 29924 states and 90430 transitions. [2019-12-27 17:33:40,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:33:40,122 INFO L276 IsEmpty]: Start isEmpty. Operand 29924 states and 90430 transitions. [2019-12-27 17:33:40,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:33:40,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:40,156 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] [2019-12-27 17:33:40,156 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:33:40,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:40,157 INFO L82 PathProgramCache]: Analyzing trace with hash 81413226, now seen corresponding path program 11 times [2019-12-27 17:33:40,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:40,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015021840] [2019-12-27 17:33:40,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:40,260 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-27 17:33:40,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015021840] [2019-12-27 17:33:40,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:40,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:33:40,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [307282613] [2019-12-27 17:33:40,261 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:40,276 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:40,585 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 245 states and 407 transitions. [2019-12-27 17:33:40,586 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:40,734 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 17:33:40,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 17:33:40,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:40,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 17:33:40,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:33:40,735 INFO L87 Difference]: Start difference. First operand 29924 states and 90430 transitions. Second operand 11 states. [2019-12-27 17:33:44,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:44,095 INFO L93 Difference]: Finished difference Result 69532 states and 211960 transitions. [2019-12-27 17:33:44,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 17:33:44,095 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 17:33:44,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:44,197 INFO L225 Difference]: With dead ends: 69532 [2019-12-27 17:33:44,197 INFO L226 Difference]: Without dead ends: 69532 [2019-12-27 17:33:44,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 29 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=285, Invalid=1121, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 17:33:44,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69532 states. [2019-12-27 17:33:45,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69532 to 30233. [2019-12-27 17:33:45,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30233 states. [2019-12-27 17:33:45,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30233 states to 30233 states and 91343 transitions. [2019-12-27 17:33:45,173 INFO L78 Accepts]: Start accepts. Automaton has 30233 states and 91343 transitions. Word has length 64 [2019-12-27 17:33:45,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:45,173 INFO L462 AbstractCegarLoop]: Abstraction has 30233 states and 91343 transitions. [2019-12-27 17:33:45,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 17:33:45,173 INFO L276 IsEmpty]: Start isEmpty. Operand 30233 states and 91343 transitions. [2019-12-27 17:33:45,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:33:45,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:45,207 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] [2019-12-27 17:33:45,207 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:33:45,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:45,208 INFO L82 PathProgramCache]: Analyzing trace with hash 871311026, now seen corresponding path program 12 times [2019-12-27 17:33:45,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:45,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657319833] [2019-12-27 17:33:45,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:45,304 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-27 17:33:45,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657319833] [2019-12-27 17:33:45,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:45,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:33:45,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1838460268] [2019-12-27 17:33:45,305 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:45,317 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:45,636 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 264 states and 430 transitions. [2019-12-27 17:33:45,636 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:45,719 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 17:33:45,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:33:45,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:45,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:33:45,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:33:45,720 INFO L87 Difference]: Start difference. First operand 30233 states and 91343 transitions. Second operand 8 states. [2019-12-27 17:33:46,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:46,938 INFO L93 Difference]: Finished difference Result 49682 states and 148654 transitions. [2019-12-27 17:33:46,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 17:33:46,939 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 17:33:46,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:47,006 INFO L225 Difference]: With dead ends: 49682 [2019-12-27 17:33:47,007 INFO L226 Difference]: Without dead ends: 49430 [2019-12-27 17:33:47,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-12-27 17:33:47,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49430 states. [2019-12-27 17:33:47,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49430 to 32265. [2019-12-27 17:33:47,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32265 states. [2019-12-27 17:33:47,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32265 states to 32265 states and 97114 transitions. [2019-12-27 17:33:47,620 INFO L78 Accepts]: Start accepts. Automaton has 32265 states and 97114 transitions. Word has length 64 [2019-12-27 17:33:47,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:47,620 INFO L462 AbstractCegarLoop]: Abstraction has 32265 states and 97114 transitions. [2019-12-27 17:33:47,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:33:47,620 INFO L276 IsEmpty]: Start isEmpty. Operand 32265 states and 97114 transitions. [2019-12-27 17:33:47,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:33:47,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:47,655 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] [2019-12-27 17:33:47,655 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:33:47,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:47,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1291874674, now seen corresponding path program 13 times [2019-12-27 17:33:47,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:47,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208981771] [2019-12-27 17:33:47,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:47,717 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-27 17:33:47,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208981771] [2019-12-27 17:33:47,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:47,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:33:47,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [35158258] [2019-12-27 17:33:47,718 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:47,730 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:48,049 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 256 states and 435 transitions. [2019-12-27 17:33:48,049 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:48,050 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:33:48,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:33:48,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:48,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:33:48,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:33:48,051 INFO L87 Difference]: Start difference. First operand 32265 states and 97114 transitions. Second operand 3 states. [2019-12-27 17:33:48,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:48,249 INFO L93 Difference]: Finished difference Result 32265 states and 97113 transitions. [2019-12-27 17:33:48,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:33:48,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 17:33:48,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:48,330 INFO L225 Difference]: With dead ends: 32265 [2019-12-27 17:33:48,330 INFO L226 Difference]: Without dead ends: 32265 [2019-12-27 17:33:48,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:33:48,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32265 states. [2019-12-27 17:33:48,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32265 to 27300. [2019-12-27 17:33:48,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27300 states. [2019-12-27 17:33:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27300 states to 27300 states and 82941 transitions. [2019-12-27 17:33:49,026 INFO L78 Accepts]: Start accepts. Automaton has 27300 states and 82941 transitions. Word has length 64 [2019-12-27 17:33:49,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:49,027 INFO L462 AbstractCegarLoop]: Abstraction has 27300 states and 82941 transitions. [2019-12-27 17:33:49,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:33:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 27300 states and 82941 transitions. [2019-12-27 17:33:49,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:33:49,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:49,061 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] [2019-12-27 17:33:49,061 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:33:49,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:49,061 INFO L82 PathProgramCache]: Analyzing trace with hash 112305005, now seen corresponding path program 1 times [2019-12-27 17:33:49,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:49,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134289183] [2019-12-27 17:33:49,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:49,126 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-27 17:33:49,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134289183] [2019-12-27 17:33:49,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:49,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:33:49,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [143050298] [2019-12-27 17:33:49,127 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:49,139 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:49,363 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 257 states and 426 transitions. [2019-12-27 17:33:49,363 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:49,364 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:33:49,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:33:49,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:49,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:33:49,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:33:49,364 INFO L87 Difference]: Start difference. First operand 27300 states and 82941 transitions. Second operand 3 states. [2019-12-27 17:33:49,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:33:49,432 INFO L93 Difference]: Finished difference Result 20952 states and 62781 transitions. [2019-12-27 17:33:49,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:33:49,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 17:33:49,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:33:49,462 INFO L225 Difference]: With dead ends: 20952 [2019-12-27 17:33:49,462 INFO L226 Difference]: Without dead ends: 20952 [2019-12-27 17:33:49,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:33:49,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20952 states. [2019-12-27 17:33:49,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20952 to 20006. [2019-12-27 17:33:49,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20006 states. [2019-12-27 17:33:49,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20006 states to 20006 states and 59877 transitions. [2019-12-27 17:33:49,751 INFO L78 Accepts]: Start accepts. Automaton has 20006 states and 59877 transitions. Word has length 65 [2019-12-27 17:33:49,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:33:49,751 INFO L462 AbstractCegarLoop]: Abstraction has 20006 states and 59877 transitions. [2019-12-27 17:33:49,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:33:49,751 INFO L276 IsEmpty]: Start isEmpty. Operand 20006 states and 59877 transitions. [2019-12-27 17:33:49,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:33:49,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:33:49,772 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] [2019-12-27 17:33:49,772 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:33:49,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:33:49,773 INFO L82 PathProgramCache]: Analyzing trace with hash -424379593, now seen corresponding path program 1 times [2019-12-27 17:33:49,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:33:49,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233770324] [2019-12-27 17:33:49,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:33:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:33:50,344 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-27 17:33:50,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233770324] [2019-12-27 17:33:50,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:33:50,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 17:33:50,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1334457058] [2019-12-27 17:33:50,345 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:33:50,359 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:33:50,544 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 323 transitions. [2019-12-27 17:33:50,544 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:33:51,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:33:51,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 17:33:51,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:33:51,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:33:52,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:33:52,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:33:52,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:33:52,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 17:33:52,533 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 35 times. [2019-12-27 17:33:52,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-27 17:33:52,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:33:52,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-27 17:33:52,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=881, Unknown=0, NotChecked=0, Total=992 [2019-12-27 17:33:52,535 INFO L87 Difference]: Start difference. First operand 20006 states and 59877 transitions. Second operand 32 states. [2019-12-27 17:34:06,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:34:06,101 INFO L93 Difference]: Finished difference Result 36237 states and 107044 transitions. [2019-12-27 17:34:06,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-27 17:34:06,101 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2019-12-27 17:34:06,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:34:06,142 INFO L225 Difference]: With dead ends: 36237 [2019-12-27 17:34:06,143 INFO L226 Difference]: Without dead ends: 28992 [2019-12-27 17:34:06,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 13 SyntacticMatches, 13 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1297 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=760, Invalid=4210, Unknown=0, NotChecked=0, Total=4970 [2019-12-27 17:34:06,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28992 states. [2019-12-27 17:34:06,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28992 to 21019. [2019-12-27 17:34:06,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21019 states. [2019-12-27 17:34:06,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21019 states to 21019 states and 62458 transitions. [2019-12-27 17:34:06,485 INFO L78 Accepts]: Start accepts. Automaton has 21019 states and 62458 transitions. Word has length 66 [2019-12-27 17:34:06,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:34:06,485 INFO L462 AbstractCegarLoop]: Abstraction has 21019 states and 62458 transitions. [2019-12-27 17:34:06,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-27 17:34:06,485 INFO L276 IsEmpty]: Start isEmpty. Operand 21019 states and 62458 transitions. [2019-12-27 17:34:06,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:34:06,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:34:06,505 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] [2019-12-27 17:34:06,505 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:34:06,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:34:06,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1994121475, now seen corresponding path program 2 times [2019-12-27 17:34:06,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:34:06,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10297303] [2019-12-27 17:34:06,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:34:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:34:07,024 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-27 17:34:07,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10297303] [2019-12-27 17:34:07,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:34:07,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 17:34:07,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1405702027] [2019-12-27 17:34:07,025 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:34:07,036 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:34:07,329 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 224 states and 388 transitions. [2019-12-27 17:34:07,330 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:34:08,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:34:08,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 17:34:08,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:34:08,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:34:08,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:34:08,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:34:08,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:34:09,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 17:34:09,164 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 40 times. [2019-12-27 17:34:09,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-27 17:34:09,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:34:09,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-27 17:34:09,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1184, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 17:34:09,166 INFO L87 Difference]: Start difference. First operand 21019 states and 62458 transitions. Second operand 37 states. [2019-12-27 17:34:29,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:34:29,765 INFO L93 Difference]: Finished difference Result 56100 states and 166127 transitions. [2019-12-27 17:34:29,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-12-27 17:34:29,765 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 66 [2019-12-27 17:34:29,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:34:29,827 INFO L225 Difference]: With dead ends: 56100 [2019-12-27 17:34:29,827 INFO L226 Difference]: Without dead ends: 44082 [2019-12-27 17:34:29,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 13 SyntacticMatches, 13 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3000 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1523, Invalid=9189, Unknown=0, NotChecked=0, Total=10712 [2019-12-27 17:34:29,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44082 states. [2019-12-27 17:34:30,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44082 to 24956. [2019-12-27 17:34:30,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24956 states. [2019-12-27 17:34:30,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24956 states to 24956 states and 74254 transitions. [2019-12-27 17:34:30,335 INFO L78 Accepts]: Start accepts. Automaton has 24956 states and 74254 transitions. Word has length 66 [2019-12-27 17:34:30,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:34:30,335 INFO L462 AbstractCegarLoop]: Abstraction has 24956 states and 74254 transitions. [2019-12-27 17:34:30,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-27 17:34:30,335 INFO L276 IsEmpty]: Start isEmpty. Operand 24956 states and 74254 transitions. [2019-12-27 17:34:30,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:34:30,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:34:30,364 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] [2019-12-27 17:34:30,364 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:34:30,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:34:30,364 INFO L82 PathProgramCache]: Analyzing trace with hash -417477977, now seen corresponding path program 3 times [2019-12-27 17:34:30,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:34:30,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364856736] [2019-12-27 17:34:30,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:34:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:34:30,722 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-27 17:34:30,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364856736] [2019-12-27 17:34:30,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:34:30,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 17:34:30,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [7187050] [2019-12-27 17:34:30,723 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:34:30,733 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:34:30,909 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 227 states and 391 transitions. [2019-12-27 17:34:30,909 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:34:31,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:34:31,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 17:34:31,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:34:32,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:34:32,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:34:32,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:34:32,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 17:34:32,539 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 33 times. [2019-12-27 17:34:32,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-27 17:34:32,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:34:32,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-27 17:34:32,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2019-12-27 17:34:32,540 INFO L87 Difference]: Start difference. First operand 24956 states and 74254 transitions. Second operand 32 states. [2019-12-27 17:34:53,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:34:53,837 INFO L93 Difference]: Finished difference Result 81576 states and 239839 transitions. [2019-12-27 17:34:53,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-12-27 17:34:53,838 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2019-12-27 17:34:53,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:34:53,933 INFO L225 Difference]: With dead ends: 81576 [2019-12-27 17:34:53,934 INFO L226 Difference]: Without dead ends: 65749 [2019-12-27 17:34:53,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 10 SyntacticMatches, 12 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4198 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=2160, Invalid=12602, Unknown=0, NotChecked=0, Total=14762 [2019-12-27 17:34:54,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65749 states. [2019-12-27 17:34:54,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65749 to 24673. [2019-12-27 17:34:54,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24673 states. [2019-12-27 17:34:54,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24673 states to 24673 states and 73509 transitions. [2019-12-27 17:34:54,595 INFO L78 Accepts]: Start accepts. Automaton has 24673 states and 73509 transitions. Word has length 66 [2019-12-27 17:34:54,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:34:54,596 INFO L462 AbstractCegarLoop]: Abstraction has 24673 states and 73509 transitions. [2019-12-27 17:34:54,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-27 17:34:54,596 INFO L276 IsEmpty]: Start isEmpty. Operand 24673 states and 73509 transitions. [2019-12-27 17:34:54,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:34:54,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:34:54,625 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] [2019-12-27 17:34:54,625 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:34:54,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:34:54,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1061754861, now seen corresponding path program 4 times [2019-12-27 17:34:54,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:34:54,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767610169] [2019-12-27 17:34:54,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:34:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:34:55,129 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-27 17:34:55,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767610169] [2019-12-27 17:34:55,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:34:55,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 17:34:55,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1390226778] [2019-12-27 17:34:55,129 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:34:55,140 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:34:55,313 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 224 states and 411 transitions. [2019-12-27 17:34:55,313 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:34:56,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:34:56,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 17:34:56,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:34:56,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:34:56,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:34:56,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 17:34:56,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 17:34:57,033 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 44 times. [2019-12-27 17:34:57,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-27 17:34:57,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:34:57,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-27 17:34:57,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1005, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 17:34:57,035 INFO L87 Difference]: Start difference. First operand 24673 states and 73509 transitions. Second operand 34 states. [2019-12-27 17:34:59,106 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-12-27 17:35:00,354 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-12-27 17:35:00,631 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-12-27 17:35:15,274 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-12-27 17:35:24,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:35:24,259 INFO L93 Difference]: Finished difference Result 73942 states and 216030 transitions. [2019-12-27 17:35:24,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2019-12-27 17:35:24,260 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-12-27 17:35:24,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:35:24,352 INFO L225 Difference]: With dead ends: 73942 [2019-12-27 17:35:24,352 INFO L226 Difference]: Without dead ends: 70745 [2019-12-27 17:35:24,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 15 SyntacticMatches, 16 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6620 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=2651, Invalid=18229, Unknown=0, NotChecked=0, Total=20880 [2019-12-27 17:35:24,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70745 states. [2019-12-27 17:35:25,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70745 to 24883. [2019-12-27 17:35:25,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24883 states. [2019-12-27 17:35:25,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24883 states to 24883 states and 74016 transitions. [2019-12-27 17:35:25,091 INFO L78 Accepts]: Start accepts. Automaton has 24883 states and 74016 transitions. Word has length 66 [2019-12-27 17:35:25,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:35:25,092 INFO L462 AbstractCegarLoop]: Abstraction has 24883 states and 74016 transitions. [2019-12-27 17:35:25,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-27 17:35:25,092 INFO L276 IsEmpty]: Start isEmpty. Operand 24883 states and 74016 transitions. [2019-12-27 17:35:25,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:35:25,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:35:25,120 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] [2019-12-27 17:35:25,120 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:35:25,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:35:25,120 INFO L82 PathProgramCache]: Analyzing trace with hash -102693605, now seen corresponding path program 5 times [2019-12-27 17:35:25,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:35:25,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069328061] [2019-12-27 17:35:25,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:35:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:35:25,228 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-27 17:35:25,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069328061] [2019-12-27 17:35:25,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:35:25,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:35:25,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1527611997] [2019-12-27 17:35:25,229 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:35:25,242 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:35:25,399 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 213 states and 379 transitions. [2019-12-27 17:35:25,400 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:35:25,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:35:25,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:35:25,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:35:25,795 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 17:35:25,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 17:35:25,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:35:25,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 17:35:25,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-27 17:35:25,796 INFO L87 Difference]: Start difference. First operand 24883 states and 74016 transitions. Second operand 16 states. Received shutdown request... [2019-12-27 17:35:28,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 17:35:28,193 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 17:35:28,198 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 17:35:28,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:35:28 BasicIcfg [2019-12-27 17:35:28,199 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:35:28,200 INFO L168 Benchmark]: Toolchain (without parser) took 226521.08 ms. Allocated memory was 147.8 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 104.2 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 693.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:35:28,201 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 147.8 MB. Free memory was 124.2 MB in the beginning and 123.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 17:35:28,201 INFO L168 Benchmark]: CACSL2BoogieTranslator took 822.28 ms. Allocated memory was 147.8 MB in the beginning and 205.0 MB in the end (delta: 57.1 MB). Free memory was 103.9 MB in the beginning and 158.9 MB in the end (delta: -55.0 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-27 17:35:28,202 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.68 ms. Allocated memory is still 205.0 MB. Free memory was 158.9 MB in the beginning and 155.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:35:28,202 INFO L168 Benchmark]: Boogie Preprocessor took 39.23 ms. Allocated memory is still 205.0 MB. Free memory was 155.8 MB in the beginning and 153.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:35:28,202 INFO L168 Benchmark]: RCFGBuilder took 1038.54 ms. Allocated memory is still 205.0 MB. Free memory was 153.3 MB in the beginning and 103.8 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-27 17:35:28,203 INFO L168 Benchmark]: TraceAbstraction took 224549.97 ms. Allocated memory was 205.0 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 103.8 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 636.4 MB. Max. memory is 7.1 GB. [2019-12-27 17:35:28,205 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 147.8 MB. Free memory was 124.2 MB in the beginning and 123.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 822.28 ms. Allocated memory was 147.8 MB in the beginning and 205.0 MB in the end (delta: 57.1 MB). Free memory was 103.9 MB in the beginning and 158.9 MB in the end (delta: -55.0 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.68 ms. Allocated memory is still 205.0 MB. Free memory was 158.9 MB in the beginning and 155.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.23 ms. Allocated memory is still 205.0 MB. Free memory was 155.8 MB in the beginning and 153.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1038.54 ms. Allocated memory is still 205.0 MB. Free memory was 153.3 MB in the beginning and 103.8 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 224549.97 ms. Allocated memory was 205.0 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 103.8 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 636.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 174 ProgramPointsBefore, 92 ProgramPointsAfterwards, 211 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 6843 VarBasedMoverChecksPositive, 273 VarBasedMoverChecksNegative, 91 SemBasedMoverChecksPositive, 240 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 77200 CheckedPairsTotal, 114 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (24883states) and FLOYD_HOARE automaton (currently 15 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (13110 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 4). Cancelled while BasicCegarLoop was constructing difference of abstraction (24883states) and FLOYD_HOARE automaton (currently 15 states, 16 states before enhancement),while ReachableStatesComputation was computing reachable states (13110 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: TIMEOUT, OverallTime: 224.3s, OverallIterations: 37, TraceHistogramMax: 1, AutomataDifference: 137.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10961 SDtfs, 22519 SDslu, 50934 SDs, 0 SdLazy, 66662 SolverSat, 1653 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 83.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1387 GetRequests, 345 SyntacticMatches, 144 SemanticMatches, 898 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19862 ImplicationChecksByTransitivity, 34.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138429occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 45.2s AutomataMinimizationTime, 36 MinimizatonAttempts, 694886 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1709 NumberOfCodeBlocks, 1709 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1672 ConstructedInterpolants, 0 QuantifiedInterpolants, 375406 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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 could not prove your program: Timeout Completed graceful shutdown