/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-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:50:40,086 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:50:40,088 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:50:40,100 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:50:40,101 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:50:40,102 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:50:40,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:50:40,105 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:50:40,106 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:50:40,107 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:50:40,108 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:50:40,109 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:50:40,110 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:50:40,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:50:40,111 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:50:40,112 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:50:40,113 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:50:40,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:50:40,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:50:40,118 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:50:40,119 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:50:40,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:50:40,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:50:40,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:50:40,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:50:40,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:50:40,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:50:40,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:50:40,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:50:40,127 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:50:40,127 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:50:40,128 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:50:40,129 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:50:40,130 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:50:40,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:50:40,131 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:50:40,131 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:50:40,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:50:40,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:50:40,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:50:40,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:50:40,134 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-VariableLbe-MCR.epf [2019-12-27 21:50:40,150 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:50:40,152 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:50:40,153 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:50:40,153 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:50:40,153 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:50:40,154 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:50:40,154 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:50:40,154 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:50:40,155 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:50:40,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:50:40,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:50:40,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:50:40,156 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:50:40,157 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:50:40,157 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:50:40,157 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:50:40,157 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:50:40,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:50:40,158 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:50:40,158 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:50:40,158 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:50:40,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:50:40,159 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:50:40,159 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:50:40,159 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:50:40,159 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:50:40,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:50:40,160 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:50:40,160 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:50:40,160 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:50:40,161 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:50:40,161 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:50:40,434 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:50:40,449 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:50:40,452 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:50:40,454 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:50:40,455 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:50:40,455 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_pso.oepc.i [2019-12-27 21:50:40,527 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc13c27b9/0b5d24cb86ad416d80f61db6ea1b24ab/FLAGe7b06438c [2019-12-27 21:50:41,131 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:50:41,133 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_pso.oepc.i [2019-12-27 21:50:41,153 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc13c27b9/0b5d24cb86ad416d80f61db6ea1b24ab/FLAGe7b06438c [2019-12-27 21:50:41,348 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc13c27b9/0b5d24cb86ad416d80f61db6ea1b24ab [2019-12-27 21:50:41,359 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:50:41,361 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:50:41,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:50:41,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:50:41,368 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:50:41,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:50:41" (1/1) ... [2019-12-27 21:50:41,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b8a5782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:41, skipping insertion in model container [2019-12-27 21:50:41,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:50:41" (1/1) ... [2019-12-27 21:50:41,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:50:41,434 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:50:42,028 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:50:42,044 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:50:42,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:50:42,184 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:50:42,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:42 WrapperNode [2019-12-27 21:50:42,185 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:50:42,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:50:42,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:50:42,186 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:50:42,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:42" (1/1) ... [2019-12-27 21:50:42,222 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:42" (1/1) ... [2019-12-27 21:50:42,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:50:42,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:50:42,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:50:42,266 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:50:42,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:42" (1/1) ... [2019-12-27 21:50:42,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:42" (1/1) ... [2019-12-27 21:50:42,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:42" (1/1) ... [2019-12-27 21:50:42,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:42" (1/1) ... [2019-12-27 21:50:42,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:42" (1/1) ... [2019-12-27 21:50:42,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:42" (1/1) ... [2019-12-27 21:50:42,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:42" (1/1) ... [2019-12-27 21:50:42,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:50:42,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:50:42,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:50:42,316 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:50:42,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50: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 21:50:42,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:50:42,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:50:42,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:50:42,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:50:42,419 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:50:42,421 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:50:42,421 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:50:42,422 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:50:42,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:50:42,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:50:42,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:50:42,426 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 21:50:43,591 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:50:43,591 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:50:43,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:50:43 BoogieIcfgContainer [2019-12-27 21:50:43,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:50:43,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:50:43,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:50:43,600 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:50:43,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:50:41" (1/3) ... [2019-12-27 21:50:43,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60307ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:50:43, skipping insertion in model container [2019-12-27 21:50:43,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:42" (2/3) ... [2019-12-27 21:50:43,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60307ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:50:43, skipping insertion in model container [2019-12-27 21:50:43,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:50:43" (3/3) ... [2019-12-27 21:50:43,607 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi002_pso.oepc.i [2019-12-27 21:50:43,617 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:50:43,617 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:50:43,630 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:50:43,632 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:50:43,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,690 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,690 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,723 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,723 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,723 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,724 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,724 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,753 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,755 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,763 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,765 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,766 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:43,783 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:50:43,804 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:50:43,805 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:50:43,805 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:50:43,805 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:50:43,805 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:50:43,805 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:50:43,805 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:50:43,806 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:50:43,826 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-27 21:50:43,828 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 21:50:44,002 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 21:50:44,002 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:50:44,048 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-27 21:50:44,165 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-27 21:50:44,317 INFO L132 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-27 21:50:44,317 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:50:44,355 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 903 event pairs. 0/233 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-27 21:50:44,423 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 56026 [2019-12-27 21:50:44,424 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:50:48,551 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 21:50:48,663 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 21:50:48,781 INFO L206 etLargeBlockEncoding]: Checked pairs total: 331194 [2019-12-27 21:50:48,781 INFO L214 etLargeBlockEncoding]: Total number of compositions: 139 [2019-12-27 21:50:48,785 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 156 places, 194 transitions [2019-12-27 21:51:04,619 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120671 states. [2019-12-27 21:51:04,621 INFO L276 IsEmpty]: Start isEmpty. Operand 120671 states. [2019-12-27 21:51:04,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 21:51:04,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:51:04,628 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 21:51:04,629 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:51:04,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:51:04,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1348557133, now seen corresponding path program 1 times [2019-12-27 21:51:04,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:51:04,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392545077] [2019-12-27 21:51:04,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:51:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:51:04,876 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 21:51:04,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392545077] [2019-12-27 21:51:04,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:51:04,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:51:04,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1682426447] [2019-12-27 21:51:04,879 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:51:04,884 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:51:04,894 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 21:51:04,895 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:51:04,899 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:51:04,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:51:04,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:51:04,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:51:04,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:51:04,912 INFO L87 Difference]: Start difference. First operand 120671 states. Second operand 3 states. [2019-12-27 21:51:06,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:51:06,292 INFO L93 Difference]: Finished difference Result 120599 states and 454207 transitions. [2019-12-27 21:51:06,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:51:06,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 21:51:06,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:51:09,823 INFO L225 Difference]: With dead ends: 120599 [2019-12-27 21:51:09,824 INFO L226 Difference]: Without dead ends: 118034 [2019-12-27 21:51:09,827 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 21:51:15,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118034 states. [2019-12-27 21:51:17,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118034 to 118034. [2019-12-27 21:51:17,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118034 states. [2019-12-27 21:51:22,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118034 states to 118034 states and 445141 transitions. [2019-12-27 21:51:22,136 INFO L78 Accepts]: Start accepts. Automaton has 118034 states and 445141 transitions. Word has length 5 [2019-12-27 21:51:22,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:51:22,136 INFO L462 AbstractCegarLoop]: Abstraction has 118034 states and 445141 transitions. [2019-12-27 21:51:22,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:51:22,136 INFO L276 IsEmpty]: Start isEmpty. Operand 118034 states and 445141 transitions. [2019-12-27 21:51:22,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:51:22,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:51:22,139 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:51:22,139 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:51:22,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:51:22,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1001758947, now seen corresponding path program 1 times [2019-12-27 21:51:22,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:51:22,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130449144] [2019-12-27 21:51:22,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:51:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:51:22,262 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 21:51:22,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130449144] [2019-12-27 21:51:22,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:51:22,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:51:22,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1693204511] [2019-12-27 21:51:22,264 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:51:22,265 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:51:22,271 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 21:51:22,271 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:51:22,311 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:51:22,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:51:22,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:51:22,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:51:22,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:51:22,313 INFO L87 Difference]: Start difference. First operand 118034 states and 445141 transitions. Second operand 5 states. [2019-12-27 21:51:23,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:51:23,452 INFO L93 Difference]: Finished difference Result 156706 states and 575012 transitions. [2019-12-27 21:51:23,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:51:23,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 21:51:23,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:51:23,900 INFO L225 Difference]: With dead ends: 156706 [2019-12-27 21:51:23,900 INFO L226 Difference]: Without dead ends: 156706 [2019-12-27 21:51:23,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:51:33,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156706 states. [2019-12-27 21:51:36,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156706 to 156473. [2019-12-27 21:51:36,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156473 states. [2019-12-27 21:51:36,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156473 states to 156473 states and 574351 transitions. [2019-12-27 21:51:36,684 INFO L78 Accepts]: Start accepts. Automaton has 156473 states and 574351 transitions. Word has length 11 [2019-12-27 21:51:36,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:51:36,684 INFO L462 AbstractCegarLoop]: Abstraction has 156473 states and 574351 transitions. [2019-12-27 21:51:36,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:51:36,684 INFO L276 IsEmpty]: Start isEmpty. Operand 156473 states and 574351 transitions. [2019-12-27 21:51:36,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:51:36,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:51:36,687 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:51:36,687 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:51:36,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:51:36,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1039090903, now seen corresponding path program 1 times [2019-12-27 21:51:36,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:51:36,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970635649] [2019-12-27 21:51:36,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:51:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:51:36,759 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 21:51:36,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970635649] [2019-12-27 21:51:36,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:51:36,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:51:36,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [501985282] [2019-12-27 21:51:36,760 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:51:36,761 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:51:36,762 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:51:36,762 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:51:36,762 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:51:36,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:51:36,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:51:36,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:51:36,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:51:36,763 INFO L87 Difference]: Start difference. First operand 156473 states and 574351 transitions. Second operand 4 states. [2019-12-27 21:51:42,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:51:42,140 INFO L93 Difference]: Finished difference Result 203727 states and 733867 transitions. [2019-12-27 21:51:42,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:51:42,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:51:42,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:51:42,673 INFO L225 Difference]: With dead ends: 203727 [2019-12-27 21:51:42,674 INFO L226 Difference]: Without dead ends: 203727 [2019-12-27 21:51:42,674 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 21:51:49,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203727 states. [2019-12-27 21:51:51,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203727 to 189697. [2019-12-27 21:51:51,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189697 states. [2019-12-27 21:52:00,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189697 states to 189697 states and 685577 transitions. [2019-12-27 21:52:00,249 INFO L78 Accepts]: Start accepts. Automaton has 189697 states and 685577 transitions. Word has length 11 [2019-12-27 21:52:00,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:00,249 INFO L462 AbstractCegarLoop]: Abstraction has 189697 states and 685577 transitions. [2019-12-27 21:52:00,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:52:00,249 INFO L276 IsEmpty]: Start isEmpty. Operand 189697 states and 685577 transitions. [2019-12-27 21:52:00,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 21:52:00,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:00,255 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:52:00,256 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:00,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:00,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1176638523, now seen corresponding path program 1 times [2019-12-27 21:52:00,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:00,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112577976] [2019-12-27 21:52:00,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:00,359 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 21:52:00,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112577976] [2019-12-27 21:52:00,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:00,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:52:00,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [853740735] [2019-12-27 21:52:00,360 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:00,362 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:00,367 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 65 transitions. [2019-12-27 21:52:00,367 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:00,459 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:52:00,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:52:00,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:00,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:52:00,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:52:00,462 INFO L87 Difference]: Start difference. First operand 189697 states and 685577 transitions. Second operand 8 states. [2019-12-27 21:52:03,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:03,991 INFO L93 Difference]: Finished difference Result 259282 states and 919907 transitions. [2019-12-27 21:52:03,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 21:52:03,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-12-27 21:52:03,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:06,530 INFO L225 Difference]: With dead ends: 259282 [2019-12-27 21:52:06,530 INFO L226 Difference]: Without dead ends: 259282 [2019-12-27 21:52:06,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:52:18,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259282 states. [2019-12-27 21:52:22,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259282 to 188159. [2019-12-27 21:52:22,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188159 states. [2019-12-27 21:52:23,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188159 states to 188159 states and 679985 transitions. [2019-12-27 21:52:23,509 INFO L78 Accepts]: Start accepts. Automaton has 188159 states and 679985 transitions. Word has length 17 [2019-12-27 21:52:23,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:23,509 INFO L462 AbstractCegarLoop]: Abstraction has 188159 states and 679985 transitions. [2019-12-27 21:52:23,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:52:23,510 INFO L276 IsEmpty]: Start isEmpty. Operand 188159 states and 679985 transitions. [2019-12-27 21:52:23,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:52:23,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:23,534 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 21:52:23,534 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:23,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:23,535 INFO L82 PathProgramCache]: Analyzing trace with hash -82071627, now seen corresponding path program 1 times [2019-12-27 21:52:23,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:23,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947924871] [2019-12-27 21:52:23,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:23,677 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 21:52:23,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947924871] [2019-12-27 21:52:23,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:23,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:52:23,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1859968248] [2019-12-27 21:52:23,679 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:23,682 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:23,692 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 105 transitions. [2019-12-27 21:52:23,692 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:23,769 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:52:23,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:52:23,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:23,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:52:23,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:52:23,771 INFO L87 Difference]: Start difference. First operand 188159 states and 679985 transitions. Second operand 9 states. [2019-12-27 21:52:32,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:32,192 INFO L93 Difference]: Finished difference Result 258327 states and 918716 transitions. [2019-12-27 21:52:32,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:52:32,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-27 21:52:32,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:32,790 INFO L225 Difference]: With dead ends: 258327 [2019-12-27 21:52:32,790 INFO L226 Difference]: Without dead ends: 258327 [2019-12-27 21:52:32,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:52:39,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258327 states. [2019-12-27 21:52:42,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258327 to 243454. [2019-12-27 21:52:42,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243454 states. [2019-12-27 21:52:43,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243454 states to 243454 states and 868009 transitions. [2019-12-27 21:52:43,407 INFO L78 Accepts]: Start accepts. Automaton has 243454 states and 868009 transitions. Word has length 25 [2019-12-27 21:52:43,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:43,408 INFO L462 AbstractCegarLoop]: Abstraction has 243454 states and 868009 transitions. [2019-12-27 21:52:43,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:52:43,409 INFO L276 IsEmpty]: Start isEmpty. Operand 243454 states and 868009 transitions. [2019-12-27 21:52:43,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:52:43,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:43,432 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 21:52:43,432 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:43,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:43,432 INFO L82 PathProgramCache]: Analyzing trace with hash 144894900, now seen corresponding path program 1 times [2019-12-27 21:52:43,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:43,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667252201] [2019-12-27 21:52:43,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:43,508 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 21:52:43,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667252201] [2019-12-27 21:52:43,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:43,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:52:43,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1385787527] [2019-12-27 21:52:43,510 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:43,513 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:43,518 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 21:52:43,518 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:43,518 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:52:43,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:52:43,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:43,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:52:43,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:52:43,519 INFO L87 Difference]: Start difference. First operand 243454 states and 868009 transitions. Second operand 4 states. [2019-12-27 21:52:43,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:43,612 INFO L93 Difference]: Finished difference Result 14903 states and 40512 transitions. [2019-12-27 21:52:43,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:52:43,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 21:52:43,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:43,628 INFO L225 Difference]: With dead ends: 14903 [2019-12-27 21:52:43,628 INFO L226 Difference]: Without dead ends: 10760 [2019-12-27 21:52:43,629 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 21:52:43,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10760 states. [2019-12-27 21:52:43,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10760 to 10720. [2019-12-27 21:52:43,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10720 states. [2019-12-27 21:52:43,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10720 states to 10720 states and 26331 transitions. [2019-12-27 21:52:43,756 INFO L78 Accepts]: Start accepts. Automaton has 10720 states and 26331 transitions. Word has length 25 [2019-12-27 21:52:43,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:43,757 INFO L462 AbstractCegarLoop]: Abstraction has 10720 states and 26331 transitions. [2019-12-27 21:52:43,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:52:43,757 INFO L276 IsEmpty]: Start isEmpty. Operand 10720 states and 26331 transitions. [2019-12-27 21:52:43,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-27 21:52:43,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:43,762 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] [2019-12-27 21:52:43,763 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:43,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:43,763 INFO L82 PathProgramCache]: Analyzing trace with hash 648735531, now seen corresponding path program 1 times [2019-12-27 21:52:43,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:43,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308451473] [2019-12-27 21:52:43,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:43,943 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 21:52:43,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308451473] [2019-12-27 21:52:43,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:43,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:52:43,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [598772873] [2019-12-27 21:52:43,946 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:43,958 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:43,990 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 105 states and 170 transitions. [2019-12-27 21:52:43,991 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:45,941 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:52:45,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:52:45,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:45,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:52:45,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:52:45,943 INFO L87 Difference]: Start difference. First operand 10720 states and 26331 transitions. Second operand 9 states. [2019-12-27 21:52:47,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:47,114 INFO L93 Difference]: Finished difference Result 12029 states and 29137 transitions. [2019-12-27 21:52:47,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:52:47,115 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-12-27 21:52:47,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:47,130 INFO L225 Difference]: With dead ends: 12029 [2019-12-27 21:52:47,130 INFO L226 Difference]: Without dead ends: 11981 [2019-12-27 21:52:47,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:52:47,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11981 states. [2019-12-27 21:52:47,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11981 to 11601. [2019-12-27 21:52:47,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11601 states. [2019-12-27 21:52:47,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11601 states to 11601 states and 28281 transitions. [2019-12-27 21:52:47,259 INFO L78 Accepts]: Start accepts. Automaton has 11601 states and 28281 transitions. Word has length 38 [2019-12-27 21:52:47,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:47,259 INFO L462 AbstractCegarLoop]: Abstraction has 11601 states and 28281 transitions. [2019-12-27 21:52:47,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:52:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 11601 states and 28281 transitions. [2019-12-27 21:52:47,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 21:52:47,267 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:47,267 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] [2019-12-27 21:52:47,267 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:47,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:47,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1308054868, now seen corresponding path program 1 times [2019-12-27 21:52:47,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:47,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933684149] [2019-12-27 21:52:47,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:47,391 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 21:52:47,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933684149] [2019-12-27 21:52:47,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:47,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:52:47,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [167781385] [2019-12-27 21:52:47,392 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:47,403 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:47,455 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 129 states and 206 transitions. [2019-12-27 21:52:47,456 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:47,526 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:52:47,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:52:47,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:47,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:52:47,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:52:47,527 INFO L87 Difference]: Start difference. First operand 11601 states and 28281 transitions. Second operand 10 states. [2019-12-27 21:52:49,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:49,042 INFO L93 Difference]: Finished difference Result 13284 states and 32064 transitions. [2019-12-27 21:52:49,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:52:49,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-12-27 21:52:49,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:49,061 INFO L225 Difference]: With dead ends: 13284 [2019-12-27 21:52:49,061 INFO L226 Difference]: Without dead ends: 13284 [2019-12-27 21:52:49,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-12-27 21:52:49,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13284 states. [2019-12-27 21:52:49,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13284 to 11783. [2019-12-27 21:52:49,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11783 states. [2019-12-27 21:52:49,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11783 states to 11783 states and 28661 transitions. [2019-12-27 21:52:49,203 INFO L78 Accepts]: Start accepts. Automaton has 11783 states and 28661 transitions. Word has length 50 [2019-12-27 21:52:49,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:49,204 INFO L462 AbstractCegarLoop]: Abstraction has 11783 states and 28661 transitions. [2019-12-27 21:52:49,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:52:49,204 INFO L276 IsEmpty]: Start isEmpty. Operand 11783 states and 28661 transitions. [2019-12-27 21:52:49,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 21:52:49,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:49,213 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] [2019-12-27 21:52:49,214 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:49,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:49,214 INFO L82 PathProgramCache]: Analyzing trace with hash -597968020, now seen corresponding path program 1 times [2019-12-27 21:52:49,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:49,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745406168] [2019-12-27 21:52:49,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:49,303 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 21:52:49,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745406168] [2019-12-27 21:52:49,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:49,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:52:49,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [153812986] [2019-12-27 21:52:49,304 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:49,320 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:49,342 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 57 transitions. [2019-12-27 21:52:49,342 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:49,342 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:52:49,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:52:49,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:49,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:52:49,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:52:49,343 INFO L87 Difference]: Start difference. First operand 11783 states and 28661 transitions. Second operand 5 states. [2019-12-27 21:52:50,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:50,327 INFO L93 Difference]: Finished difference Result 13164 states and 31589 transitions. [2019-12-27 21:52:50,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:52:50,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-27 21:52:50,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:50,411 INFO L225 Difference]: With dead ends: 13164 [2019-12-27 21:52:50,411 INFO L226 Difference]: Without dead ends: 13164 [2019-12-27 21:52:50,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 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 21:52:50,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2019-12-27 21:52:50,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 12761. [2019-12-27 21:52:50,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12761 states. [2019-12-27 21:52:50,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12761 states to 12761 states and 30780 transitions. [2019-12-27 21:52:50,564 INFO L78 Accepts]: Start accepts. Automaton has 12761 states and 30780 transitions. Word has length 57 [2019-12-27 21:52:50,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:50,564 INFO L462 AbstractCegarLoop]: Abstraction has 12761 states and 30780 transitions. [2019-12-27 21:52:50,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:52:50,564 INFO L276 IsEmpty]: Start isEmpty. Operand 12761 states and 30780 transitions. [2019-12-27 21:52:50,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 21:52:50,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:50,574 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] [2019-12-27 21:52:50,575 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:50,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:50,575 INFO L82 PathProgramCache]: Analyzing trace with hash 428916562, now seen corresponding path program 1 times [2019-12-27 21:52:50,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:50,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473915570] [2019-12-27 21:52:50,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:50,792 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 21:52:50,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473915570] [2019-12-27 21:52:50,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:50,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:52:50,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [249395136] [2019-12-27 21:52:50,793 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:50,808 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:50,829 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 58 transitions. [2019-12-27 21:52:50,829 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:50,830 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:52:50,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:52:50,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:50,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:52:50,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:52:50,831 INFO L87 Difference]: Start difference. First operand 12761 states and 30780 transitions. Second operand 11 states. [2019-12-27 21:52:52,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:52,469 INFO L93 Difference]: Finished difference Result 21596 states and 52464 transitions. [2019-12-27 21:52:52,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 21:52:52,469 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-27 21:52:52,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:52,493 INFO L225 Difference]: With dead ends: 21596 [2019-12-27 21:52:52,493 INFO L226 Difference]: Without dead ends: 21158 [2019-12-27 21:52:52,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-12-27 21:52:52,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21158 states. [2019-12-27 21:52:52,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21158 to 14512. [2019-12-27 21:52:52,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14512 states. [2019-12-27 21:52:52,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14512 states to 14512 states and 35219 transitions. [2019-12-27 21:52:52,681 INFO L78 Accepts]: Start accepts. Automaton has 14512 states and 35219 transitions. Word has length 58 [2019-12-27 21:52:52,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:52,682 INFO L462 AbstractCegarLoop]: Abstraction has 14512 states and 35219 transitions. [2019-12-27 21:52:52,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:52:52,682 INFO L276 IsEmpty]: Start isEmpty. Operand 14512 states and 35219 transitions. [2019-12-27 21:52:52,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 21:52:52,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:52,694 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 21:52:52,694 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:52,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:52,694 INFO L82 PathProgramCache]: Analyzing trace with hash 829880521, now seen corresponding path program 1 times [2019-12-27 21:52:52,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:52,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155629805] [2019-12-27 21:52:52,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:52,790 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 21:52:52,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155629805] [2019-12-27 21:52:52,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:52,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:52:52,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1975676433] [2019-12-27 21:52:52,791 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:52,812 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:52,905 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 220 transitions. [2019-12-27 21:52:52,905 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:52,920 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:52:52,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:52:52,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:52,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:52:52,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:52:52,921 INFO L87 Difference]: Start difference. First operand 14512 states and 35219 transitions. Second operand 6 states. [2019-12-27 21:52:52,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:52,984 INFO L93 Difference]: Finished difference Result 7303 states and 17313 transitions. [2019-12-27 21:52:52,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:52:52,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-27 21:52:52,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:52,993 INFO L225 Difference]: With dead ends: 7303 [2019-12-27 21:52:52,993 INFO L226 Difference]: Without dead ends: 7031 [2019-12-27 21:52:52,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:52:53,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7031 states. [2019-12-27 21:52:53,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7031 to 6830. [2019-12-27 21:52:53,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6830 states. [2019-12-27 21:52:53,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6830 states to 6830 states and 16343 transitions. [2019-12-27 21:52:53,064 INFO L78 Accepts]: Start accepts. Automaton has 6830 states and 16343 transitions. Word has length 64 [2019-12-27 21:52:53,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:53,064 INFO L462 AbstractCegarLoop]: Abstraction has 6830 states and 16343 transitions. [2019-12-27 21:52:53,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:52:53,065 INFO L276 IsEmpty]: Start isEmpty. Operand 6830 states and 16343 transitions. [2019-12-27 21:52:53,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 21:52:53,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:53,074 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:52:53,074 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:53,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:53,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1979048117, now seen corresponding path program 1 times [2019-12-27 21:52:53,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:53,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450706745] [2019-12-27 21:52:53,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:53,172 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 21:52:53,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450706745] [2019-12-27 21:52:53,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:53,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:52:53,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1370403542] [2019-12-27 21:52:53,173 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:53,274 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:53,411 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 133 states and 170 transitions. [2019-12-27 21:52:53,411 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:53,412 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:52:53,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:52:53,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:53,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:52:53,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:52:53,413 INFO L87 Difference]: Start difference. First operand 6830 states and 16343 transitions. Second operand 6 states. [2019-12-27 21:52:54,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:54,236 INFO L93 Difference]: Finished difference Result 8744 states and 20664 transitions. [2019-12-27 21:52:54,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:52:54,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-27 21:52:54,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:54,248 INFO L225 Difference]: With dead ends: 8744 [2019-12-27 21:52:54,248 INFO L226 Difference]: Without dead ends: 8744 [2019-12-27 21:52:54,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:52:54,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8744 states. [2019-12-27 21:52:54,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8744 to 8285. [2019-12-27 21:52:54,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8285 states. [2019-12-27 21:52:54,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8285 states to 8285 states and 19696 transitions. [2019-12-27 21:52:54,335 INFO L78 Accepts]: Start accepts. Automaton has 8285 states and 19696 transitions. Word has length 94 [2019-12-27 21:52:54,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:54,335 INFO L462 AbstractCegarLoop]: Abstraction has 8285 states and 19696 transitions. [2019-12-27 21:52:54,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:52:54,336 INFO L276 IsEmpty]: Start isEmpty. Operand 8285 states and 19696 transitions. [2019-12-27 21:52:54,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 21:52:54,347 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:54,347 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:52:54,347 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:54,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:54,347 INFO L82 PathProgramCache]: Analyzing trace with hash 275007721, now seen corresponding path program 2 times [2019-12-27 21:52:54,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:54,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420572999] [2019-12-27 21:52:54,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:54,456 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 21:52:54,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420572999] [2019-12-27 21:52:54,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:54,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:52:54,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1158986221] [2019-12-27 21:52:54,458 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:54,492 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:54,689 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 151 states and 202 transitions. [2019-12-27 21:52:54,690 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:54,702 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 21:52:54,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:52:54,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:54,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:52:54,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:52:54,703 INFO L87 Difference]: Start difference. First operand 8285 states and 19696 transitions. Second operand 8 states. [2019-12-27 21:52:56,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:56,639 INFO L93 Difference]: Finished difference Result 16043 states and 35656 transitions. [2019-12-27 21:52:56,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 21:52:56,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2019-12-27 21:52:56,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:56,658 INFO L225 Difference]: With dead ends: 16043 [2019-12-27 21:52:56,658 INFO L226 Difference]: Without dead ends: 16043 [2019-12-27 21:52:56,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2019-12-27 21:52:56,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16043 states. [2019-12-27 21:52:56,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16043 to 12871. [2019-12-27 21:52:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12871 states. [2019-12-27 21:52:56,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12871 states to 12871 states and 29187 transitions. [2019-12-27 21:52:56,821 INFO L78 Accepts]: Start accepts. Automaton has 12871 states and 29187 transitions. Word has length 94 [2019-12-27 21:52:56,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:56,821 INFO L462 AbstractCegarLoop]: Abstraction has 12871 states and 29187 transitions. [2019-12-27 21:52:56,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:52:56,821 INFO L276 IsEmpty]: Start isEmpty. Operand 12871 states and 29187 transitions. [2019-12-27 21:52:56,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 21:52:56,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:56,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:52:56,834 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:56,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:56,835 INFO L82 PathProgramCache]: Analyzing trace with hash -860704691, now seen corresponding path program 3 times [2019-12-27 21:52:56,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:56,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613372867] [2019-12-27 21:52:56,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:56,939 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 21:52:56,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613372867] [2019-12-27 21:52:56,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:56,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:52:56,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1724362300] [2019-12-27 21:52:56,940 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:56,973 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:57,164 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 141 states and 185 transitions. [2019-12-27 21:52:57,165 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:57,167 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:52:57,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:52:57,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:57,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:52:57,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:52:57,169 INFO L87 Difference]: Start difference. First operand 12871 states and 29187 transitions. Second operand 5 states. [2019-12-27 21:52:57,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:57,732 INFO L93 Difference]: Finished difference Result 13657 states and 30777 transitions. [2019-12-27 21:52:57,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:52:57,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-27 21:52:57,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:57,748 INFO L225 Difference]: With dead ends: 13657 [2019-12-27 21:52:57,748 INFO L226 Difference]: Without dead ends: 13657 [2019-12-27 21:52:57,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 2 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 21:52:57,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13657 states. [2019-12-27 21:52:57,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13657 to 13093. [2019-12-27 21:52:57,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13093 states. [2019-12-27 21:52:57,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13093 states to 13093 states and 29685 transitions. [2019-12-27 21:52:57,891 INFO L78 Accepts]: Start accepts. Automaton has 13093 states and 29685 transitions. Word has length 94 [2019-12-27 21:52:57,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:57,891 INFO L462 AbstractCegarLoop]: Abstraction has 13093 states and 29685 transitions. [2019-12-27 21:52:57,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:52:57,891 INFO L276 IsEmpty]: Start isEmpty. Operand 13093 states and 29685 transitions. [2019-12-27 21:52:57,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-27 21:52:57,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:57,903 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:52:57,903 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:57,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:57,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1714542913, now seen corresponding path program 4 times [2019-12-27 21:52:57,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:57,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470581879] [2019-12-27 21:52:57,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:58,026 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 21:52:58,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470581879] [2019-12-27 21:52:58,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:58,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:52:58,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [640784036] [2019-12-27 21:52:58,027 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:58,063 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:58,335 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 176 states and 240 transitions. [2019-12-27 21:52:58,335 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:58,335 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:52:58,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:52:58,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:58,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:52:58,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:52:58,336 INFO L87 Difference]: Start difference. First operand 13093 states and 29685 transitions. Second operand 3 states. [2019-12-27 21:52:58,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:58,406 INFO L93 Difference]: Finished difference Result 13093 states and 29684 transitions. [2019-12-27 21:52:58,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:52:58,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-27 21:52:58,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:58,421 INFO L225 Difference]: With dead ends: 13093 [2019-12-27 21:52:58,421 INFO L226 Difference]: Without dead ends: 13093 [2019-12-27 21:52:58,421 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 21:52:58,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13093 states. [2019-12-27 21:52:58,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13093 to 12969. [2019-12-27 21:52:58,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12969 states. [2019-12-27 21:52:58,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12969 states to 12969 states and 29455 transitions. [2019-12-27 21:52:58,557 INFO L78 Accepts]: Start accepts. Automaton has 12969 states and 29455 transitions. Word has length 94 [2019-12-27 21:52:58,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:58,558 INFO L462 AbstractCegarLoop]: Abstraction has 12969 states and 29455 transitions. [2019-12-27 21:52:58,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:52:58,558 INFO L276 IsEmpty]: Start isEmpty. Operand 12969 states and 29455 transitions. [2019-12-27 21:52:58,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 21:52:58,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:58,572 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:52:58,572 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:58,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:58,572 INFO L82 PathProgramCache]: Analyzing trace with hash 874014353, now seen corresponding path program 1 times [2019-12-27 21:52:58,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:58,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103567961] [2019-12-27 21:52:58,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:58,649 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 21:52:58,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103567961] [2019-12-27 21:52:58,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:58,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:52:58,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1882011544] [2019-12-27 21:52:58,650 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:58,686 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:58,813 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 186 transitions. [2019-12-27 21:52:58,814 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:58,814 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:52:58,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:52:58,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:58,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:52:58,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:52:58,815 INFO L87 Difference]: Start difference. First operand 12969 states and 29455 transitions. Second operand 3 states. [2019-12-27 21:52:58,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:52:58,881 INFO L93 Difference]: Finished difference Result 11196 states and 25521 transitions. [2019-12-27 21:52:58,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:52:58,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-27 21:52:58,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:52:58,892 INFO L225 Difference]: With dead ends: 11196 [2019-12-27 21:52:58,892 INFO L226 Difference]: Without dead ends: 11196 [2019-12-27 21:52:58,893 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 21:52:58,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11196 states. [2019-12-27 21:52:58,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11196 to 11184. [2019-12-27 21:52:58,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11184 states. [2019-12-27 21:52:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11184 states to 11184 states and 25499 transitions. [2019-12-27 21:52:59,004 INFO L78 Accepts]: Start accepts. Automaton has 11184 states and 25499 transitions. Word has length 95 [2019-12-27 21:52:59,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:52:59,004 INFO L462 AbstractCegarLoop]: Abstraction has 11184 states and 25499 transitions. [2019-12-27 21:52:59,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:52:59,004 INFO L276 IsEmpty]: Start isEmpty. Operand 11184 states and 25499 transitions. [2019-12-27 21:52:59,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:52:59,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:52:59,018 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:52:59,018 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:52:59,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:52:59,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1655863600, now seen corresponding path program 1 times [2019-12-27 21:52:59,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:52:59,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526540113] [2019-12-27 21:52:59,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:52:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:52:59,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:52:59,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526540113] [2019-12-27 21:52:59,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:52:59,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:52:59,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [54613447] [2019-12-27 21:52:59,103 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:52:59,206 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:52:59,389 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 186 transitions. [2019-12-27 21:52:59,389 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:52:59,391 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:52:59,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:52:59,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:52:59,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:52:59,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:52:59,392 INFO L87 Difference]: Start difference. First operand 11184 states and 25499 transitions. Second operand 6 states. [2019-12-27 21:53:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:00,294 INFO L93 Difference]: Finished difference Result 11801 states and 26702 transitions. [2019-12-27 21:53:00,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:53:00,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-27 21:53:00,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:00,311 INFO L225 Difference]: With dead ends: 11801 [2019-12-27 21:53:00,311 INFO L226 Difference]: Without dead ends: 11801 [2019-12-27 21:53:00,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:53:00,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11801 states. [2019-12-27 21:53:00,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11801 to 11328. [2019-12-27 21:53:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11328 states. [2019-12-27 21:53:00,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11328 states to 11328 states and 25781 transitions. [2019-12-27 21:53:00,494 INFO L78 Accepts]: Start accepts. Automaton has 11328 states and 25781 transitions. Word has length 96 [2019-12-27 21:53:00,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:00,494 INFO L462 AbstractCegarLoop]: Abstraction has 11328 states and 25781 transitions. [2019-12-27 21:53:00,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:53:00,494 INFO L276 IsEmpty]: Start isEmpty. Operand 11328 states and 25781 transitions. [2019-12-27 21:53:00,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:53:00,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:00,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:53:00,508 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:00,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:00,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1106579360, now seen corresponding path program 2 times [2019-12-27 21:53:00,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:00,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421766844] [2019-12-27 21:53:00,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:00,688 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 21:53:00,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421766844] [2019-12-27 21:53:00,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:00,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:53:00,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [39274430] [2019-12-27 21:53:00,695 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:00,732 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:00,961 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 220 states and 330 transitions. [2019-12-27 21:53:00,961 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:00,972 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:53:00,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:53:00,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:00,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:53:00,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:53:00,973 INFO L87 Difference]: Start difference. First operand 11328 states and 25781 transitions. Second operand 10 states. [2019-12-27 21:53:02,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:02,065 INFO L93 Difference]: Finished difference Result 24305 states and 54150 transitions. [2019-12-27 21:53:02,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 21:53:02,066 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 21:53:02,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:02,090 INFO L225 Difference]: With dead ends: 24305 [2019-12-27 21:53:02,090 INFO L226 Difference]: Without dead ends: 21732 [2019-12-27 21:53:02,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-27 21:53:02,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21732 states. [2019-12-27 21:53:02,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21732 to 14748. [2019-12-27 21:53:02,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14748 states. [2019-12-27 21:53:02,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14748 states to 14748 states and 33952 transitions. [2019-12-27 21:53:02,288 INFO L78 Accepts]: Start accepts. Automaton has 14748 states and 33952 transitions. Word has length 96 [2019-12-27 21:53:02,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:02,288 INFO L462 AbstractCegarLoop]: Abstraction has 14748 states and 33952 transitions. [2019-12-27 21:53:02,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:53:02,289 INFO L276 IsEmpty]: Start isEmpty. Operand 14748 states and 33952 transitions. [2019-12-27 21:53:02,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:53:02,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:02,302 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:53:02,302 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:02,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:02,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1106149920, now seen corresponding path program 3 times [2019-12-27 21:53:02,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:02,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837258836] [2019-12-27 21:53:02,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:02,473 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 21:53:02,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837258836] [2019-12-27 21:53:02,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:02,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:53:02,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1600836791] [2019-12-27 21:53:02,474 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:02,511 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:02,666 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 159 states and 213 transitions. [2019-12-27 21:53:02,666 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:02,709 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:53:02,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:53:02,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:02,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:53:02,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:53:02,710 INFO L87 Difference]: Start difference. First operand 14748 states and 33952 transitions. Second operand 12 states. [2019-12-27 21:53:03,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:03,990 INFO L93 Difference]: Finished difference Result 27981 states and 63482 transitions. [2019-12-27 21:53:03,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 21:53:03,992 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-27 21:53:03,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:04,016 INFO L225 Difference]: With dead ends: 27981 [2019-12-27 21:53:04,016 INFO L226 Difference]: Without dead ends: 22226 [2019-12-27 21:53:04,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2019-12-27 21:53:04,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22226 states. [2019-12-27 21:53:04,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22226 to 19150. [2019-12-27 21:53:04,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19150 states. [2019-12-27 21:53:04,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19150 states to 19150 states and 43985 transitions. [2019-12-27 21:53:04,307 INFO L78 Accepts]: Start accepts. Automaton has 19150 states and 43985 transitions. Word has length 96 [2019-12-27 21:53:04,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:04,308 INFO L462 AbstractCegarLoop]: Abstraction has 19150 states and 43985 transitions. [2019-12-27 21:53:04,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:53:04,308 INFO L276 IsEmpty]: Start isEmpty. Operand 19150 states and 43985 transitions. [2019-12-27 21:53:04,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:53:04,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:04,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:53:04,325 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:04,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:04,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1009839644, now seen corresponding path program 4 times [2019-12-27 21:53:04,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:04,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549359979] [2019-12-27 21:53:04,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:04,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 21:53:04,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549359979] [2019-12-27 21:53:04,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:04,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:53:04,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1738851085] [2019-12-27 21:53:04,500 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:04,546 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:04,701 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 138 states and 172 transitions. [2019-12-27 21:53:04,701 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:04,766 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:53:04,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:53:04,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:04,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:53:04,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:53:04,768 INFO L87 Difference]: Start difference. First operand 19150 states and 43985 transitions. Second operand 13 states. [2019-12-27 21:53:06,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:06,557 INFO L93 Difference]: Finished difference Result 32652 states and 74930 transitions. [2019-12-27 21:53:06,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 21:53:06,558 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 96 [2019-12-27 21:53:06,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:06,591 INFO L225 Difference]: With dead ends: 32652 [2019-12-27 21:53:06,591 INFO L226 Difference]: Without dead ends: 28553 [2019-12-27 21:53:06,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2019-12-27 21:53:06,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28553 states. [2019-12-27 21:53:06,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28553 to 20394. [2019-12-27 21:53:06,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20394 states. [2019-12-27 21:53:06,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20394 states to 20394 states and 47102 transitions. [2019-12-27 21:53:06,879 INFO L78 Accepts]: Start accepts. Automaton has 20394 states and 47102 transitions. Word has length 96 [2019-12-27 21:53:06,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:06,880 INFO L462 AbstractCegarLoop]: Abstraction has 20394 states and 47102 transitions. [2019-12-27 21:53:06,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:53:06,880 INFO L276 IsEmpty]: Start isEmpty. Operand 20394 states and 47102 transitions. [2019-12-27 21:53:06,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:53:06,902 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:06,902 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:53:06,902 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:06,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:06,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1973484644, now seen corresponding path program 5 times [2019-12-27 21:53:06,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:06,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819751353] [2019-12-27 21:53:06,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:06,982 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 21:53:06,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819751353] [2019-12-27 21:53:06,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:06,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:53:06,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [736931792] [2019-12-27 21:53:06,983 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:07,124 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:07,306 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 141 states and 179 transitions. [2019-12-27 21:53:07,306 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:07,307 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:53:07,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:53:07,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:07,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:53:07,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:53:07,309 INFO L87 Difference]: Start difference. First operand 20394 states and 47102 transitions. Second operand 4 states. [2019-12-27 21:53:07,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:07,702 INFO L93 Difference]: Finished difference Result 21630 states and 50007 transitions. [2019-12-27 21:53:07,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:53:07,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-27 21:53:07,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:07,727 INFO L225 Difference]: With dead ends: 21630 [2019-12-27 21:53:07,728 INFO L226 Difference]: Without dead ends: 21630 [2019-12-27 21:53:07,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:53:07,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21630 states. [2019-12-27 21:53:07,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21630 to 20266. [2019-12-27 21:53:07,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20266 states. [2019-12-27 21:53:07,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20266 states to 20266 states and 46836 transitions. [2019-12-27 21:53:07,964 INFO L78 Accepts]: Start accepts. Automaton has 20266 states and 46836 transitions. Word has length 96 [2019-12-27 21:53:07,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:07,965 INFO L462 AbstractCegarLoop]: Abstraction has 20266 states and 46836 transitions. [2019-12-27 21:53:07,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:53:07,965 INFO L276 IsEmpty]: Start isEmpty. Operand 20266 states and 46836 transitions. [2019-12-27 21:53:07,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:53:07,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:07,985 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:53:07,985 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:07,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:07,985 INFO L82 PathProgramCache]: Analyzing trace with hash -882944868, now seen corresponding path program 6 times [2019-12-27 21:53:07,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:07,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58768292] [2019-12-27 21:53:07,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:08,211 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 21:53:08,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58768292] [2019-12-27 21:53:08,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:08,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 21:53:08,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1831674615] [2019-12-27 21:53:08,212 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:08,257 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:08,525 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 159 states and 215 transitions. [2019-12-27 21:53:08,525 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:08,657 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 21:53:08,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 21:53:08,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:08,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 21:53:08,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-12-27 21:53:08,658 INFO L87 Difference]: Start difference. First operand 20266 states and 46836 transitions. Second operand 18 states. [2019-12-27 21:53:11,171 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2019-12-27 21:53:14,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:14,209 INFO L93 Difference]: Finished difference Result 33141 states and 73978 transitions. [2019-12-27 21:53:14,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-12-27 21:53:14,210 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2019-12-27 21:53:14,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:14,245 INFO L225 Difference]: With dead ends: 33141 [2019-12-27 21:53:14,245 INFO L226 Difference]: Without dead ends: 31251 [2019-12-27 21:53:14,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2637 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1068, Invalid=6942, Unknown=0, NotChecked=0, Total=8010 [2019-12-27 21:53:14,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31251 states. [2019-12-27 21:53:14,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31251 to 20811. [2019-12-27 21:53:14,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20811 states. [2019-12-27 21:53:14,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20811 states to 20811 states and 48114 transitions. [2019-12-27 21:53:14,572 INFO L78 Accepts]: Start accepts. Automaton has 20811 states and 48114 transitions. Word has length 96 [2019-12-27 21:53:14,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:14,572 INFO L462 AbstractCegarLoop]: Abstraction has 20811 states and 48114 transitions. [2019-12-27 21:53:14,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 21:53:14,572 INFO L276 IsEmpty]: Start isEmpty. Operand 20811 states and 48114 transitions. [2019-12-27 21:53:14,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:53:14,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:14,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:53:14,592 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:14,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:14,592 INFO L82 PathProgramCache]: Analyzing trace with hash -869322052, now seen corresponding path program 7 times [2019-12-27 21:53:14,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:14,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455351751] [2019-12-27 21:53:14,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:14,759 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 21:53:14,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455351751] [2019-12-27 21:53:14,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:14,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:53:14,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [462519921] [2019-12-27 21:53:14,762 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:14,786 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:15,034 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 161 states and 220 transitions. [2019-12-27 21:53:15,034 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:15,074 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:53:15,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:53:15,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:15,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:53:15,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:53:15,075 INFO L87 Difference]: Start difference. First operand 20811 states and 48114 transitions. Second operand 12 states. [2019-12-27 21:53:18,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:18,372 INFO L93 Difference]: Finished difference Result 46144 states and 102994 transitions. [2019-12-27 21:53:18,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-12-27 21:53:18,374 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-27 21:53:18,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:18,421 INFO L225 Difference]: With dead ends: 46144 [2019-12-27 21:53:18,422 INFO L226 Difference]: Without dead ends: 43769 [2019-12-27 21:53:18,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1305 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=543, Invalid=3617, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 21:53:18,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43769 states. [2019-12-27 21:53:18,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43769 to 25859. [2019-12-27 21:53:18,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25859 states. [2019-12-27 21:53:19,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25859 states to 25859 states and 60595 transitions. [2019-12-27 21:53:19,033 INFO L78 Accepts]: Start accepts. Automaton has 25859 states and 60595 transitions. Word has length 96 [2019-12-27 21:53:19,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:19,033 INFO L462 AbstractCegarLoop]: Abstraction has 25859 states and 60595 transitions. [2019-12-27 21:53:19,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:53:19,034 INFO L276 IsEmpty]: Start isEmpty. Operand 25859 states and 60595 transitions. [2019-12-27 21:53:19,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:53:19,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:19,056 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:53:19,057 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:19,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:19,057 INFO L82 PathProgramCache]: Analyzing trace with hash -2008375454, now seen corresponding path program 8 times [2019-12-27 21:53:19,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:19,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43882491] [2019-12-27 21:53:19,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:19,209 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 21:53:19,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43882491] [2019-12-27 21:53:19,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:19,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:53:19,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [860160160] [2019-12-27 21:53:19,210 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:19,234 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:19,414 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 147 transitions. [2019-12-27 21:53:19,414 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:19,428 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:53:19,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:53:19,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:19,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:53:19,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:53:19,430 INFO L87 Difference]: Start difference. First operand 25859 states and 60595 transitions. Second operand 10 states. [2019-12-27 21:53:20,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:20,300 INFO L93 Difference]: Finished difference Result 34722 states and 79910 transitions. [2019-12-27 21:53:20,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 21:53:20,300 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-27 21:53:20,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:20,339 INFO L225 Difference]: With dead ends: 34722 [2019-12-27 21:53:20,340 INFO L226 Difference]: Without dead ends: 34056 [2019-12-27 21:53:20,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2019-12-27 21:53:20,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34056 states. [2019-12-27 21:53:20,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34056 to 25865. [2019-12-27 21:53:20,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25865 states. [2019-12-27 21:53:20,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25865 states to 25865 states and 60601 transitions. [2019-12-27 21:53:20,690 INFO L78 Accepts]: Start accepts. Automaton has 25865 states and 60601 transitions. Word has length 96 [2019-12-27 21:53:20,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:20,691 INFO L462 AbstractCegarLoop]: Abstraction has 25865 states and 60601 transitions. [2019-12-27 21:53:20,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:53:20,691 INFO L276 IsEmpty]: Start isEmpty. Operand 25865 states and 60601 transitions. [2019-12-27 21:53:20,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:53:20,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:20,715 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:53:20,715 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:20,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:20,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1565635648, now seen corresponding path program 9 times [2019-12-27 21:53:20,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:20,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283694348] [2019-12-27 21:53:20,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:21,030 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 21:53:21,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283694348] [2019-12-27 21:53:21,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:21,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 21:53:21,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1820616794] [2019-12-27 21:53:21,031 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:21,049 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:21,334 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 180 states and 258 transitions. [2019-12-27 21:53:21,335 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:21,461 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:53:21,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 21:53:21,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:21,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 21:53:21,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:53:21,462 INFO L87 Difference]: Start difference. First operand 25865 states and 60601 transitions. Second operand 15 states. [2019-12-27 21:53:22,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:22,343 INFO L93 Difference]: Finished difference Result 31870 states and 74292 transitions. [2019-12-27 21:53:22,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 21:53:22,344 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2019-12-27 21:53:22,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:22,385 INFO L225 Difference]: With dead ends: 31870 [2019-12-27 21:53:22,385 INFO L226 Difference]: Without dead ends: 31832 [2019-12-27 21:53:22,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2019-12-27 21:53:22,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31832 states. [2019-12-27 21:53:22,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31832 to 29231. [2019-12-27 21:53:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29231 states. [2019-12-27 21:53:22,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29231 states to 29231 states and 68753 transitions. [2019-12-27 21:53:22,725 INFO L78 Accepts]: Start accepts. Automaton has 29231 states and 68753 transitions. Word has length 96 [2019-12-27 21:53:22,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:22,726 INFO L462 AbstractCegarLoop]: Abstraction has 29231 states and 68753 transitions. [2019-12-27 21:53:22,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 21:53:22,726 INFO L276 IsEmpty]: Start isEmpty. Operand 29231 states and 68753 transitions. [2019-12-27 21:53:22,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:53:22,753 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:22,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:53:22,753 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:22,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:22,754 INFO L82 PathProgramCache]: Analyzing trace with hash -770663424, now seen corresponding path program 10 times [2019-12-27 21:53:22,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:22,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988775600] [2019-12-27 21:53:22,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:22,906 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 21:53:22,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988775600] [2019-12-27 21:53:22,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:22,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:53:22,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1173521202] [2019-12-27 21:53:22,907 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:22,931 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:23,104 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 153 states and 201 transitions. [2019-12-27 21:53:23,104 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:23,105 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:53:23,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:53:23,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:23,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:53:23,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:53:23,106 INFO L87 Difference]: Start difference. First operand 29231 states and 68753 transitions. Second operand 9 states. [2019-12-27 21:53:23,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:23,796 INFO L93 Difference]: Finished difference Result 39941 states and 93072 transitions. [2019-12-27 21:53:23,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 21:53:23,797 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-27 21:53:23,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:23,837 INFO L225 Difference]: With dead ends: 39941 [2019-12-27 21:53:23,837 INFO L226 Difference]: Without dead ends: 36087 [2019-12-27 21:53:23,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-12-27 21:53:23,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36087 states. [2019-12-27 21:53:24,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36087 to 32352. [2019-12-27 21:53:24,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32352 states. [2019-12-27 21:53:24,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32352 states to 32352 states and 76096 transitions. [2019-12-27 21:53:24,209 INFO L78 Accepts]: Start accepts. Automaton has 32352 states and 76096 transitions. Word has length 96 [2019-12-27 21:53:24,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:24,209 INFO L462 AbstractCegarLoop]: Abstraction has 32352 states and 76096 transitions. [2019-12-27 21:53:24,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:53:24,209 INFO L276 IsEmpty]: Start isEmpty. Operand 32352 states and 76096 transitions. [2019-12-27 21:53:24,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:53:24,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:24,238 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:53:24,239 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:24,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:24,239 INFO L82 PathProgramCache]: Analyzing trace with hash -866973700, now seen corresponding path program 11 times [2019-12-27 21:53:24,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:24,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688598433] [2019-12-27 21:53:24,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:24,361 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 21:53:24,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688598433] [2019-12-27 21:53:24,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:24,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:53:24,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [344549572] [2019-12-27 21:53:24,362 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:24,380 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:24,492 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 132 states and 160 transitions. [2019-12-27 21:53:24,493 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:24,493 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:53:24,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:53:24,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:24,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:53:24,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:53:24,494 INFO L87 Difference]: Start difference. First operand 32352 states and 76096 transitions. Second operand 9 states. [2019-12-27 21:53:25,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:25,330 INFO L93 Difference]: Finished difference Result 44299 states and 104150 transitions. [2019-12-27 21:53:25,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 21:53:25,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-27 21:53:25,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:25,388 INFO L225 Difference]: With dead ends: 44299 [2019-12-27 21:53:25,388 INFO L226 Difference]: Without dead ends: 41165 [2019-12-27 21:53:25,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-12-27 21:53:25,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41165 states. [2019-12-27 21:53:25,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41165 to 34146. [2019-12-27 21:53:25,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34146 states. [2019-12-27 21:53:25,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34146 states to 34146 states and 80946 transitions. [2019-12-27 21:53:25,996 INFO L78 Accepts]: Start accepts. Automaton has 34146 states and 80946 transitions. Word has length 96 [2019-12-27 21:53:25,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:25,996 INFO L462 AbstractCegarLoop]: Abstraction has 34146 states and 80946 transitions. [2019-12-27 21:53:25,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:53:25,996 INFO L276 IsEmpty]: Start isEmpty. Operand 34146 states and 80946 transitions. [2019-12-27 21:53:26,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:53:26,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:26,026 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:53:26,026 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:26,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:26,026 INFO L82 PathProgramCache]: Analyzing trace with hash 444669308, now seen corresponding path program 12 times [2019-12-27 21:53:26,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:26,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243309751] [2019-12-27 21:53:26,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:26,309 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 21:53:26,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243309751] [2019-12-27 21:53:26,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:26,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 21:53:26,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1556422686] [2019-12-27 21:53:26,311 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:26,363 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:26,561 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 167 transitions. [2019-12-27 21:53:26,561 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:26,586 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:53:26,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 21:53:26,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:26,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 21:53:26,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-12-27 21:53:26,588 INFO L87 Difference]: Start difference. First operand 34146 states and 80946 transitions. Second operand 16 states. [2019-12-27 21:53:28,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:28,322 INFO L93 Difference]: Finished difference Result 45893 states and 107288 transitions. [2019-12-27 21:53:28,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 21:53:28,322 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 96 [2019-12-27 21:53:28,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:28,382 INFO L225 Difference]: With dead ends: 45893 [2019-12-27 21:53:28,382 INFO L226 Difference]: Without dead ends: 45511 [2019-12-27 21:53:28,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=867, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 21:53:28,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45511 states. [2019-12-27 21:53:28,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45511 to 33828. [2019-12-27 21:53:28,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33828 states. [2019-12-27 21:53:28,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33828 states to 33828 states and 80240 transitions. [2019-12-27 21:53:28,880 INFO L78 Accepts]: Start accepts. Automaton has 33828 states and 80240 transitions. Word has length 96 [2019-12-27 21:53:28,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:28,880 INFO L462 AbstractCegarLoop]: Abstraction has 33828 states and 80240 transitions. [2019-12-27 21:53:28,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 21:53:28,880 INFO L276 IsEmpty]: Start isEmpty. Operand 33828 states and 80240 transitions. [2019-12-27 21:53:29,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:53:29,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:29,037 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:53:29,037 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:29,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:29,037 INFO L82 PathProgramCache]: Analyzing trace with hash -198296150, now seen corresponding path program 13 times [2019-12-27 21:53:29,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:29,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440454285] [2019-12-27 21:53:29,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:29,253 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 21:53:29,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440454285] [2019-12-27 21:53:29,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:29,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 21:53:29,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1035690328] [2019-12-27 21:53:29,254 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:29,273 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:29,488 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 204 states and 304 transitions. [2019-12-27 21:53:29,488 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:29,561 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 21:53:29,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 21:53:29,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:29,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 21:53:29,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:53:29,563 INFO L87 Difference]: Start difference. First operand 33828 states and 80240 transitions. Second operand 15 states. [2019-12-27 21:53:34,480 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2019-12-27 21:53:34,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:34,643 INFO L93 Difference]: Finished difference Result 56633 states and 131578 transitions. [2019-12-27 21:53:34,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 21:53:34,644 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2019-12-27 21:53:34,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:34,703 INFO L225 Difference]: With dead ends: 56633 [2019-12-27 21:53:34,704 INFO L226 Difference]: Without dead ends: 54990 [2019-12-27 21:53:34,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=376, Invalid=2174, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 21:53:34,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54990 states. [2019-12-27 21:53:35,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54990 to 36337. [2019-12-27 21:53:35,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36337 states. [2019-12-27 21:53:35,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36337 states to 36337 states and 86501 transitions. [2019-12-27 21:53:35,232 INFO L78 Accepts]: Start accepts. Automaton has 36337 states and 86501 transitions. Word has length 96 [2019-12-27 21:53:35,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:35,232 INFO L462 AbstractCegarLoop]: Abstraction has 36337 states and 86501 transitions. [2019-12-27 21:53:35,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 21:53:35,232 INFO L276 IsEmpty]: Start isEmpty. Operand 36337 states and 86501 transitions. [2019-12-27 21:53:35,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:53:35,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:35,265 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:53:35,265 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:35,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:35,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1819640672, now seen corresponding path program 14 times [2019-12-27 21:53:35,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:35,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233809277] [2019-12-27 21:53:35,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:35,663 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 21:53:35,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233809277] [2019-12-27 21:53:35,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:35,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 21:53:35,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1978307982] [2019-12-27 21:53:35,668 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:35,715 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:35,946 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 201 transitions. [2019-12-27 21:53:35,946 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:36,181 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 30 times. [2019-12-27 21:53:36,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-27 21:53:36,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:36,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-27 21:53:36,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2019-12-27 21:53:36,182 INFO L87 Difference]: Start difference. First operand 36337 states and 86501 transitions. Second operand 26 states. [2019-12-27 21:53:38,387 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-12-27 21:53:48,033 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2019-12-27 21:53:57,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:53:57,729 INFO L93 Difference]: Finished difference Result 58216 states and 135654 transitions. [2019-12-27 21:53:57,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2019-12-27 21:53:57,729 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 96 [2019-12-27 21:53:57,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:53:57,966 INFO L225 Difference]: With dead ends: 58216 [2019-12-27 21:53:57,966 INFO L226 Difference]: Without dead ends: 57251 [2019-12-27 21:53:57,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9518 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=2832, Invalid=21038, Unknown=0, NotChecked=0, Total=23870 [2019-12-27 21:53:58,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57251 states. [2019-12-27 21:53:58,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57251 to 37650. [2019-12-27 21:53:58,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37650 states. [2019-12-27 21:53:58,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37650 states to 37650 states and 89893 transitions. [2019-12-27 21:53:58,522 INFO L78 Accepts]: Start accepts. Automaton has 37650 states and 89893 transitions. Word has length 96 [2019-12-27 21:53:58,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:53:58,523 INFO L462 AbstractCegarLoop]: Abstraction has 37650 states and 89893 transitions. [2019-12-27 21:53:58,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-27 21:53:58,523 INFO L276 IsEmpty]: Start isEmpty. Operand 37650 states and 89893 transitions. [2019-12-27 21:53:58,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-27 21:53:58,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:53:58,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:53:58,567 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:53:58,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:53:58,568 INFO L82 PathProgramCache]: Analyzing trace with hash 242920692, now seen corresponding path program 15 times [2019-12-27 21:53:58,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:53:58,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696259722] [2019-12-27 21:53:58,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:53:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:53:58,864 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 21:53:58,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696259722] [2019-12-27 21:53:58,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:53:58,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 21:53:58,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [577124766] [2019-12-27 21:53:58,865 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:53:58,882 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:53:58,997 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 162 transitions. [2019-12-27 21:53:58,998 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:53:59,018 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:53:59,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 21:53:59,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:53:59,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 21:53:59,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-12-27 21:53:59,020 INFO L87 Difference]: Start difference. First operand 37650 states and 89893 transitions. Second operand 18 states. [2019-12-27 21:54:07,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:54:07,538 INFO L93 Difference]: Finished difference Result 79180 states and 185959 transitions. [2019-12-27 21:54:07,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-12-27 21:54:07,538 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2019-12-27 21:54:07,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:54:07,648 INFO L225 Difference]: With dead ends: 79180 [2019-12-27 21:54:07,648 INFO L226 Difference]: Without dead ends: 75780 [2019-12-27 21:54:07,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=533, Invalid=3757, Unknown=0, NotChecked=0, Total=4290 [2019-12-27 21:54:07,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75780 states. Received shutdown request... [2019-12-27 21:54:08,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75780 to 37536. [2019-12-27 21:54:08,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37536 states. [2019-12-27 21:54:08,301 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 21:54:08,305 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 21:54:08,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:54:08 BasicIcfg [2019-12-27 21:54:08,306 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:54:08,307 INFO L168 Benchmark]: Toolchain (without parser) took 206947.11 ms. Allocated memory was 137.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 100.5 MB in the beginning and 1.0 GB in the end (delta: -908.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 21:54:08,307 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 21:54:08,308 INFO L168 Benchmark]: CACSL2BoogieTranslator took 821.73 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 100.1 MB in the beginning and 151.8 MB in the end (delta: -51.7 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:54:08,308 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.83 ms. Allocated memory is still 201.3 MB. Free memory was 151.8 MB in the beginning and 148.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:54:08,309 INFO L168 Benchmark]: Boogie Preprocessor took 49.82 ms. Allocated memory is still 201.3 MB. Free memory was 148.3 MB in the beginning and 145.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 21:54:08,309 INFO L168 Benchmark]: RCFGBuilder took 1277.59 ms. Allocated memory was 201.3 MB in the beginning and 232.3 MB in the end (delta: 30.9 MB). Free memory was 145.6 MB in the beginning and 190.5 MB in the end (delta: -44.9 MB). Peak memory consumption was 67.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:54:08,310 INFO L168 Benchmark]: TraceAbstraction took 204710.28 ms. Allocated memory was 232.3 MB in the beginning and 2.7 GB in the end (delta: 2.4 GB). Free memory was 189.1 MB in the beginning and 1.0 GB in the end (delta: -820.0 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 21:54:08,312 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.21 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 821.73 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 100.1 MB in the beginning and 151.8 MB in the end (delta: -51.7 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.83 ms. Allocated memory is still 201.3 MB. Free memory was 151.8 MB in the beginning and 148.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.82 ms. Allocated memory is still 201.3 MB. Free memory was 148.3 MB in the beginning and 145.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1277.59 ms. Allocated memory was 201.3 MB in the beginning and 232.3 MB in the end (delta: 30.9 MB). Free memory was 145.6 MB in the beginning and 190.5 MB in the end (delta: -44.9 MB). Peak memory consumption was 67.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 204710.28 ms. Allocated memory was 232.3 MB in the beginning and 2.7 GB in the end (delta: 2.4 GB). Free memory was 189.1 MB in the beginning and 1.0 GB in the end (delta: -820.0 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 244 ProgramPointsBefore, 156 ProgramPointsAfterwards, 326 TransitionsBefore, 194 TransitionsAfterwards, 56026 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 74 ConcurrentYvCompositions, 47 ChoiceCompositions, 17563 VarBasedMoverChecksPositive, 349 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 331194 CheckedPairsTotal, 139 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while ReachableStatesComputation was computing reachable states (1 states constructedinput type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: TIMEOUT, OverallTime: 204.5s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 92.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 15584 SDtfs, 24050 SDslu, 83456 SDs, 0 SdLazy, 48383 SolverSat, 1465 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 40.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 948 GetRequests, 199 SyntacticMatches, 36 SemanticMatches, 713 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16310 ImplicationChecksByTransitivity, 20.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=243454occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 77.7s AutomataMinimizationTime, 31 MinimizatonAttempts, 233650 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 2272 NumberOfCodeBlocks, 2272 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2241 ConstructedInterpolants, 0 QuantifiedInterpolants, 945960 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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 [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process