/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 13:38:12,109 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 13:38:12,112 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 13:38:12,130 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 13:38:12,130 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 13:38:12,132 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 13:38:12,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 13:38:12,144 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 13:38:12,148 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 13:38:12,151 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 13:38:12,153 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 13:38:12,155 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 13:38:12,155 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 13:38:12,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 13:38:12,160 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 13:38:12,161 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 13:38:12,163 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 13:38:12,163 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 13:38:12,165 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 13:38:12,171 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 13:38:12,174 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 13:38:12,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 13:38:12,176 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 13:38:12,176 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 13:38:12,178 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 13:38:12,178 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 13:38:12,179 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 13:38:12,179 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 13:38:12,180 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 13:38:12,181 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 13:38:12,181 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 13:38:12,182 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 13:38:12,182 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 13:38:12,183 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 13:38:12,184 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 13:38:12,184 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 13:38:12,185 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 13:38:12,185 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 13:38:12,185 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 13:38:12,186 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 13:38:12,188 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 13:38:12,189 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-27 13:38:12,202 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 13:38:12,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 13:38:12,204 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 13:38:12,204 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 13:38:12,204 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 13:38:12,204 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 13:38:12,205 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 13:38:12,205 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 13:38:12,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 13:38:12,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 13:38:12,205 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 13:38:12,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 13:38:12,206 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 13:38:12,206 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 13:38:12,206 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 13:38:12,206 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 13:38:12,206 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 13:38:12,207 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 13:38:12,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 13:38:12,207 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 13:38:12,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 13:38:12,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 13:38:12,207 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 13:38:12,208 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 13:38:12,208 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 13:38:12,208 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 13:38:12,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 13:38:12,208 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 13:38:12,209 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 13:38:12,209 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 13:38:12,475 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 13:38:12,489 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 13:38:12,493 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 13:38:12,495 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 13:38:12,495 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 13:38:12,496 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i [2019-12-27 13:38:12,579 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5782f917e/6ade26db65e345ad833f925aaf94559f/FLAG084a3ec26 [2019-12-27 13:38:13,130 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 13:38:13,131 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_rmo.oepc.i [2019-12-27 13:38:13,147 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5782f917e/6ade26db65e345ad833f925aaf94559f/FLAG084a3ec26 [2019-12-27 13:38:13,386 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5782f917e/6ade26db65e345ad833f925aaf94559f [2019-12-27 13:38:13,396 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 13:38:13,398 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 13:38:13,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 13:38:13,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 13:38:13,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 13:38:13,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:38:13" (1/1) ... [2019-12-27 13:38:13,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6943ffe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:38:13, skipping insertion in model container [2019-12-27 13:38:13,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:38:13" (1/1) ... [2019-12-27 13:38:13,415 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 13:38:13,488 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 13:38:14,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 13:38:14,081 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 13:38:14,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 13:38:14,229 INFO L208 MainTranslator]: Completed translation [2019-12-27 13:38:14,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:38:14 WrapperNode [2019-12-27 13:38:14,229 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 13:38:14,230 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 13:38:14,230 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 13:38:14,231 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 13:38:14,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:38:14" (1/1) ... [2019-12-27 13:38:14,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:38:14" (1/1) ... [2019-12-27 13:38:14,301 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 13:38:14,302 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 13:38:14,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 13:38:14,302 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 13:38:14,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:38:14" (1/1) ... [2019-12-27 13:38:14,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:38:14" (1/1) ... [2019-12-27 13:38:14,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:38:14" (1/1) ... [2019-12-27 13:38:14,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:38:14" (1/1) ... [2019-12-27 13:38:14,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:38:14" (1/1) ... [2019-12-27 13:38:14,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:38:14" (1/1) ... [2019-12-27 13:38:14,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:38:14" (1/1) ... [2019-12-27 13:38:14,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 13:38:14,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 13:38:14,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 13:38:14,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 13:38:14,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:38:14" (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 13:38:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 13:38:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 13:38:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 13:38:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 13:38:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 13:38:14,409 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 13:38:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 13:38:14,409 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 13:38:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 13:38:14,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 13:38:14,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 13:38:14,412 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 13:38:15,146 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 13:38:15,146 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 13:38:15,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:38:15 BoogieIcfgContainer [2019-12-27 13:38:15,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 13:38:15,149 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 13:38:15,149 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 13:38:15,153 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 13:38:15,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:38:13" (1/3) ... [2019-12-27 13:38:15,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665511eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:38:15, skipping insertion in model container [2019-12-27 13:38:15,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:38:14" (2/3) ... [2019-12-27 13:38:15,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665511eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:38:15, skipping insertion in model container [2019-12-27 13:38:15,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:38:15" (3/3) ... [2019-12-27 13:38:15,158 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_rmo.oepc.i [2019-12-27 13:38:15,169 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 13:38:15,169 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 13:38:15,178 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 13:38:15,179 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 13:38:15,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,219 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,219 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,220 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,220 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,221 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,229 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,229 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,242 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,243 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,243 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,246 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,247 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 13:38:15,265 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 13:38:15,288 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 13:38:15,289 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 13:38:15,289 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 13:38:15,289 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 13:38:15,290 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 13:38:15,290 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 13:38:15,290 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 13:38:15,290 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 13:38:15,307 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146 places, 180 transitions [2019-12-27 13:38:16,716 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22510 states. [2019-12-27 13:38:16,718 INFO L276 IsEmpty]: Start isEmpty. Operand 22510 states. [2019-12-27 13:38:16,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 13:38:16,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:16,727 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:16,727 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:16,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:16,733 INFO L82 PathProgramCache]: Analyzing trace with hash 772326421, now seen corresponding path program 1 times [2019-12-27 13:38:16,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:16,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461394710] [2019-12-27 13:38:16,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:17,075 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 13:38:17,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461394710] [2019-12-27 13:38:17,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:17,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:38:17,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711033727] [2019-12-27 13:38:17,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:38:17,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:17,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:38:17,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:38:17,107 INFO L87 Difference]: Start difference. First operand 22510 states. Second operand 4 states. [2019-12-27 13:38:17,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:17,839 INFO L93 Difference]: Finished difference Result 23454 states and 91771 transitions. [2019-12-27 13:38:17,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 13:38:17,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-27 13:38:17,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:18,079 INFO L225 Difference]: With dead ends: 23454 [2019-12-27 13:38:18,080 INFO L226 Difference]: Without dead ends: 21278 [2019-12-27 13:38:18,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:38:18,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21278 states. [2019-12-27 13:38:19,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21278 to 21278. [2019-12-27 13:38:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21278 states. [2019-12-27 13:38:19,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21278 states to 21278 states and 83795 transitions. [2019-12-27 13:38:19,969 INFO L78 Accepts]: Start accepts. Automaton has 21278 states and 83795 transitions. Word has length 33 [2019-12-27 13:38:19,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:19,970 INFO L462 AbstractCegarLoop]: Abstraction has 21278 states and 83795 transitions. [2019-12-27 13:38:19,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:38:19,970 INFO L276 IsEmpty]: Start isEmpty. Operand 21278 states and 83795 transitions. [2019-12-27 13:38:19,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 13:38:19,977 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:19,977 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] [2019-12-27 13:38:19,978 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:19,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:19,978 INFO L82 PathProgramCache]: Analyzing trace with hash -2041424114, now seen corresponding path program 1 times [2019-12-27 13:38:19,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:19,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752688553] [2019-12-27 13:38:19,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:20,078 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 13:38:20,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752688553] [2019-12-27 13:38:20,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:20,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:38:20,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441845564] [2019-12-27 13:38:20,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:38:20,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:20,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:38:20,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:38:20,083 INFO L87 Difference]: Start difference. First operand 21278 states and 83795 transitions. Second operand 5 states. [2019-12-27 13:38:20,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:20,864 INFO L93 Difference]: Finished difference Result 34712 states and 129091 transitions. [2019-12-27 13:38:20,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:38:20,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-27 13:38:20,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:22,055 INFO L225 Difference]: With dead ends: 34712 [2019-12-27 13:38:22,055 INFO L226 Difference]: Without dead ends: 34568 [2019-12-27 13:38:22,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:38:22,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34568 states. [2019-12-27 13:38:23,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34568 to 33068. [2019-12-27 13:38:23,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33068 states. [2019-12-27 13:38:23,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33068 states to 33068 states and 123979 transitions. [2019-12-27 13:38:23,184 INFO L78 Accepts]: Start accepts. Automaton has 33068 states and 123979 transitions. Word has length 44 [2019-12-27 13:38:23,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:23,186 INFO L462 AbstractCegarLoop]: Abstraction has 33068 states and 123979 transitions. [2019-12-27 13:38:23,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:38:23,186 INFO L276 IsEmpty]: Start isEmpty. Operand 33068 states and 123979 transitions. [2019-12-27 13:38:23,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-27 13:38:23,194 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:23,195 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] [2019-12-27 13:38:23,195 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:23,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:23,195 INFO L82 PathProgramCache]: Analyzing trace with hash 865833508, now seen corresponding path program 1 times [2019-12-27 13:38:23,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:23,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925937978] [2019-12-27 13:38:23,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:23,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 13:38:23,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925937978] [2019-12-27 13:38:23,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:23,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:38:23,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452186433] [2019-12-27 13:38:23,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:38:23,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:23,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:38:23,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:38:23,362 INFO L87 Difference]: Start difference. First operand 33068 states and 123979 transitions. Second operand 5 states. [2019-12-27 13:38:24,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:24,148 INFO L93 Difference]: Finished difference Result 40220 states and 148648 transitions. [2019-12-27 13:38:24,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:38:24,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-27 13:38:24,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:24,272 INFO L225 Difference]: With dead ends: 40220 [2019-12-27 13:38:24,272 INFO L226 Difference]: Without dead ends: 40060 [2019-12-27 13:38:24,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:38:24,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40060 states. [2019-12-27 13:38:26,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40060 to 34641. [2019-12-27 13:38:26,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34641 states. [2019-12-27 13:38:26,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34641 states to 34641 states and 129275 transitions. [2019-12-27 13:38:26,716 INFO L78 Accepts]: Start accepts. Automaton has 34641 states and 129275 transitions. Word has length 45 [2019-12-27 13:38:26,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:26,716 INFO L462 AbstractCegarLoop]: Abstraction has 34641 states and 129275 transitions. [2019-12-27 13:38:26,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:38:26,717 INFO L276 IsEmpty]: Start isEmpty. Operand 34641 states and 129275 transitions. [2019-12-27 13:38:26,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 13:38:26,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:26,730 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] [2019-12-27 13:38:26,730 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:26,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:26,731 INFO L82 PathProgramCache]: Analyzing trace with hash -566493931, now seen corresponding path program 1 times [2019-12-27 13:38:26,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:26,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942800417] [2019-12-27 13:38:26,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:26,832 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 13:38:26,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942800417] [2019-12-27 13:38:26,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:26,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:38:26,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659841431] [2019-12-27 13:38:26,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:38:26,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:26,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:38:26,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:38:26,835 INFO L87 Difference]: Start difference. First operand 34641 states and 129275 transitions. Second operand 6 states. [2019-12-27 13:38:28,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:28,001 INFO L93 Difference]: Finished difference Result 45669 states and 166169 transitions. [2019-12-27 13:38:28,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 13:38:28,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 13:38:28,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:28,150 INFO L225 Difference]: With dead ends: 45669 [2019-12-27 13:38:28,151 INFO L226 Difference]: Without dead ends: 45525 [2019-12-27 13:38:28,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-27 13:38:28,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45525 states. [2019-12-27 13:38:30,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45525 to 33604. [2019-12-27 13:38:30,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33604 states. [2019-12-27 13:38:30,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33604 states to 33604 states and 125430 transitions. [2019-12-27 13:38:30,451 INFO L78 Accepts]: Start accepts. Automaton has 33604 states and 125430 transitions. Word has length 52 [2019-12-27 13:38:30,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:30,452 INFO L462 AbstractCegarLoop]: Abstraction has 33604 states and 125430 transitions. [2019-12-27 13:38:30,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:38:30,452 INFO L276 IsEmpty]: Start isEmpty. Operand 33604 states and 125430 transitions. [2019-12-27 13:38:30,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 13:38:30,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:30,487 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] [2019-12-27 13:38:30,487 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:30,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:30,488 INFO L82 PathProgramCache]: Analyzing trace with hash -885098341, now seen corresponding path program 1 times [2019-12-27 13:38:30,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:30,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098737899] [2019-12-27 13:38:30,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:30,613 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 13:38:30,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098737899] [2019-12-27 13:38:30,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:30,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:38:30,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066623654] [2019-12-27 13:38:30,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:38:30,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:30,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:38:30,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:38:30,616 INFO L87 Difference]: Start difference. First operand 33604 states and 125430 transitions. Second operand 6 states. [2019-12-27 13:38:31,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:31,276 INFO L93 Difference]: Finished difference Result 46076 states and 167863 transitions. [2019-12-27 13:38:31,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 13:38:31,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-27 13:38:31,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:31,374 INFO L225 Difference]: With dead ends: 46076 [2019-12-27 13:38:31,374 INFO L226 Difference]: Without dead ends: 45836 [2019-12-27 13:38:31,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 13:38:31,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45836 states. [2019-12-27 13:38:32,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45836 to 39965. [2019-12-27 13:38:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39965 states. [2019-12-27 13:38:32,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39965 states to 39965 states and 147354 transitions. [2019-12-27 13:38:32,461 INFO L78 Accepts]: Start accepts. Automaton has 39965 states and 147354 transitions. Word has length 59 [2019-12-27 13:38:32,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:32,461 INFO L462 AbstractCegarLoop]: Abstraction has 39965 states and 147354 transitions. [2019-12-27 13:38:32,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:38:32,461 INFO L276 IsEmpty]: Start isEmpty. Operand 39965 states and 147354 transitions. [2019-12-27 13:38:32,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 13:38:34,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:34,278 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] [2019-12-27 13:38:34,279 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:34,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:34,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1504066544, now seen corresponding path program 1 times [2019-12-27 13:38:34,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:34,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498514271] [2019-12-27 13:38:34,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:34,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:38:34,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498514271] [2019-12-27 13:38:34,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:34,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 13:38:34,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253622613] [2019-12-27 13:38:34,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 13:38:34,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:34,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 13:38:34,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:38:34,348 INFO L87 Difference]: Start difference. First operand 39965 states and 147354 transitions. Second operand 3 states. [2019-12-27 13:38:34,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:34,590 INFO L93 Difference]: Finished difference Result 50263 states and 182189 transitions. [2019-12-27 13:38:34,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 13:38:34,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-27 13:38:34,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:34,693 INFO L225 Difference]: With dead ends: 50263 [2019-12-27 13:38:34,694 INFO L226 Difference]: Without dead ends: 50263 [2019-12-27 13:38:34,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:38:34,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50263 states. [2019-12-27 13:38:35,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50263 to 43895. [2019-12-27 13:38:35,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43895 states. [2019-12-27 13:38:35,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43895 states to 43895 states and 160792 transitions. [2019-12-27 13:38:35,772 INFO L78 Accepts]: Start accepts. Automaton has 43895 states and 160792 transitions. Word has length 61 [2019-12-27 13:38:35,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:35,773 INFO L462 AbstractCegarLoop]: Abstraction has 43895 states and 160792 transitions. [2019-12-27 13:38:35,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 13:38:35,773 INFO L276 IsEmpty]: Start isEmpty. Operand 43895 states and 160792 transitions. [2019-12-27 13:38:35,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 13:38:35,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:35,807 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:35,808 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:35,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:35,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1371095923, now seen corresponding path program 1 times [2019-12-27 13:38:35,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:35,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594398465] [2019-12-27 13:38:35,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:35,903 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 13:38:35,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594398465] [2019-12-27 13:38:35,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:35,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:38:35,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699516736] [2019-12-27 13:38:35,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:38:35,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:35,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:38:35,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:38:35,907 INFO L87 Difference]: Start difference. First operand 43895 states and 160792 transitions. Second operand 7 states. [2019-12-27 13:38:36,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:36,898 INFO L93 Difference]: Finished difference Result 55891 states and 200526 transitions. [2019-12-27 13:38:36,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 13:38:36,899 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 13:38:36,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:37,016 INFO L225 Difference]: With dead ends: 55891 [2019-12-27 13:38:37,016 INFO L226 Difference]: Without dead ends: 55651 [2019-12-27 13:38:37,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-27 13:38:37,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55651 states. [2019-12-27 13:38:38,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55651 to 45121. [2019-12-27 13:38:38,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45121 states. [2019-12-27 13:38:38,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45121 states to 45121 states and 164959 transitions. [2019-12-27 13:38:38,304 INFO L78 Accepts]: Start accepts. Automaton has 45121 states and 164959 transitions. Word has length 65 [2019-12-27 13:38:38,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:38,304 INFO L462 AbstractCegarLoop]: Abstraction has 45121 states and 164959 transitions. [2019-12-27 13:38:38,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:38:38,306 INFO L276 IsEmpty]: Start isEmpty. Operand 45121 states and 164959 transitions. [2019-12-27 13:38:38,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 13:38:38,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:38,342 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:38,343 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:38,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:38,343 INFO L82 PathProgramCache]: Analyzing trace with hash -330249588, now seen corresponding path program 1 times [2019-12-27 13:38:38,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:38,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352453896] [2019-12-27 13:38:38,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:38,423 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 13:38:38,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352453896] [2019-12-27 13:38:38,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:38,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:38:38,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071677183] [2019-12-27 13:38:38,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:38:38,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:38,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:38:38,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:38:38,426 INFO L87 Difference]: Start difference. First operand 45121 states and 164959 transitions. Second operand 4 states. [2019-12-27 13:38:39,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:39,350 INFO L93 Difference]: Finished difference Result 69403 states and 252019 transitions. [2019-12-27 13:38:39,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 13:38:39,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 13:38:39,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:39,507 INFO L225 Difference]: With dead ends: 69403 [2019-12-27 13:38:39,507 INFO L226 Difference]: Without dead ends: 69403 [2019-12-27 13:38:39,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:38:39,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69403 states. [2019-12-27 13:38:42,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69403 to 53611. [2019-12-27 13:38:42,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53611 states. [2019-12-27 13:38:42,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53611 states to 53611 states and 195428 transitions. [2019-12-27 13:38:42,915 INFO L78 Accepts]: Start accepts. Automaton has 53611 states and 195428 transitions. Word has length 66 [2019-12-27 13:38:42,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:42,915 INFO L462 AbstractCegarLoop]: Abstraction has 53611 states and 195428 transitions. [2019-12-27 13:38:42,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:38:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 53611 states and 195428 transitions. [2019-12-27 13:38:42,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 13:38:42,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:42,955 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:38:42,955 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:42,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:42,955 INFO L82 PathProgramCache]: Analyzing trace with hash 434850924, now seen corresponding path program 1 times [2019-12-27 13:38:42,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:42,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847583108] [2019-12-27 13:38:42,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:43,045 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 13:38:43,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847583108] [2019-12-27 13:38:43,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:43,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:38:43,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254311050] [2019-12-27 13:38:43,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:38:43,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:43,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:38:43,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:38:43,048 INFO L87 Difference]: Start difference. First operand 53611 states and 195428 transitions. Second operand 7 states. [2019-12-27 13:38:44,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:44,301 INFO L93 Difference]: Finished difference Result 63822 states and 228895 transitions. [2019-12-27 13:38:44,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 13:38:44,301 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 13:38:44,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:44,437 INFO L225 Difference]: With dead ends: 63822 [2019-12-27 13:38:44,437 INFO L226 Difference]: Without dead ends: 63622 [2019-12-27 13:38:44,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-12-27 13:38:44,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63622 states. [2019-12-27 13:38:45,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63622 to 54380. [2019-12-27 13:38:45,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54380 states. [2019-12-27 13:38:45,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54380 states to 54380 states and 197958 transitions. [2019-12-27 13:38:45,805 INFO L78 Accepts]: Start accepts. Automaton has 54380 states and 197958 transitions. Word has length 66 [2019-12-27 13:38:45,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:45,805 INFO L462 AbstractCegarLoop]: Abstraction has 54380 states and 197958 transitions. [2019-12-27 13:38:45,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:38:45,805 INFO L276 IsEmpty]: Start isEmpty. Operand 54380 states and 197958 transitions. [2019-12-27 13:38:45,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 13:38:45,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:45,861 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] [2019-12-27 13:38:45,861 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:45,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:45,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1137053182, now seen corresponding path program 1 times [2019-12-27 13:38:45,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:45,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519965902] [2019-12-27 13:38:45,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:45,997 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 13:38:45,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519965902] [2019-12-27 13:38:45,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:45,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:38:45,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209298238] [2019-12-27 13:38:45,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:38:45,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:45,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:38:45,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:38:45,999 INFO L87 Difference]: Start difference. First operand 54380 states and 197958 transitions. Second operand 6 states. [2019-12-27 13:38:46,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:46,778 INFO L93 Difference]: Finished difference Result 75817 states and 274672 transitions. [2019-12-27 13:38:46,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:38:46,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 13:38:46,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:47,601 INFO L225 Difference]: With dead ends: 75817 [2019-12-27 13:38:47,601 INFO L226 Difference]: Without dead ends: 75173 [2019-12-27 13:38:47,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:38:47,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75173 states. [2019-12-27 13:38:48,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75173 to 65280. [2019-12-27 13:38:48,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65280 states. [2019-12-27 13:38:48,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65280 states to 65280 states and 238125 transitions. [2019-12-27 13:38:48,777 INFO L78 Accepts]: Start accepts. Automaton has 65280 states and 238125 transitions. Word has length 68 [2019-12-27 13:38:48,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:48,777 INFO L462 AbstractCegarLoop]: Abstraction has 65280 states and 238125 transitions. [2019-12-27 13:38:48,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:38:48,778 INFO L276 IsEmpty]: Start isEmpty. Operand 65280 states and 238125 transitions. [2019-12-27 13:38:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 13:38:48,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:48,852 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] [2019-12-27 13:38:48,852 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:48,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:48,853 INFO L82 PathProgramCache]: Analyzing trace with hash 2098667199, now seen corresponding path program 1 times [2019-12-27 13:38:48,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:48,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216342334] [2019-12-27 13:38:48,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:48,955 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 13:38:48,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216342334] [2019-12-27 13:38:48,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:48,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:38:48,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834128079] [2019-12-27 13:38:48,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:38:48,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:48,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:38:48,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:38:48,957 INFO L87 Difference]: Start difference. First operand 65280 states and 238125 transitions. Second operand 7 states. [2019-12-27 13:38:50,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:50,465 INFO L93 Difference]: Finished difference Result 92241 states and 326467 transitions. [2019-12-27 13:38:50,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 13:38:50,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-27 13:38:50,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:50,671 INFO L225 Difference]: With dead ends: 92241 [2019-12-27 13:38:50,671 INFO L226 Difference]: Without dead ends: 92241 [2019-12-27 13:38:50,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 13:38:50,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92241 states. [2019-12-27 13:38:54,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92241 to 84350. [2019-12-27 13:38:54,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84350 states. [2019-12-27 13:38:54,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84350 states to 84350 states and 301234 transitions. [2019-12-27 13:38:54,750 INFO L78 Accepts]: Start accepts. Automaton has 84350 states and 301234 transitions. Word has length 68 [2019-12-27 13:38:54,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:54,751 INFO L462 AbstractCegarLoop]: Abstraction has 84350 states and 301234 transitions. [2019-12-27 13:38:54,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:38:54,751 INFO L276 IsEmpty]: Start isEmpty. Operand 84350 states and 301234 transitions. [2019-12-27 13:38:54,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 13:38:54,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:54,832 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] [2019-12-27 13:38:54,832 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:54,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:54,832 INFO L82 PathProgramCache]: Analyzing trace with hash -951535616, now seen corresponding path program 1 times [2019-12-27 13:38:54,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:54,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835007373] [2019-12-27 13:38:54,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:54,923 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 13:38:54,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835007373] [2019-12-27 13:38:54,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:54,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:38:54,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723235213] [2019-12-27 13:38:54,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:38:54,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:54,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:38:54,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:38:54,925 INFO L87 Difference]: Start difference. First operand 84350 states and 301234 transitions. Second operand 4 states. [2019-12-27 13:38:55,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:55,043 INFO L93 Difference]: Finished difference Result 19361 states and 61140 transitions. [2019-12-27 13:38:55,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 13:38:55,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-27 13:38:55,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:55,083 INFO L225 Difference]: With dead ends: 19361 [2019-12-27 13:38:55,083 INFO L226 Difference]: Without dead ends: 18883 [2019-12-27 13:38:55,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:38:55,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18883 states. [2019-12-27 13:38:55,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18883 to 18871. [2019-12-27 13:38:55,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18871 states. [2019-12-27 13:38:55,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18871 states to 18871 states and 59635 transitions. [2019-12-27 13:38:55,378 INFO L78 Accepts]: Start accepts. Automaton has 18871 states and 59635 transitions. Word has length 68 [2019-12-27 13:38:55,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:55,378 INFO L462 AbstractCegarLoop]: Abstraction has 18871 states and 59635 transitions. [2019-12-27 13:38:55,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:38:55,378 INFO L276 IsEmpty]: Start isEmpty. Operand 18871 states and 59635 transitions. [2019-12-27 13:38:55,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-27 13:38:55,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:55,394 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] [2019-12-27 13:38:55,394 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:55,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:55,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1837430218, now seen corresponding path program 1 times [2019-12-27 13:38:55,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:55,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821375473] [2019-12-27 13:38:55,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:55,449 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 13:38:55,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821375473] [2019-12-27 13:38:55,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:55,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:38:55,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189602235] [2019-12-27 13:38:55,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:38:55,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:55,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:38:55,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:38:55,453 INFO L87 Difference]: Start difference. First operand 18871 states and 59635 transitions. Second operand 4 states. [2019-12-27 13:38:55,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:55,752 INFO L93 Difference]: Finished difference Result 24271 states and 75815 transitions. [2019-12-27 13:38:55,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 13:38:55,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-12-27 13:38:55,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:55,788 INFO L225 Difference]: With dead ends: 24271 [2019-12-27 13:38:55,789 INFO L226 Difference]: Without dead ends: 24271 [2019-12-27 13:38:55,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 13:38:55,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24271 states. [2019-12-27 13:38:56,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24271 to 19783. [2019-12-27 13:38:56,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19783 states. [2019-12-27 13:38:56,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19783 states to 19783 states and 62293 transitions. [2019-12-27 13:38:56,668 INFO L78 Accepts]: Start accepts. Automaton has 19783 states and 62293 transitions. Word has length 78 [2019-12-27 13:38:56,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:56,668 INFO L462 AbstractCegarLoop]: Abstraction has 19783 states and 62293 transitions. [2019-12-27 13:38:56,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:38:56,669 INFO L276 IsEmpty]: Start isEmpty. Operand 19783 states and 62293 transitions. [2019-12-27 13:38:56,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-27 13:38:56,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:56,690 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] [2019-12-27 13:38:56,691 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:56,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:56,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1582693673, now seen corresponding path program 1 times [2019-12-27 13:38:56,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:56,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772346672] [2019-12-27 13:38:56,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:56,779 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 13:38:56,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772346672] [2019-12-27 13:38:56,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:56,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 13:38:56,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481859799] [2019-12-27 13:38:56,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 13:38:56,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:56,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 13:38:56,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:38:56,782 INFO L87 Difference]: Start difference. First operand 19783 states and 62293 transitions. Second operand 8 states. [2019-12-27 13:38:57,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:57,968 INFO L93 Difference]: Finished difference Result 21937 states and 68541 transitions. [2019-12-27 13:38:57,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 13:38:57,968 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2019-12-27 13:38:57,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:58,013 INFO L225 Difference]: With dead ends: 21937 [2019-12-27 13:38:58,014 INFO L226 Difference]: Without dead ends: 21889 [2019-12-27 13:38:58,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-12-27 13:38:58,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21889 states. [2019-12-27 13:38:58,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21889 to 17452. [2019-12-27 13:38:58,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17452 states. [2019-12-27 13:38:58,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17452 states to 17452 states and 55312 transitions. [2019-12-27 13:38:58,289 INFO L78 Accepts]: Start accepts. Automaton has 17452 states and 55312 transitions. Word has length 78 [2019-12-27 13:38:58,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:58,289 INFO L462 AbstractCegarLoop]: Abstraction has 17452 states and 55312 transitions. [2019-12-27 13:38:58,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 13:38:58,289 INFO L276 IsEmpty]: Start isEmpty. Operand 17452 states and 55312 transitions. [2019-12-27 13:38:58,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-27 13:38:58,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:58,305 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] [2019-12-27 13:38:58,305 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:58,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:58,306 INFO L82 PathProgramCache]: Analyzing trace with hash -286863040, now seen corresponding path program 1 times [2019-12-27 13:38:58,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:58,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17635360] [2019-12-27 13:38:58,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:58,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:38:58,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17635360] [2019-12-27 13:38:58,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:58,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 13:38:58,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656429148] [2019-12-27 13:38:58,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 13:38:58,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:58,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 13:38:58,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:38:58,347 INFO L87 Difference]: Start difference. First operand 17452 states and 55312 transitions. Second operand 3 states. [2019-12-27 13:38:58,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:58,591 INFO L93 Difference]: Finished difference Result 18716 states and 59025 transitions. [2019-12-27 13:38:58,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 13:38:58,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-12-27 13:38:58,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:58,622 INFO L225 Difference]: With dead ends: 18716 [2019-12-27 13:38:58,622 INFO L226 Difference]: Without dead ends: 18716 [2019-12-27 13:38:58,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:38:58,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18716 states. [2019-12-27 13:38:58,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18716 to 18068. [2019-12-27 13:38:58,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18068 states. [2019-12-27 13:38:58,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18068 states to 18068 states and 57126 transitions. [2019-12-27 13:38:58,888 INFO L78 Accepts]: Start accepts. Automaton has 18068 states and 57126 transitions. Word has length 79 [2019-12-27 13:38:58,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:38:58,888 INFO L462 AbstractCegarLoop]: Abstraction has 18068 states and 57126 transitions. [2019-12-27 13:38:58,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 13:38:58,888 INFO L276 IsEmpty]: Start isEmpty. Operand 18068 states and 57126 transitions. [2019-12-27 13:38:58,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-27 13:38:58,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:38:58,907 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] [2019-12-27 13:38:58,907 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:38:58,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:38:58,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1882330754, now seen corresponding path program 1 times [2019-12-27 13:38:58,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:38:58,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211024296] [2019-12-27 13:38:58,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:38:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:38:58,977 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 13:38:58,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211024296] [2019-12-27 13:38:58,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:38:58,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 13:38:58,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864979005] [2019-12-27 13:38:58,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 13:38:58,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:38:58,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 13:38:58,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:38:58,979 INFO L87 Difference]: Start difference. First operand 18068 states and 57126 transitions. Second operand 4 states. [2019-12-27 13:38:59,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:38:59,288 INFO L93 Difference]: Finished difference Result 21236 states and 66256 transitions. [2019-12-27 13:38:59,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 13:38:59,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-27 13:38:59,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:38:59,321 INFO L225 Difference]: With dead ends: 21236 [2019-12-27 13:38:59,321 INFO L226 Difference]: Without dead ends: 21236 [2019-12-27 13:38:59,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 13:38:59,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21236 states. [2019-12-27 13:39:00,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21236 to 20213. [2019-12-27 13:39:00,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20213 states. [2019-12-27 13:39:00,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20213 states to 20213 states and 63372 transitions. [2019-12-27 13:39:00,603 INFO L78 Accepts]: Start accepts. Automaton has 20213 states and 63372 transitions. Word has length 80 [2019-12-27 13:39:00,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:00,603 INFO L462 AbstractCegarLoop]: Abstraction has 20213 states and 63372 transitions. [2019-12-27 13:39:00,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 13:39:00,603 INFO L276 IsEmpty]: Start isEmpty. Operand 20213 states and 63372 transitions. [2019-12-27 13:39:00,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-27 13:39:00,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:00,625 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 13:39:00,626 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:00,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:00,626 INFO L82 PathProgramCache]: Analyzing trace with hash 476976255, now seen corresponding path program 1 times [2019-12-27 13:39:00,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:00,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009571816] [2019-12-27 13:39:00,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:00,658 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 13:39:00,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009571816] [2019-12-27 13:39:00,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:00,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 13:39:00,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581039911] [2019-12-27 13:39:00,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 13:39:00,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:00,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 13:39:00,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:39:00,660 INFO L87 Difference]: Start difference. First operand 20213 states and 63372 transitions. Second operand 3 states. [2019-12-27 13:39:00,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:00,911 INFO L93 Difference]: Finished difference Result 21556 states and 67295 transitions. [2019-12-27 13:39:00,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 13:39:00,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-12-27 13:39:00,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:00,944 INFO L225 Difference]: With dead ends: 21556 [2019-12-27 13:39:00,945 INFO L226 Difference]: Without dead ends: 21556 [2019-12-27 13:39:00,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 13:39:00,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21556 states. [2019-12-27 13:39:01,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21556 to 20893. [2019-12-27 13:39:01,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20893 states. [2019-12-27 13:39:01,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20893 states to 20893 states and 65352 transitions. [2019-12-27 13:39:01,238 INFO L78 Accepts]: Start accepts. Automaton has 20893 states and 65352 transitions. Word has length 80 [2019-12-27 13:39:01,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:01,239 INFO L462 AbstractCegarLoop]: Abstraction has 20893 states and 65352 transitions. [2019-12-27 13:39:01,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 13:39:01,239 INFO L276 IsEmpty]: Start isEmpty. Operand 20893 states and 65352 transitions. [2019-12-27 13:39:01,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-27 13:39:01,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:01,263 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] [2019-12-27 13:39:01,263 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:01,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:01,263 INFO L82 PathProgramCache]: Analyzing trace with hash 286965984, now seen corresponding path program 1 times [2019-12-27 13:39:01,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:01,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757993385] [2019-12-27 13:39:01,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:01,383 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 13:39:01,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757993385] [2019-12-27 13:39:01,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:01,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:39:01,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746024023] [2019-12-27 13:39:01,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:39:01,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:01,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:39:01,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:39:01,386 INFO L87 Difference]: Start difference. First operand 20893 states and 65352 transitions. Second operand 6 states. [2019-12-27 13:39:02,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:02,166 INFO L93 Difference]: Finished difference Result 29926 states and 92023 transitions. [2019-12-27 13:39:02,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 13:39:02,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-12-27 13:39:02,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:02,213 INFO L225 Difference]: With dead ends: 29926 [2019-12-27 13:39:02,214 INFO L226 Difference]: Without dead ends: 29620 [2019-12-27 13:39:02,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 13:39:02,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29620 states. [2019-12-27 13:39:02,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29620 to 23908. [2019-12-27 13:39:02,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23908 states. [2019-12-27 13:39:02,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23908 states to 23908 states and 74649 transitions. [2019-12-27 13:39:02,589 INFO L78 Accepts]: Start accepts. Automaton has 23908 states and 74649 transitions. Word has length 81 [2019-12-27 13:39:02,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:02,589 INFO L462 AbstractCegarLoop]: Abstraction has 23908 states and 74649 transitions. [2019-12-27 13:39:02,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:39:02,590 INFO L276 IsEmpty]: Start isEmpty. Operand 23908 states and 74649 transitions. [2019-12-27 13:39:02,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-27 13:39:02,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:02,612 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] [2019-12-27 13:39:02,613 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:02,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:02,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1248580001, now seen corresponding path program 1 times [2019-12-27 13:39:02,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:02,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856162260] [2019-12-27 13:39:02,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:02,698 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 13:39:02,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856162260] [2019-12-27 13:39:02,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:02,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:39:02,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107618006] [2019-12-27 13:39:02,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:39:02,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:02,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:39:02,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:39:02,701 INFO L87 Difference]: Start difference. First operand 23908 states and 74649 transitions. Second operand 7 states. [2019-12-27 13:39:03,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:03,990 INFO L93 Difference]: Finished difference Result 41338 states and 124799 transitions. [2019-12-27 13:39:03,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 13:39:03,990 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-12-27 13:39:03,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:04,060 INFO L225 Difference]: With dead ends: 41338 [2019-12-27 13:39:04,061 INFO L226 Difference]: Without dead ends: 41266 [2019-12-27 13:39:04,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-27 13:39:04,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41266 states. [2019-12-27 13:39:04,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41266 to 25666. [2019-12-27 13:39:04,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25666 states. [2019-12-27 13:39:04,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25666 states to 25666 states and 78735 transitions. [2019-12-27 13:39:04,778 INFO L78 Accepts]: Start accepts. Automaton has 25666 states and 78735 transitions. Word has length 81 [2019-12-27 13:39:04,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:04,778 INFO L462 AbstractCegarLoop]: Abstraction has 25666 states and 78735 transitions. [2019-12-27 13:39:04,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:39:04,778 INFO L276 IsEmpty]: Start isEmpty. Operand 25666 states and 78735 transitions. [2019-12-27 13:39:04,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-27 13:39:04,799 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:04,799 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] [2019-12-27 13:39:04,799 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:04,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:04,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1471857053, now seen corresponding path program 1 times [2019-12-27 13:39:04,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:04,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093312035] [2019-12-27 13:39:04,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:04,874 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 13:39:04,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093312035] [2019-12-27 13:39:04,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:04,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:39:04,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146310911] [2019-12-27 13:39:04,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:39:04,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:04,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:39:04,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:39:04,876 INFO L87 Difference]: Start difference. First operand 25666 states and 78735 transitions. Second operand 6 states. [2019-12-27 13:39:05,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:05,322 INFO L93 Difference]: Finished difference Result 39156 states and 120109 transitions. [2019-12-27 13:39:05,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:39:05,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-12-27 13:39:05,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:05,379 INFO L225 Difference]: With dead ends: 39156 [2019-12-27 13:39:05,379 INFO L226 Difference]: Without dead ends: 39156 [2019-12-27 13:39:05,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:39:05,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39156 states. [2019-12-27 13:39:05,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39156 to 25377. [2019-12-27 13:39:05,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25377 states. [2019-12-27 13:39:05,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25377 states to 25377 states and 77387 transitions. [2019-12-27 13:39:05,792 INFO L78 Accepts]: Start accepts. Automaton has 25377 states and 77387 transitions. Word has length 81 [2019-12-27 13:39:05,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:05,792 INFO L462 AbstractCegarLoop]: Abstraction has 25377 states and 77387 transitions. [2019-12-27 13:39:05,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:39:05,793 INFO L276 IsEmpty]: Start isEmpty. Operand 25377 states and 77387 transitions. [2019-12-27 13:39:05,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-27 13:39:05,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:05,814 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] [2019-12-27 13:39:05,814 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:05,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:05,814 INFO L82 PathProgramCache]: Analyzing trace with hash -991140637, now seen corresponding path program 1 times [2019-12-27 13:39:05,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:05,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505465038] [2019-12-27 13:39:05,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:05,903 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 13:39:05,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505465038] [2019-12-27 13:39:05,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:05,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:39:05,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399714866] [2019-12-27 13:39:05,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:39:05,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:05,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:39:05,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:39:05,905 INFO L87 Difference]: Start difference. First operand 25377 states and 77387 transitions. Second operand 7 states. [2019-12-27 13:39:07,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:07,004 INFO L93 Difference]: Finished difference Result 31557 states and 94596 transitions. [2019-12-27 13:39:07,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 13:39:07,005 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-12-27 13:39:07,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:07,065 INFO L225 Difference]: With dead ends: 31557 [2019-12-27 13:39:07,066 INFO L226 Difference]: Without dead ends: 31557 [2019-12-27 13:39:07,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-27 13:39:07,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31557 states. [2019-12-27 13:39:07,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31557 to 27312. [2019-12-27 13:39:07,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27312 states. [2019-12-27 13:39:07,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27312 states to 27312 states and 83150 transitions. [2019-12-27 13:39:07,817 INFO L78 Accepts]: Start accepts. Automaton has 27312 states and 83150 transitions. Word has length 81 [2019-12-27 13:39:07,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:07,817 INFO L462 AbstractCegarLoop]: Abstraction has 27312 states and 83150 transitions. [2019-12-27 13:39:07,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:39:07,817 INFO L276 IsEmpty]: Start isEmpty. Operand 27312 states and 83150 transitions. [2019-12-27 13:39:07,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-27 13:39:07,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:07,840 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] [2019-12-27 13:39:07,840 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:07,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:07,841 INFO L82 PathProgramCache]: Analyzing trace with hash 253623844, now seen corresponding path program 1 times [2019-12-27 13:39:07,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:07,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478329062] [2019-12-27 13:39:07,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:07,967 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 13:39:07,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478329062] [2019-12-27 13:39:07,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:07,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:39:07,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492946528] [2019-12-27 13:39:07,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:39:07,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:07,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:39:07,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:39:07,970 INFO L87 Difference]: Start difference. First operand 27312 states and 83150 transitions. Second operand 6 states. [2019-12-27 13:39:08,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:08,164 INFO L93 Difference]: Finished difference Result 27250 states and 82976 transitions. [2019-12-27 13:39:08,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 13:39:08,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-12-27 13:39:08,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:08,202 INFO L225 Difference]: With dead ends: 27250 [2019-12-27 13:39:08,202 INFO L226 Difference]: Without dead ends: 27250 [2019-12-27 13:39:08,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:39:08,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27250 states. [2019-12-27 13:39:08,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27250 to 27250. [2019-12-27 13:39:08,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27250 states. [2019-12-27 13:39:08,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27250 states to 27250 states and 82976 transitions. [2019-12-27 13:39:08,551 INFO L78 Accepts]: Start accepts. Automaton has 27250 states and 82976 transitions. Word has length 81 [2019-12-27 13:39:08,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:08,551 INFO L462 AbstractCegarLoop]: Abstraction has 27250 states and 82976 transitions. [2019-12-27 13:39:08,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:39:08,552 INFO L276 IsEmpty]: Start isEmpty. Operand 27250 states and 82976 transitions. [2019-12-27 13:39:08,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-27 13:39:08,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:08,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, 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 13:39:08,574 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:08,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:08,574 INFO L82 PathProgramCache]: Analyzing trace with hash -305951838, now seen corresponding path program 1 times [2019-12-27 13:39:08,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:08,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692553172] [2019-12-27 13:39:08,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:08,662 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 13:39:08,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692553172] [2019-12-27 13:39:08,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:08,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:39:08,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123397602] [2019-12-27 13:39:08,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:39:08,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:08,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:39:08,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:39:08,664 INFO L87 Difference]: Start difference. First operand 27250 states and 82976 transitions. Second operand 6 states. [2019-12-27 13:39:09,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:09,495 INFO L93 Difference]: Finished difference Result 40321 states and 121816 transitions. [2019-12-27 13:39:09,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:39:09,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-12-27 13:39:09,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:09,556 INFO L225 Difference]: With dead ends: 40321 [2019-12-27 13:39:09,556 INFO L226 Difference]: Without dead ends: 40321 [2019-12-27 13:39:09,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 13:39:09,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40321 states. [2019-12-27 13:39:09,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40321 to 28828. [2019-12-27 13:39:09,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28828 states. [2019-12-27 13:39:10,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28828 states to 28828 states and 87715 transitions. [2019-12-27 13:39:10,019 INFO L78 Accepts]: Start accepts. Automaton has 28828 states and 87715 transitions. Word has length 81 [2019-12-27 13:39:10,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:10,019 INFO L462 AbstractCegarLoop]: Abstraction has 28828 states and 87715 transitions. [2019-12-27 13:39:10,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:39:10,019 INFO L276 IsEmpty]: Start isEmpty. Operand 28828 states and 87715 transitions. [2019-12-27 13:39:10,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-27 13:39:10,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:10,046 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] [2019-12-27 13:39:10,046 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:10,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:10,046 INFO L82 PathProgramCache]: Analyzing trace with hash 938812643, now seen corresponding path program 1 times [2019-12-27 13:39:10,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:10,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009655252] [2019-12-27 13:39:10,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:10,142 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 13:39:10,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009655252] [2019-12-27 13:39:10,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:10,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:39:10,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937945266] [2019-12-27 13:39:10,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:39:10,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:10,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:39:10,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:39:10,144 INFO L87 Difference]: Start difference. First operand 28828 states and 87715 transitions. Second operand 5 states. [2019-12-27 13:39:10,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:10,498 INFO L93 Difference]: Finished difference Result 28747 states and 87427 transitions. [2019-12-27 13:39:10,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 13:39:10,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-12-27 13:39:10,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:10,571 INFO L225 Difference]: With dead ends: 28747 [2019-12-27 13:39:10,572 INFO L226 Difference]: Without dead ends: 28747 [2019-12-27 13:39:10,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:39:10,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28747 states. [2019-12-27 13:39:11,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28747 to 28702. [2019-12-27 13:39:11,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28702 states. [2019-12-27 13:39:11,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28702 states to 28702 states and 87307 transitions. [2019-12-27 13:39:11,438 INFO L78 Accepts]: Start accepts. Automaton has 28702 states and 87307 transitions. Word has length 81 [2019-12-27 13:39:11,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:11,438 INFO L462 AbstractCegarLoop]: Abstraction has 28702 states and 87307 transitions. [2019-12-27 13:39:11,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:39:11,438 INFO L276 IsEmpty]: Start isEmpty. Operand 28702 states and 87307 transitions. [2019-12-27 13:39:11,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-27 13:39:11,463 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:11,463 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] [2019-12-27 13:39:11,464 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:11,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:11,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1900426660, now seen corresponding path program 1 times [2019-12-27 13:39:11,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:11,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920133776] [2019-12-27 13:39:11,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:11,536 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 13:39:11,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920133776] [2019-12-27 13:39:11,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:11,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:39:11,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537115057] [2019-12-27 13:39:11,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:39:11,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:11,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:39:11,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:39:11,539 INFO L87 Difference]: Start difference. First operand 28702 states and 87307 transitions. Second operand 5 states. [2019-12-27 13:39:11,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:11,743 INFO L93 Difference]: Finished difference Result 40057 states and 121690 transitions. [2019-12-27 13:39:11,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 13:39:11,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-12-27 13:39:11,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:11,805 INFO L225 Difference]: With dead ends: 40057 [2019-12-27 13:39:11,805 INFO L226 Difference]: Without dead ends: 40057 [2019-12-27 13:39:11,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:39:11,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40057 states. [2019-12-27 13:39:12,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40057 to 25282. [2019-12-27 13:39:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25282 states. [2019-12-27 13:39:12,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25282 states to 25282 states and 75960 transitions. [2019-12-27 13:39:12,220 INFO L78 Accepts]: Start accepts. Automaton has 25282 states and 75960 transitions. Word has length 81 [2019-12-27 13:39:12,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:12,220 INFO L462 AbstractCegarLoop]: Abstraction has 25282 states and 75960 transitions. [2019-12-27 13:39:12,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:39:12,220 INFO L276 IsEmpty]: Start isEmpty. Operand 25282 states and 75960 transitions. [2019-12-27 13:39:12,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-27 13:39:12,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:12,241 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] [2019-12-27 13:39:12,241 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:12,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:12,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1913824220, now seen corresponding path program 1 times [2019-12-27 13:39:12,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:12,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550172157] [2019-12-27 13:39:12,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:12,318 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 13:39:12,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550172157] [2019-12-27 13:39:12,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:12,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:39:12,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211366296] [2019-12-27 13:39:12,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:39:12,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:12,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:39:12,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:39:12,321 INFO L87 Difference]: Start difference. First operand 25282 states and 75960 transitions. Second operand 5 states. [2019-12-27 13:39:12,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:12,366 INFO L93 Difference]: Finished difference Result 3064 states and 7430 transitions. [2019-12-27 13:39:12,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 13:39:12,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-12-27 13:39:12,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:12,371 INFO L225 Difference]: With dead ends: 3064 [2019-12-27 13:39:12,371 INFO L226 Difference]: Without dead ends: 2668 [2019-12-27 13:39:12,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:39:12,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2668 states. [2019-12-27 13:39:12,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2668 to 2424. [2019-12-27 13:39:12,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2424 states. [2019-12-27 13:39:12,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2424 states to 2424 states and 5875 transitions. [2019-12-27 13:39:12,407 INFO L78 Accepts]: Start accepts. Automaton has 2424 states and 5875 transitions. Word has length 81 [2019-12-27 13:39:12,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:12,407 INFO L462 AbstractCegarLoop]: Abstraction has 2424 states and 5875 transitions. [2019-12-27 13:39:12,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:39:12,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2424 states and 5875 transitions. [2019-12-27 13:39:12,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:39:12,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:12,409 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] [2019-12-27 13:39:12,410 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:12,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:12,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1212257335, now seen corresponding path program 1 times [2019-12-27 13:39:12,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:12,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057985610] [2019-12-27 13:39:12,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:12,512 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 13:39:12,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057985610] [2019-12-27 13:39:12,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:12,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:39:12,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708341873] [2019-12-27 13:39:12,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:39:12,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:12,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:39:12,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:39:12,514 INFO L87 Difference]: Start difference. First operand 2424 states and 5875 transitions. Second operand 6 states. [2019-12-27 13:39:12,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:12,629 INFO L93 Difference]: Finished difference Result 2655 states and 6264 transitions. [2019-12-27 13:39:12,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:39:12,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-27 13:39:12,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:12,635 INFO L225 Difference]: With dead ends: 2655 [2019-12-27 13:39:12,635 INFO L226 Difference]: Without dead ends: 2610 [2019-12-27 13:39:12,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:39:12,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2019-12-27 13:39:12,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2463. [2019-12-27 13:39:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2463 states. [2019-12-27 13:39:12,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 5897 transitions. [2019-12-27 13:39:12,685 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 5897 transitions. Word has length 93 [2019-12-27 13:39:12,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:12,685 INFO L462 AbstractCegarLoop]: Abstraction has 2463 states and 5897 transitions. [2019-12-27 13:39:12,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:39:12,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 5897 transitions. [2019-12-27 13:39:12,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:39:12,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:12,690 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] [2019-12-27 13:39:12,690 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:12,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:12,691 INFO L82 PathProgramCache]: Analyzing trace with hash -419839496, now seen corresponding path program 1 times [2019-12-27 13:39:12,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:12,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67946488] [2019-12-27 13:39:12,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:12,765 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 13:39:12,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67946488] [2019-12-27 13:39:12,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:12,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:39:12,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033206555] [2019-12-27 13:39:12,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:39:12,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:12,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:39:12,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:39:12,767 INFO L87 Difference]: Start difference. First operand 2463 states and 5897 transitions. Second operand 5 states. [2019-12-27 13:39:13,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:13,052 INFO L93 Difference]: Finished difference Result 2771 states and 6550 transitions. [2019-12-27 13:39:13,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:39:13,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-12-27 13:39:13,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:13,058 INFO L225 Difference]: With dead ends: 2771 [2019-12-27 13:39:13,058 INFO L226 Difference]: Without dead ends: 2753 [2019-12-27 13:39:13,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:39:13,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2753 states. [2019-12-27 13:39:13,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2753 to 2534. [2019-12-27 13:39:13,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2534 states. [2019-12-27 13:39:13,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2534 states to 2534 states and 6039 transitions. [2019-12-27 13:39:13,104 INFO L78 Accepts]: Start accepts. Automaton has 2534 states and 6039 transitions. Word has length 93 [2019-12-27 13:39:13,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:13,105 INFO L462 AbstractCegarLoop]: Abstraction has 2534 states and 6039 transitions. [2019-12-27 13:39:13,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:39:13,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2534 states and 6039 transitions. [2019-12-27 13:39:13,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:39:13,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:13,108 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] [2019-12-27 13:39:13,108 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:13,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:13,109 INFO L82 PathProgramCache]: Analyzing trace with hash 2092638256, now seen corresponding path program 2 times [2019-12-27 13:39:13,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:13,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252346571] [2019-12-27 13:39:13,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:13,200 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 13:39:13,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252346571] [2019-12-27 13:39:13,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:13,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:39:13,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421299532] [2019-12-27 13:39:13,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:39:13,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:13,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:39:13,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:39:13,202 INFO L87 Difference]: Start difference. First operand 2534 states and 6039 transitions. Second operand 6 states. [2019-12-27 13:39:13,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:13,443 INFO L93 Difference]: Finished difference Result 3366 states and 7918 transitions. [2019-12-27 13:39:13,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:39:13,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-27 13:39:13,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:13,449 INFO L225 Difference]: With dead ends: 3366 [2019-12-27 13:39:13,449 INFO L226 Difference]: Without dead ends: 3330 [2019-12-27 13:39:13,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:39:13,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3330 states. [2019-12-27 13:39:13,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3330 to 2810. [2019-12-27 13:39:13,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2810 states. [2019-12-27 13:39:13,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 6664 transitions. [2019-12-27 13:39:13,493 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 6664 transitions. Word has length 93 [2019-12-27 13:39:13,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:13,493 INFO L462 AbstractCegarLoop]: Abstraction has 2810 states and 6664 transitions. [2019-12-27 13:39:13,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:39:13,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 6664 transitions. [2019-12-27 13:39:13,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:39:13,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:13,497 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] [2019-12-27 13:39:13,497 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:13,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:13,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1809487792, now seen corresponding path program 1 times [2019-12-27 13:39:13,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:13,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408431907] [2019-12-27 13:39:13,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:13,587 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 13:39:13,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408431907] [2019-12-27 13:39:13,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:13,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 13:39:13,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501235819] [2019-12-27 13:39:13,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 13:39:13,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:13,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 13:39:13,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:39:13,590 INFO L87 Difference]: Start difference. First operand 2810 states and 6664 transitions. Second operand 7 states. [2019-12-27 13:39:13,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:13,987 INFO L93 Difference]: Finished difference Result 5429 states and 13161 transitions. [2019-12-27 13:39:13,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 13:39:13,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-12-27 13:39:13,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:13,995 INFO L225 Difference]: With dead ends: 5429 [2019-12-27 13:39:13,995 INFO L226 Difference]: Without dead ends: 5429 [2019-12-27 13:39:13,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-27 13:39:14,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5429 states. [2019-12-27 13:39:14,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5429 to 2937. [2019-12-27 13:39:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2937 states. [2019-12-27 13:39:14,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2937 states to 2937 states and 6972 transitions. [2019-12-27 13:39:14,050 INFO L78 Accepts]: Start accepts. Automaton has 2937 states and 6972 transitions. Word has length 93 [2019-12-27 13:39:14,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:14,050 INFO L462 AbstractCegarLoop]: Abstraction has 2937 states and 6972 transitions. [2019-12-27 13:39:14,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 13:39:14,051 INFO L276 IsEmpty]: Start isEmpty. Operand 2937 states and 6972 transitions. [2019-12-27 13:39:14,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:39:14,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:14,053 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] [2019-12-27 13:39:14,053 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:14,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:14,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1240715023, now seen corresponding path program 1 times [2019-12-27 13:39:14,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:14,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224164555] [2019-12-27 13:39:14,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:14,147 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 13:39:14,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224164555] [2019-12-27 13:39:14,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:14,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:39:14,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186339200] [2019-12-27 13:39:14,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:39:14,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:14,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:39:14,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:39:14,149 INFO L87 Difference]: Start difference. First operand 2937 states and 6972 transitions. Second operand 6 states. [2019-12-27 13:39:14,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:14,211 INFO L93 Difference]: Finished difference Result 4592 states and 11122 transitions. [2019-12-27 13:39:14,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 13:39:14,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-27 13:39:14,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:14,219 INFO L225 Difference]: With dead ends: 4592 [2019-12-27 13:39:14,219 INFO L226 Difference]: Without dead ends: 4592 [2019-12-27 13:39:14,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:39:14,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4592 states. [2019-12-27 13:39:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4592 to 2900. [2019-12-27 13:39:14,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2900 states. [2019-12-27 13:39:14,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 6836 transitions. [2019-12-27 13:39:14,271 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 6836 transitions. Word has length 93 [2019-12-27 13:39:14,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:14,272 INFO L462 AbstractCegarLoop]: Abstraction has 2900 states and 6836 transitions. [2019-12-27 13:39:14,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:39:14,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 6836 transitions. [2019-12-27 13:39:14,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-27 13:39:14,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:14,276 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] [2019-12-27 13:39:14,276 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:14,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:14,276 INFO L82 PathProgramCache]: Analyzing trace with hash -759998607, now seen corresponding path program 1 times [2019-12-27 13:39:14,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:14,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361463905] [2019-12-27 13:39:14,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:14,389 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 13:39:14,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361463905] [2019-12-27 13:39:14,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:14,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:39:14,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307117274] [2019-12-27 13:39:14,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:39:14,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:14,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:39:14,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:39:14,393 INFO L87 Difference]: Start difference. First operand 2900 states and 6836 transitions. Second operand 6 states. [2019-12-27 13:39:14,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:14,637 INFO L93 Difference]: Finished difference Result 2729 states and 6293 transitions. [2019-12-27 13:39:14,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:39:14,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-27 13:39:14,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:14,642 INFO L225 Difference]: With dead ends: 2729 [2019-12-27 13:39:14,642 INFO L226 Difference]: Without dead ends: 2729 [2019-12-27 13:39:14,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:39:14,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2019-12-27 13:39:14,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 1987. [2019-12-27 13:39:14,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1987 states. [2019-12-27 13:39:14,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 4681 transitions. [2019-12-27 13:39:14,685 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 4681 transitions. Word has length 93 [2019-12-27 13:39:14,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:14,685 INFO L462 AbstractCegarLoop]: Abstraction has 1987 states and 4681 transitions. [2019-12-27 13:39:14,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:39:14,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 4681 transitions. [2019-12-27 13:39:14,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:39:14,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:14,689 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 13:39:14,690 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:14,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:14,690 INFO L82 PathProgramCache]: Analyzing trace with hash 469539040, now seen corresponding path program 1 times [2019-12-27 13:39:14,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:14,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907737894] [2019-12-27 13:39:14,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:14,840 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 13:39:14,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907737894] [2019-12-27 13:39:14,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:14,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:39:14,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130638838] [2019-12-27 13:39:14,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:39:14,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:14,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:39:14,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:39:14,843 INFO L87 Difference]: Start difference. First operand 1987 states and 4681 transitions. Second operand 6 states. [2019-12-27 13:39:15,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:15,074 INFO L93 Difference]: Finished difference Result 2215 states and 5077 transitions. [2019-12-27 13:39:15,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 13:39:15,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-27 13:39:15,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:15,077 INFO L225 Difference]: With dead ends: 2215 [2019-12-27 13:39:15,078 INFO L226 Difference]: Without dead ends: 2215 [2019-12-27 13:39:15,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 13:39:15,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2019-12-27 13:39:15,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 2019. [2019-12-27 13:39:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2019 states. [2019-12-27 13:39:15,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 4705 transitions. [2019-12-27 13:39:15,110 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 4705 transitions. Word has length 95 [2019-12-27 13:39:15,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:15,110 INFO L462 AbstractCegarLoop]: Abstraction has 2019 states and 4705 transitions. [2019-12-27 13:39:15,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:39:15,110 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 4705 transitions. [2019-12-27 13:39:15,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:39:15,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:15,113 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 13:39:15,113 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:15,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:15,114 INFO L82 PathProgramCache]: Analyzing trace with hash 593612287, now seen corresponding path program 1 times [2019-12-27 13:39:15,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:15,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319281102] [2019-12-27 13:39:15,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:15,219 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 13:39:15,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319281102] [2019-12-27 13:39:15,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:15,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 13:39:15,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623214793] [2019-12-27 13:39:15,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 13:39:15,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:15,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 13:39:15,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 13:39:15,221 INFO L87 Difference]: Start difference. First operand 2019 states and 4705 transitions. Second operand 5 states. [2019-12-27 13:39:15,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:15,434 INFO L93 Difference]: Finished difference Result 2271 states and 5284 transitions. [2019-12-27 13:39:15,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 13:39:15,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-27 13:39:15,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:15,440 INFO L225 Difference]: With dead ends: 2271 [2019-12-27 13:39:15,440 INFO L226 Difference]: Without dead ends: 2253 [2019-12-27 13:39:15,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 13:39:15,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2019-12-27 13:39:15,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 2046. [2019-12-27 13:39:15,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2046 states. [2019-12-27 13:39:15,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 4759 transitions. [2019-12-27 13:39:15,482 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 4759 transitions. Word has length 95 [2019-12-27 13:39:15,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:15,483 INFO L462 AbstractCegarLoop]: Abstraction has 2046 states and 4759 transitions. [2019-12-27 13:39:15,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 13:39:15,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 4759 transitions. [2019-12-27 13:39:15,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:39:15,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:15,487 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 13:39:15,487 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:15,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:15,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1838376768, now seen corresponding path program 1 times [2019-12-27 13:39:15,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:15,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740779125] [2019-12-27 13:39:15,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:15,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 13:39:15,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740779125] [2019-12-27 13:39:15,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:15,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 13:39:15,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210276693] [2019-12-27 13:39:15,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 13:39:15,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:15,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 13:39:15,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 13:39:15,582 INFO L87 Difference]: Start difference. First operand 2046 states and 4759 transitions. Second operand 6 states. [2019-12-27 13:39:15,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:15,683 INFO L93 Difference]: Finished difference Result 2123 states and 4906 transitions. [2019-12-27 13:39:15,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:39:15,684 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-27 13:39:15,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:15,687 INFO L225 Difference]: With dead ends: 2123 [2019-12-27 13:39:15,687 INFO L226 Difference]: Without dead ends: 2123 [2019-12-27 13:39:15,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:39:15,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2019-12-27 13:39:15,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2020. [2019-12-27 13:39:15,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2020 states. [2019-12-27 13:39:15,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 4707 transitions. [2019-12-27 13:39:15,719 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 4707 transitions. Word has length 95 [2019-12-27 13:39:15,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:15,720 INFO L462 AbstractCegarLoop]: Abstraction has 2020 states and 4707 transitions. [2019-12-27 13:39:15,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 13:39:15,720 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 4707 transitions. [2019-12-27 13:39:15,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:39:15,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:15,724 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 13:39:15,724 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:15,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:15,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1806431583, now seen corresponding path program 1 times [2019-12-27 13:39:15,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:15,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233975272] [2019-12-27 13:39:15,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:15,946 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 13:39:15,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233975272] [2019-12-27 13:39:15,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:15,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 13:39:15,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47600523] [2019-12-27 13:39:15,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 13:39:15,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:15,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 13:39:15,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 13:39:15,949 INFO L87 Difference]: Start difference. First operand 2020 states and 4707 transitions. Second operand 8 states. [2019-12-27 13:39:16,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:16,100 INFO L93 Difference]: Finished difference Result 3367 states and 7933 transitions. [2019-12-27 13:39:16,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 13:39:16,101 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-27 13:39:16,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:16,103 INFO L225 Difference]: With dead ends: 3367 [2019-12-27 13:39:16,104 INFO L226 Difference]: Without dead ends: 1535 [2019-12-27 13:39:16,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-27 13:39:16,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2019-12-27 13:39:16,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1455. [2019-12-27 13:39:16,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1455 states. [2019-12-27 13:39:16,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1455 states to 1455 states and 3420 transitions. [2019-12-27 13:39:16,132 INFO L78 Accepts]: Start accepts. Automaton has 1455 states and 3420 transitions. Word has length 95 [2019-12-27 13:39:16,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:16,132 INFO L462 AbstractCegarLoop]: Abstraction has 1455 states and 3420 transitions. [2019-12-27 13:39:16,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 13:39:16,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1455 states and 3420 transitions. [2019-12-27 13:39:16,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:39:16,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:16,136 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 13:39:16,136 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:16,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:16,137 INFO L82 PathProgramCache]: Analyzing trace with hash -2061196609, now seen corresponding path program 2 times [2019-12-27 13:39:16,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:16,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108367949] [2019-12-27 13:39:16,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 13:39:16,432 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 13:39:16,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108367949] [2019-12-27 13:39:16,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 13:39:16,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 13:39:16,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600842284] [2019-12-27 13:39:16,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 13:39:16,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 13:39:16,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 13:39:16,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-27 13:39:16,434 INFO L87 Difference]: Start difference. First operand 1455 states and 3420 transitions. Second operand 11 states. [2019-12-27 13:39:16,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 13:39:16,677 INFO L93 Difference]: Finished difference Result 2624 states and 6270 transitions. [2019-12-27 13:39:16,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 13:39:16,678 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-12-27 13:39:16,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 13:39:16,681 INFO L225 Difference]: With dead ends: 2624 [2019-12-27 13:39:16,681 INFO L226 Difference]: Without dead ends: 1985 [2019-12-27 13:39:16,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-27 13:39:16,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2019-12-27 13:39:16,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1873. [2019-12-27 13:39:16,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1873 states. [2019-12-27 13:39:16,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 4324 transitions. [2019-12-27 13:39:16,710 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 4324 transitions. Word has length 95 [2019-12-27 13:39:16,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 13:39:16,710 INFO L462 AbstractCegarLoop]: Abstraction has 1873 states and 4324 transitions. [2019-12-27 13:39:16,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 13:39:16,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 4324 transitions. [2019-12-27 13:39:16,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 13:39:16,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 13:39:16,713 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 13:39:16,713 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 13:39:16,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 13:39:16,713 INFO L82 PathProgramCache]: Analyzing trace with hash 331051299, now seen corresponding path program 3 times [2019-12-27 13:39:16,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 13:39:16,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108230881] [2019-12-27 13:39:16,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 13:39:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 13:39:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 13:39:16,834 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 13:39:16,834 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 13:39:17,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:39:17 BasicIcfg [2019-12-27 13:39:17,073 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 13:39:17,079 INFO L168 Benchmark]: Toolchain (without parser) took 63676.89 ms. Allocated memory was 137.4 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 101.2 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 306.8 MB. Max. memory is 7.1 GB. [2019-12-27 13:39:17,080 INFO L168 Benchmark]: CDTParser took 1.59 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 13:39:17,080 INFO L168 Benchmark]: CACSL2BoogieTranslator took 830.47 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.8 MB in the beginning and 156.4 MB in the end (delta: -55.6 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-27 13:39:17,081 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.35 ms. Allocated memory is still 201.9 MB. Free memory was 156.4 MB in the beginning and 153.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 13:39:17,081 INFO L168 Benchmark]: Boogie Preprocessor took 38.87 ms. Allocated memory is still 201.9 MB. Free memory was 153.6 MB in the beginning and 150.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 13:39:17,081 INFO L168 Benchmark]: RCFGBuilder took 806.78 ms. Allocated memory is still 201.9 MB. Free memory was 150.9 MB in the beginning and 107.1 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. [2019-12-27 13:39:17,085 INFO L168 Benchmark]: TraceAbstraction took 61923.80 ms. Allocated memory was 201.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 106.4 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 247.4 MB. Max. memory is 7.1 GB. [2019-12-27 13:39:17,090 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.59 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 830.47 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.8 MB in the beginning and 156.4 MB in the end (delta: -55.6 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.35 ms. Allocated memory is still 201.9 MB. Free memory was 156.4 MB in the beginning and 153.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.87 ms. Allocated memory is still 201.9 MB. Free memory was 153.6 MB in the beginning and 150.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 806.78 ms. Allocated memory is still 201.9 MB. Free memory was 150.9 MB in the beginning and 107.1 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 61923.80 ms. Allocated memory was 201.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 106.4 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 247.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L697] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L698] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L700] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L704] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L705] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L706] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L707] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L708] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L709] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L710] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L711] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L712] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L713] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L714] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L715] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L716] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 0 pthread_t t2017; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L779] FCALL, FORK 0 pthread_create(&t2017, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 0 pthread_t t2018; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] FCALL, FORK 0 pthread_create(&t2018, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 2 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L756] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L763] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y = y$flush_delayed ? y$mem_tmp : y [L807] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 61.5s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 23.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9953 SDtfs, 10503 SDslu, 22865 SDs, 0 SdLazy, 9496 SolverSat, 631 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 402 GetRequests, 107 SyntacticMatches, 25 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84350occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 29.3s AutomataMinimizationTime, 37 MinimizatonAttempts, 168101 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 2947 NumberOfCodeBlocks, 2947 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2815 ConstructedInterpolants, 0 QuantifiedInterpolants, 514027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...