/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix031_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 01:55:22,245 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 01:55:22,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 01:55:22,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 01:55:22,260 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 01:55:22,261 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 01:55:22,263 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 01:55:22,265 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 01:55:22,266 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 01:55:22,267 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 01:55:22,268 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 01:55:22,269 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 01:55:22,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 01:55:22,271 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 01:55:22,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 01:55:22,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 01:55:22,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 01:55:22,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 01:55:22,277 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 01:55:22,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 01:55:22,280 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 01:55:22,281 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 01:55:22,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 01:55:22,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 01:55:22,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 01:55:22,286 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 01:55:22,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 01:55:22,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 01:55:22,287 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 01:55:22,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 01:55:22,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 01:55:22,289 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 01:55:22,290 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 01:55:22,291 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 01:55:22,292 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 01:55:22,292 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 01:55:22,293 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 01:55:22,293 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 01:55:22,293 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 01:55:22,294 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 01:55:22,295 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 01:55:22,296 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-MCR.epf [2019-12-28 01:55:22,310 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 01:55:22,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 01:55:22,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 01:55:22,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 01:55:22,312 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 01:55:22,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 01:55:22,312 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 01:55:22,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 01:55:22,313 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 01:55:22,313 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 01:55:22,313 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 01:55:22,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 01:55:22,313 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 01:55:22,313 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 01:55:22,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 01:55:22,314 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 01:55:22,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 01:55:22,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 01:55:22,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 01:55:22,315 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 01:55:22,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 01:55:22,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 01:55:22,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 01:55:22,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 01:55:22,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 01:55:22,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 01:55:22,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 01:55:22,316 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 01:55:22,317 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 01:55:22,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 01:55:22,317 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 01:55:22,317 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 01:55:22,597 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 01:55:22,611 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 01:55:22,615 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 01:55:22,616 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 01:55:22,617 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 01:55:22,617 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_tso.opt.i [2019-12-28 01:55:22,706 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90ca9e139/f08f4d0fca4d40aba1098520146fec56/FLAG7415e00d2 [2019-12-28 01:55:23,259 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 01:55:23,260 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_tso.opt.i [2019-12-28 01:55:23,274 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90ca9e139/f08f4d0fca4d40aba1098520146fec56/FLAG7415e00d2 [2019-12-28 01:55:23,550 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90ca9e139/f08f4d0fca4d40aba1098520146fec56 [2019-12-28 01:55:23,561 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 01:55:23,563 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 01:55:23,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 01:55:23,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 01:55:23,568 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 01:55:23,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:55:23" (1/1) ... [2019-12-28 01:55:23,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691f4c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:23, skipping insertion in model container [2019-12-28 01:55:23,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 01:55:23" (1/1) ... [2019-12-28 01:55:23,579 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 01:55:23,641 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 01:55:24,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 01:55:24,143 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 01:55:24,213 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 01:55:24,296 INFO L208 MainTranslator]: Completed translation [2019-12-28 01:55:24,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:24 WrapperNode [2019-12-28 01:55:24,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 01:55:24,297 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 01:55:24,297 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 01:55:24,297 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 01:55:24,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:24" (1/1) ... [2019-12-28 01:55:24,328 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:24" (1/1) ... [2019-12-28 01:55:24,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 01:55:24,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 01:55:24,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 01:55:24,361 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 01:55:24,371 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:24" (1/1) ... [2019-12-28 01:55:24,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:24" (1/1) ... [2019-12-28 01:55:24,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:24" (1/1) ... [2019-12-28 01:55:24,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:24" (1/1) ... [2019-12-28 01:55:24,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:24" (1/1) ... [2019-12-28 01:55:24,389 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:24" (1/1) ... [2019-12-28 01:55:24,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:24" (1/1) ... [2019-12-28 01:55:24,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 01:55:24,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 01:55:24,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 01:55:24,399 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 01:55:24,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:24" (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-28 01:55:24,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 01:55:24,470 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 01:55:24,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 01:55:24,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 01:55:24,471 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 01:55:24,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 01:55:24,472 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 01:55:24,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 01:55:24,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 01:55:24,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 01:55:24,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 01:55:24,476 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 01:55:25,202 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 01:55:25,203 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 01:55:25,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:55:25 BoogieIcfgContainer [2019-12-28 01:55:25,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 01:55:25,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 01:55:25,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 01:55:25,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 01:55:25,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 01:55:23" (1/3) ... [2019-12-28 01:55:25,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a3f0944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:55:25, skipping insertion in model container [2019-12-28 01:55:25,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 01:55:24" (2/3) ... [2019-12-28 01:55:25,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a3f0944 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 01:55:25, skipping insertion in model container [2019-12-28 01:55:25,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 01:55:25" (3/3) ... [2019-12-28 01:55:25,213 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_tso.opt.i [2019-12-28 01:55:25,224 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 01:55:25,224 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 01:55:25,232 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 01:55:25,233 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 01:55:25,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,273 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,274 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,282 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,283 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,284 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,285 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,286 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,287 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,288 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,289 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,298 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,298 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,299 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,299 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,299 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,311 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,312 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,312 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,313 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,314 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,314 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,315 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,316 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,317 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,320 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,320 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,321 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,321 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 01:55:25,338 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 01:55:25,355 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 01:55:25,355 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 01:55:25,355 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 01:55:25,355 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 01:55:25,356 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 01:55:25,356 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 01:55:25,356 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 01:55:25,356 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 01:55:25,371 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 139 places, 167 transitions [2019-12-28 01:55:26,818 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25979 states. [2019-12-28 01:55:26,820 INFO L276 IsEmpty]: Start isEmpty. Operand 25979 states. [2019-12-28 01:55:26,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-28 01:55:26,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:26,830 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] [2019-12-28 01:55:26,831 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:26,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:26,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1982457826, now seen corresponding path program 1 times [2019-12-28 01:55:26,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:26,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37287271] [2019-12-28 01:55:26,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:27,241 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-28 01:55:27,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37287271] [2019-12-28 01:55:27,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:27,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:55:27,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1803360899] [2019-12-28 01:55:27,244 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:27,251 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:27,272 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 43 states and 42 transitions. [2019-12-28 01:55:27,273 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:27,277 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:27,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:55:27,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:27,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:55:27,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:55:27,297 INFO L87 Difference]: Start difference. First operand 25979 states. Second operand 4 states. [2019-12-28 01:55:27,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:27,910 INFO L93 Difference]: Finished difference Result 26619 states and 102124 transitions. [2019-12-28 01:55:27,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 01:55:27,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-28 01:55:27,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:28,107 INFO L225 Difference]: With dead ends: 26619 [2019-12-28 01:55:28,107 INFO L226 Difference]: Without dead ends: 20363 [2019-12-28 01:55:28,109 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-28 01:55:29,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20363 states. [2019-12-28 01:55:29,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20363 to 20363. [2019-12-28 01:55:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20363 states. [2019-12-28 01:55:30,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20363 states to 20363 states and 78428 transitions. [2019-12-28 01:55:30,088 INFO L78 Accepts]: Start accepts. Automaton has 20363 states and 78428 transitions. Word has length 42 [2019-12-28 01:55:30,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:30,089 INFO L462 AbstractCegarLoop]: Abstraction has 20363 states and 78428 transitions. [2019-12-28 01:55:30,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:55:30,091 INFO L276 IsEmpty]: Start isEmpty. Operand 20363 states and 78428 transitions. [2019-12-28 01:55:30,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-28 01:55:30,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:30,104 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:55:30,104 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:30,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:30,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1965107530, now seen corresponding path program 1 times [2019-12-28 01:55:30,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:30,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757180283] [2019-12-28 01:55:30,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:30,250 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-28 01:55:30,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757180283] [2019-12-28 01:55:30,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:30,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:55:30,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [992430902] [2019-12-28 01:55:30,252 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:30,257 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:30,262 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 51 states and 50 transitions. [2019-12-28 01:55:30,262 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:30,263 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:30,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:55:30,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:30,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:55:30,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:55:30,265 INFO L87 Difference]: Start difference. First operand 20363 states and 78428 transitions. Second operand 5 states. [2019-12-28 01:55:31,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:31,947 INFO L93 Difference]: Finished difference Result 31841 states and 116045 transitions. [2019-12-28 01:55:31,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:55:31,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-12-28 01:55:31,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:32,096 INFO L225 Difference]: With dead ends: 31841 [2019-12-28 01:55:32,096 INFO L226 Difference]: Without dead ends: 31289 [2019-12-28 01:55:32,097 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-28 01:55:32,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31289 states. [2019-12-28 01:55:33,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31289 to 29708. [2019-12-28 01:55:33,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29708 states. [2019-12-28 01:55:33,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29708 states to 29708 states and 109522 transitions. [2019-12-28 01:55:33,115 INFO L78 Accepts]: Start accepts. Automaton has 29708 states and 109522 transitions. Word has length 50 [2019-12-28 01:55:33,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:33,117 INFO L462 AbstractCegarLoop]: Abstraction has 29708 states and 109522 transitions. [2019-12-28 01:55:33,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:55:33,117 INFO L276 IsEmpty]: Start isEmpty. Operand 29708 states and 109522 transitions. [2019-12-28 01:55:33,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-28 01:55:33,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:33,124 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:55:33,125 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:33,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:33,125 INFO L82 PathProgramCache]: Analyzing trace with hash -2091945449, now seen corresponding path program 1 times [2019-12-28 01:55:33,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:33,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229407890] [2019-12-28 01:55:33,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:33,252 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-28 01:55:33,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229407890] [2019-12-28 01:55:33,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:33,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:55:33,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [5545948] [2019-12-28 01:55:33,254 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:33,260 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:33,271 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 123 transitions. [2019-12-28 01:55:33,271 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:33,351 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 01:55:33,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:55:33,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:33,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:55:33,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:55:33,352 INFO L87 Difference]: Start difference. First operand 29708 states and 109522 transitions. Second operand 6 states. [2019-12-28 01:55:34,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:34,206 INFO L93 Difference]: Finished difference Result 38699 states and 139694 transitions. [2019-12-28 01:55:34,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:55:34,207 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-28 01:55:34,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:34,362 INFO L225 Difference]: With dead ends: 38699 [2019-12-28 01:55:34,363 INFO L226 Difference]: Without dead ends: 38251 [2019-12-28 01:55:34,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:55:34,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38251 states. [2019-12-28 01:55:36,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38251 to 32954. [2019-12-28 01:55:36,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32954 states. [2019-12-28 01:55:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32954 states to 32954 states and 120531 transitions. [2019-12-28 01:55:36,674 INFO L78 Accepts]: Start accepts. Automaton has 32954 states and 120531 transitions. Word has length 51 [2019-12-28 01:55:36,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:36,674 INFO L462 AbstractCegarLoop]: Abstraction has 32954 states and 120531 transitions. [2019-12-28 01:55:36,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:55:36,675 INFO L276 IsEmpty]: Start isEmpty. Operand 32954 states and 120531 transitions. [2019-12-28 01:55:36,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 01:55:36,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:36,686 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] [2019-12-28 01:55:36,686 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:36,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:36,687 INFO L82 PathProgramCache]: Analyzing trace with hash 568644221, now seen corresponding path program 1 times [2019-12-28 01:55:36,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:36,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376857483] [2019-12-28 01:55:36,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:36,737 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-28 01:55:36,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376857483] [2019-12-28 01:55:36,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:36,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 01:55:36,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [234275998] [2019-12-28 01:55:36,738 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:36,746 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:36,757 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 98 states and 141 transitions. [2019-12-28 01:55:36,757 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:36,811 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 01:55:36,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:55:36,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:36,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:55:36,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:55:36,815 INFO L87 Difference]: Start difference. First operand 32954 states and 120531 transitions. Second operand 5 states. [2019-12-28 01:55:37,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:37,132 INFO L93 Difference]: Finished difference Result 42415 states and 152022 transitions. [2019-12-28 01:55:37,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 01:55:37,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-28 01:55:37,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:37,253 INFO L225 Difference]: With dead ends: 42415 [2019-12-28 01:55:37,253 INFO L226 Difference]: Without dead ends: 42415 [2019-12-28 01:55:37,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:55:37,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42415 states. [2019-12-28 01:55:38,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42415 to 37668. [2019-12-28 01:55:38,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37668 states. [2019-12-28 01:55:38,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37668 states to 37668 states and 136335 transitions. [2019-12-28 01:55:38,521 INFO L78 Accepts]: Start accepts. Automaton has 37668 states and 136335 transitions. Word has length 53 [2019-12-28 01:55:38,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:38,521 INFO L462 AbstractCegarLoop]: Abstraction has 37668 states and 136335 transitions. [2019-12-28 01:55:38,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:55:38,521 INFO L276 IsEmpty]: Start isEmpty. Operand 37668 states and 136335 transitions. [2019-12-28 01:55:38,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-28 01:55:38,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:38,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:55:38,540 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:38,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:38,540 INFO L82 PathProgramCache]: Analyzing trace with hash -208895999, now seen corresponding path program 1 times [2019-12-28 01:55:38,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:38,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510840591] [2019-12-28 01:55:38,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 01:55:39,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510840591] [2019-12-28 01:55:39,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:39,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:55:39,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [177207282] [2019-12-28 01:55:39,797 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:39,805 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:39,811 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 61 transitions. [2019-12-28 01:55:39,812 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:39,851 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 01:55:39,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 01:55:39,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:39,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 01:55:39,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:55:39,853 INFO L87 Difference]: Start difference. First operand 37668 states and 136335 transitions. Second operand 8 states. [2019-12-28 01:55:40,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:40,866 INFO L93 Difference]: Finished difference Result 51814 states and 185563 transitions. [2019-12-28 01:55:40,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 01:55:40,867 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-28 01:55:40,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:40,974 INFO L225 Difference]: With dead ends: 51814 [2019-12-28 01:55:40,974 INFO L226 Difference]: Without dead ends: 51014 [2019-12-28 01:55:40,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-28 01:55:41,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51014 states. [2019-12-28 01:55:41,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51014 to 47936. [2019-12-28 01:55:41,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47936 states. [2019-12-28 01:55:42,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47936 states to 47936 states and 172264 transitions. [2019-12-28 01:55:42,073 INFO L78 Accepts]: Start accepts. Automaton has 47936 states and 172264 transitions. Word has length 57 [2019-12-28 01:55:42,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:42,074 INFO L462 AbstractCegarLoop]: Abstraction has 47936 states and 172264 transitions. [2019-12-28 01:55:42,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 01:55:42,074 INFO L276 IsEmpty]: Start isEmpty. Operand 47936 states and 172264 transitions. [2019-12-28 01:55:42,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-28 01:55:42,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:42,092 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:55:42,092 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:42,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:42,092 INFO L82 PathProgramCache]: Analyzing trace with hash -2005847358, now seen corresponding path program 1 times [2019-12-28 01:55:42,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:42,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704113059] [2019-12-28 01:55:42,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:42,232 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-28 01:55:42,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704113059] [2019-12-28 01:55:42,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:42,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:55:42,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [693668445] [2019-12-28 01:55:42,234 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:42,242 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:42,249 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 61 transitions. [2019-12-28 01:55:42,249 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:42,276 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 01:55:42,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 01:55:42,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:42,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 01:55:42,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:55:42,277 INFO L87 Difference]: Start difference. First operand 47936 states and 172264 transitions. Second operand 9 states. [2019-12-28 01:55:43,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:43,881 INFO L93 Difference]: Finished difference Result 68550 states and 236789 transitions. [2019-12-28 01:55:43,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 01:55:43,881 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-28 01:55:43,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:44,025 INFO L225 Difference]: With dead ends: 68550 [2019-12-28 01:55:44,025 INFO L226 Difference]: Without dead ends: 68550 [2019-12-28 01:55:44,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-12-28 01:55:44,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68550 states. [2019-12-28 01:55:47,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68550 to 56774. [2019-12-28 01:55:47,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56774 states. [2019-12-28 01:55:47,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56774 states to 56774 states and 199367 transitions. [2019-12-28 01:55:47,293 INFO L78 Accepts]: Start accepts. Automaton has 56774 states and 199367 transitions. Word has length 57 [2019-12-28 01:55:47,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:47,293 INFO L462 AbstractCegarLoop]: Abstraction has 56774 states and 199367 transitions. [2019-12-28 01:55:47,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 01:55:47,293 INFO L276 IsEmpty]: Start isEmpty. Operand 56774 states and 199367 transitions. [2019-12-28 01:55:47,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-28 01:55:47,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:47,309 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:55:47,309 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:47,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:47,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1118343677, now seen corresponding path program 1 times [2019-12-28 01:55:47,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:47,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354410962] [2019-12-28 01:55:47,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:47,382 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-28 01:55:47,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354410962] [2019-12-28 01:55:47,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:47,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:55:47,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [505504275] [2019-12-28 01:55:47,383 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:47,390 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:47,397 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 60 states and 61 transitions. [2019-12-28 01:55:47,397 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:47,397 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:47,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:55:47,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:47,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:55:47,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:55:47,398 INFO L87 Difference]: Start difference. First operand 56774 states and 199367 transitions. Second operand 4 states. [2019-12-28 01:55:47,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:47,460 INFO L93 Difference]: Finished difference Result 10469 states and 32215 transitions. [2019-12-28 01:55:47,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:55:47,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-28 01:55:47,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:47,473 INFO L225 Difference]: With dead ends: 10469 [2019-12-28 01:55:47,474 INFO L226 Difference]: Without dead ends: 9223 [2019-12-28 01:55:47,474 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-28 01:55:47,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9223 states. [2019-12-28 01:55:47,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9223 to 9175. [2019-12-28 01:55:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9175 states. [2019-12-28 01:55:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9175 states to 9175 states and 27926 transitions. [2019-12-28 01:55:47,590 INFO L78 Accepts]: Start accepts. Automaton has 9175 states and 27926 transitions. Word has length 57 [2019-12-28 01:55:47,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:47,590 INFO L462 AbstractCegarLoop]: Abstraction has 9175 states and 27926 transitions. [2019-12-28 01:55:47,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:55:47,591 INFO L276 IsEmpty]: Start isEmpty. Operand 9175 states and 27926 transitions. [2019-12-28 01:55:47,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-28 01:55:47,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:47,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:55:47,592 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:47,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:47,593 INFO L82 PathProgramCache]: Analyzing trace with hash -195256504, now seen corresponding path program 1 times [2019-12-28 01:55:47,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:47,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796435396] [2019-12-28 01:55:47,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:47,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 01:55:47,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796435396] [2019-12-28 01:55:47,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:47,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:55:47,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1271084585] [2019-12-28 01:55:47,676 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:47,681 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:47,697 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 177 transitions. [2019-12-28 01:55:47,698 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:47,751 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 01:55:47,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 01:55:47,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:47,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 01:55:47,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:55:47,752 INFO L87 Difference]: Start difference. First operand 9175 states and 27926 transitions. Second operand 8 states. [2019-12-28 01:55:48,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:48,288 INFO L93 Difference]: Finished difference Result 11222 states and 33697 transitions. [2019-12-28 01:55:48,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 01:55:48,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-28 01:55:48,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:48,304 INFO L225 Difference]: With dead ends: 11222 [2019-12-28 01:55:48,304 INFO L226 Difference]: Without dead ends: 11135 [2019-12-28 01:55:48,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2019-12-28 01:55:48,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11135 states. [2019-12-28 01:55:48,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11135 to 9316. [2019-12-28 01:55:48,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9316 states. [2019-12-28 01:55:48,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9316 states to 9316 states and 28348 transitions. [2019-12-28 01:55:48,455 INFO L78 Accepts]: Start accepts. Automaton has 9316 states and 28348 transitions. Word has length 57 [2019-12-28 01:55:48,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:48,455 INFO L462 AbstractCegarLoop]: Abstraction has 9316 states and 28348 transitions. [2019-12-28 01:55:48,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 01:55:48,455 INFO L276 IsEmpty]: Start isEmpty. Operand 9316 states and 28348 transitions. [2019-12-28 01:55:48,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 01:55:48,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:48,460 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:55:48,461 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:48,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:48,461 INFO L82 PathProgramCache]: Analyzing trace with hash 141668315, now seen corresponding path program 1 times [2019-12-28 01:55:48,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:48,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897305633] [2019-12-28 01:55:48,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:48,522 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-28 01:55:48,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897305633] [2019-12-28 01:55:48,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:48,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:55:48,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1989978248] [2019-12-28 01:55:48,523 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:48,533 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:48,560 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 136 states and 203 transitions. [2019-12-28 01:55:48,560 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:48,577 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 01:55:48,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:55:48,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:48,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:55:48,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:55:48,578 INFO L87 Difference]: Start difference. First operand 9316 states and 28348 transitions. Second operand 5 states. [2019-12-28 01:55:49,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:49,107 INFO L93 Difference]: Finished difference Result 10891 states and 33040 transitions. [2019-12-28 01:55:49,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 01:55:49,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-28 01:55:49,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:49,130 INFO L225 Difference]: With dead ends: 10891 [2019-12-28 01:55:49,130 INFO L226 Difference]: Without dead ends: 10891 [2019-12-28 01:55:49,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:55:49,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10891 states. [2019-12-28 01:55:49,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10891 to 9883. [2019-12-28 01:55:49,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9883 states. [2019-12-28 01:55:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9883 states to 9883 states and 30019 transitions. [2019-12-28 01:55:49,329 INFO L78 Accepts]: Start accepts. Automaton has 9883 states and 30019 transitions. Word has length 67 [2019-12-28 01:55:49,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:49,329 INFO L462 AbstractCegarLoop]: Abstraction has 9883 states and 30019 transitions. [2019-12-28 01:55:49,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:55:49,330 INFO L276 IsEmpty]: Start isEmpty. Operand 9883 states and 30019 transitions. [2019-12-28 01:55:49,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 01:55:49,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:49,337 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:55:49,338 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:49,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:49,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1884478650, now seen corresponding path program 1 times [2019-12-28 01:55:49,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:49,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498978954] [2019-12-28 01:55:49,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:49,422 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-28 01:55:49,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498978954] [2019-12-28 01:55:49,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:49,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:55:49,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [312575043] [2019-12-28 01:55:49,424 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:49,434 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:49,462 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 136 states and 203 transitions. [2019-12-28 01:55:49,462 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:49,486 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 01:55:49,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 01:55:49,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:49,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 01:55:49,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:55:49,487 INFO L87 Difference]: Start difference. First operand 9883 states and 30019 transitions. Second operand 7 states. [2019-12-28 01:55:50,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:50,106 INFO L93 Difference]: Finished difference Result 12789 states and 38229 transitions. [2019-12-28 01:55:50,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-28 01:55:50,106 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-28 01:55:50,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:50,131 INFO L225 Difference]: With dead ends: 12789 [2019-12-28 01:55:50,131 INFO L226 Difference]: Without dead ends: 12741 [2019-12-28 01:55:50,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-28 01:55:50,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12741 states. [2019-12-28 01:55:50,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12741 to 10622. [2019-12-28 01:55:50,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10622 states. [2019-12-28 01:55:50,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10622 states to 10622 states and 32072 transitions. [2019-12-28 01:55:50,297 INFO L78 Accepts]: Start accepts. Automaton has 10622 states and 32072 transitions. Word has length 67 [2019-12-28 01:55:50,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:50,297 INFO L462 AbstractCegarLoop]: Abstraction has 10622 states and 32072 transitions. [2019-12-28 01:55:50,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 01:55:50,297 INFO L276 IsEmpty]: Start isEmpty. Operand 10622 states and 32072 transitions. [2019-12-28 01:55:50,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 01:55:50,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:50,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] [2019-12-28 01:55:50,305 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:50,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:50,305 INFO L82 PathProgramCache]: Analyzing trace with hash -17868351, now seen corresponding path program 1 times [2019-12-28 01:55:50,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:50,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197468451] [2019-12-28 01:55:50,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:50,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 01:55:50,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197468451] [2019-12-28 01:55:50,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:50,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 01:55:50,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [393173749] [2019-12-28 01:55:50,392 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:50,403 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:50,415 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 01:55:50,415 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:50,416 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:50,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 01:55:50,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:50,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 01:55:50,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 01:55:50,417 INFO L87 Difference]: Start difference. First operand 10622 states and 32072 transitions. Second operand 4 states. [2019-12-28 01:55:50,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:50,686 INFO L93 Difference]: Finished difference Result 13324 states and 39674 transitions. [2019-12-28 01:55:50,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 01:55:50,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-28 01:55:50,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:50,705 INFO L225 Difference]: With dead ends: 13324 [2019-12-28 01:55:50,705 INFO L226 Difference]: Without dead ends: 13324 [2019-12-28 01:55:50,706 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-28 01:55:50,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13324 states. [2019-12-28 01:55:50,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13324 to 12178. [2019-12-28 01:55:50,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12178 states. [2019-12-28 01:55:50,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12178 states to 12178 states and 36363 transitions. [2019-12-28 01:55:50,864 INFO L78 Accepts]: Start accepts. Automaton has 12178 states and 36363 transitions. Word has length 69 [2019-12-28 01:55:50,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:50,864 INFO L462 AbstractCegarLoop]: Abstraction has 12178 states and 36363 transitions. [2019-12-28 01:55:50,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 01:55:50,865 INFO L276 IsEmpty]: Start isEmpty. Operand 12178 states and 36363 transitions. [2019-12-28 01:55:50,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 01:55:50,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:50,874 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 01:55:50,874 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:50,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:50,874 INFO L82 PathProgramCache]: Analyzing trace with hash -2095077694, now seen corresponding path program 1 times [2019-12-28 01:55:50,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:50,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88651358] [2019-12-28 01:55:50,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:50,911 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-28 01:55:50,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88651358] [2019-12-28 01:55:50,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:50,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 01:55:50,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1793530889] [2019-12-28 01:55:50,913 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:50,923 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:50,936 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 01:55:50,936 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:50,936 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:50,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 01:55:50,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:50,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 01:55:50,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 01:55:50,937 INFO L87 Difference]: Start difference. First operand 12178 states and 36363 transitions. Second operand 3 states. [2019-12-28 01:55:51,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:51,139 INFO L93 Difference]: Finished difference Result 12704 states and 37768 transitions. [2019-12-28 01:55:51,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 01:55:51,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-28 01:55:51,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:51,157 INFO L225 Difference]: With dead ends: 12704 [2019-12-28 01:55:51,157 INFO L226 Difference]: Without dead ends: 12704 [2019-12-28 01:55:51,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 01:55:51,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12704 states. [2019-12-28 01:55:51,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12704 to 12466. [2019-12-28 01:55:51,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12466 states. [2019-12-28 01:55:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12466 states to 12466 states and 37127 transitions. [2019-12-28 01:55:51,552 INFO L78 Accepts]: Start accepts. Automaton has 12466 states and 37127 transitions. Word has length 69 [2019-12-28 01:55:51,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:51,552 INFO L462 AbstractCegarLoop]: Abstraction has 12466 states and 37127 transitions. [2019-12-28 01:55:51,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 01:55:51,552 INFO L276 IsEmpty]: Start isEmpty. Operand 12466 states and 37127 transitions. [2019-12-28 01:55:51,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:55:51,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:51,564 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] [2019-12-28 01:55:51,564 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:51,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:51,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1715982354, now seen corresponding path program 1 times [2019-12-28 01:55:51,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:51,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646643870] [2019-12-28 01:55:51,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:51,659 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-28 01:55:51,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646643870] [2019-12-28 01:55:51,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:51,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:55:51,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1980063145] [2019-12-28 01:55:51,660 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:51,673 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:51,687 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 71 transitions. [2019-12-28 01:55:51,687 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:51,687 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:51,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:55:51,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:51,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:55:51,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:55:51,688 INFO L87 Difference]: Start difference. First operand 12466 states and 37127 transitions. Second operand 6 states. [2019-12-28 01:55:52,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:52,242 INFO L93 Difference]: Finished difference Result 13737 states and 40366 transitions. [2019-12-28 01:55:52,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:55:52,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-28 01:55:52,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:52,269 INFO L225 Difference]: With dead ends: 13737 [2019-12-28 01:55:52,269 INFO L226 Difference]: Without dead ends: 13737 [2019-12-28 01:55:52,269 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-28 01:55:52,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13737 states. [2019-12-28 01:55:52,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13737 to 13251. [2019-12-28 01:55:52,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13251 states. [2019-12-28 01:55:52,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13251 states to 13251 states and 39082 transitions. [2019-12-28 01:55:52,493 INFO L78 Accepts]: Start accepts. Automaton has 13251 states and 39082 transitions. Word has length 71 [2019-12-28 01:55:52,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:52,493 INFO L462 AbstractCegarLoop]: Abstraction has 13251 states and 39082 transitions. [2019-12-28 01:55:52,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:55:52,493 INFO L276 IsEmpty]: Start isEmpty. Operand 13251 states and 39082 transitions. [2019-12-28 01:55:52,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:55:52,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:52,504 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] [2019-12-28 01:55:52,504 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:52,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:52,505 INFO L82 PathProgramCache]: Analyzing trace with hash 501775599, now seen corresponding path program 1 times [2019-12-28 01:55:52,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:52,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951511827] [2019-12-28 01:55:52,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:52,631 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-28 01:55:52,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951511827] [2019-12-28 01:55:52,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:52,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:55:52,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [539653764] [2019-12-28 01:55:52,632 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:52,644 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:52,661 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 71 transitions. [2019-12-28 01:55:52,661 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:52,662 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:52,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:55:52,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:52,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:55:52,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:55:52,663 INFO L87 Difference]: Start difference. First operand 13251 states and 39082 transitions. Second operand 6 states. [2019-12-28 01:55:53,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:53,113 INFO L93 Difference]: Finished difference Result 15574 states and 44592 transitions. [2019-12-28 01:55:53,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 01:55:53,113 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-28 01:55:53,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:53,133 INFO L225 Difference]: With dead ends: 15574 [2019-12-28 01:55:53,134 INFO L226 Difference]: Without dead ends: 15574 [2019-12-28 01:55:53,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:55:53,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15574 states. [2019-12-28 01:55:53,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15574 to 13825. [2019-12-28 01:55:53,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13825 states. [2019-12-28 01:55:53,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13825 states to 13825 states and 39932 transitions. [2019-12-28 01:55:53,317 INFO L78 Accepts]: Start accepts. Automaton has 13825 states and 39932 transitions. Word has length 71 [2019-12-28 01:55:53,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:53,318 INFO L462 AbstractCegarLoop]: Abstraction has 13825 states and 39932 transitions. [2019-12-28 01:55:53,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:55:53,318 INFO L276 IsEmpty]: Start isEmpty. Operand 13825 states and 39932 transitions. [2019-12-28 01:55:53,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:55:53,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:53,331 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] [2019-12-28 01:55:53,331 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:53,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:53,331 INFO L82 PathProgramCache]: Analyzing trace with hash 713126512, now seen corresponding path program 1 times [2019-12-28 01:55:53,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:53,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613777515] [2019-12-28 01:55:53,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:53,395 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-28 01:55:53,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613777515] [2019-12-28 01:55:53,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:53,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:55:53,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1566160983] [2019-12-28 01:55:53,396 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:53,408 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:53,422 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 71 transitions. [2019-12-28 01:55:53,422 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:53,422 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:53,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:55:53,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:53,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:55:53,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:55:53,423 INFO L87 Difference]: Start difference. First operand 13825 states and 39932 transitions. Second operand 5 states. [2019-12-28 01:55:53,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:53,884 INFO L93 Difference]: Finished difference Result 17386 states and 50011 transitions. [2019-12-28 01:55:53,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 01:55:53,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-28 01:55:53,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:53,926 INFO L225 Difference]: With dead ends: 17386 [2019-12-28 01:55:53,926 INFO L226 Difference]: Without dead ends: 17386 [2019-12-28 01:55:53,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 01:55:53,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17386 states. [2019-12-28 01:55:54,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17386 to 14863. [2019-12-28 01:55:54,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14863 states. [2019-12-28 01:55:54,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14863 states to 14863 states and 42564 transitions. [2019-12-28 01:55:54,342 INFO L78 Accepts]: Start accepts. Automaton has 14863 states and 42564 transitions. Word has length 71 [2019-12-28 01:55:54,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:54,343 INFO L462 AbstractCegarLoop]: Abstraction has 14863 states and 42564 transitions. [2019-12-28 01:55:54,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:55:54,343 INFO L276 IsEmpty]: Start isEmpty. Operand 14863 states and 42564 transitions. [2019-12-28 01:55:54,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:55:54,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:54,357 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] [2019-12-28 01:55:54,357 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:54,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:54,358 INFO L82 PathProgramCache]: Analyzing trace with hash 202592335, now seen corresponding path program 1 times [2019-12-28 01:55:54,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:54,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860242380] [2019-12-28 01:55:54,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:54,442 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-28 01:55:54,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860242380] [2019-12-28 01:55:54,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:54,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:55:54,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1746543784] [2019-12-28 01:55:54,443 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:54,454 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:54,466 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 71 transitions. [2019-12-28 01:55:54,466 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:54,466 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:54,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:55:54,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:54,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:55:54,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:55:54,467 INFO L87 Difference]: Start difference. First operand 14863 states and 42564 transitions. Second operand 5 states. [2019-12-28 01:55:54,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:54,950 INFO L93 Difference]: Finished difference Result 19768 states and 56511 transitions. [2019-12-28 01:55:54,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:55:54,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-28 01:55:54,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:54,975 INFO L225 Difference]: With dead ends: 19768 [2019-12-28 01:55:54,975 INFO L226 Difference]: Without dead ends: 19768 [2019-12-28 01:55:54,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:55:55,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19768 states. [2019-12-28 01:55:55,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19768 to 15768. [2019-12-28 01:55:55,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15768 states. [2019-12-28 01:55:55,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15768 states to 15768 states and 45150 transitions. [2019-12-28 01:55:55,191 INFO L78 Accepts]: Start accepts. Automaton has 15768 states and 45150 transitions. Word has length 71 [2019-12-28 01:55:55,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:55,192 INFO L462 AbstractCegarLoop]: Abstraction has 15768 states and 45150 transitions. [2019-12-28 01:55:55,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:55:55,192 INFO L276 IsEmpty]: Start isEmpty. Operand 15768 states and 45150 transitions. [2019-12-28 01:55:55,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-28 01:55:55,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:55,201 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] [2019-12-28 01:55:55,201 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:55,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:55,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1604862128, now seen corresponding path program 1 times [2019-12-28 01:55:55,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:55,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848863357] [2019-12-28 01:55:55,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:55,276 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-28 01:55:55,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848863357] [2019-12-28 01:55:55,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:55,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:55:55,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [508617839] [2019-12-28 01:55:55,277 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:55,287 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:55,301 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 71 transitions. [2019-12-28 01:55:55,302 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:55,302 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:55:55,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 01:55:55,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:55,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 01:55:55,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 01:55:55,303 INFO L87 Difference]: Start difference. First operand 15768 states and 45150 transitions. Second operand 5 states. [2019-12-28 01:55:55,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:55,358 INFO L93 Difference]: Finished difference Result 5640 states and 13144 transitions. [2019-12-28 01:55:55,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 01:55:55,358 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-28 01:55:55,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:55,365 INFO L225 Difference]: With dead ends: 5640 [2019-12-28 01:55:55,365 INFO L226 Difference]: Without dead ends: 4549 [2019-12-28 01:55:55,365 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-28 01:55:55,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4549 states. [2019-12-28 01:55:55,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4549 to 3948. [2019-12-28 01:55:55,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2019-12-28 01:55:55,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 9039 transitions. [2019-12-28 01:55:55,410 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 9039 transitions. Word has length 71 [2019-12-28 01:55:55,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:55,411 INFO L462 AbstractCegarLoop]: Abstraction has 3948 states and 9039 transitions. [2019-12-28 01:55:55,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 01:55:55,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 9039 transitions. [2019-12-28 01:55:55,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 01:55:55,416 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:55,416 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] [2019-12-28 01:55:55,416 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:55,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:55,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1855661874, now seen corresponding path program 1 times [2019-12-28 01:55:55,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:55,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425141067] [2019-12-28 01:55:55,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:55,477 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-28 01:55:55,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425141067] [2019-12-28 01:55:55,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:55,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 01:55:55,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1475591934] [2019-12-28 01:55:55,478 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:55,496 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:55,563 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 155 states and 213 transitions. [2019-12-28 01:55:55,563 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:55,608 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 01:55:55,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 01:55:55,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:55,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 01:55:55,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:55:55,609 INFO L87 Difference]: Start difference. First operand 3948 states and 9039 transitions. Second operand 8 states. [2019-12-28 01:55:57,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:57,024 INFO L93 Difference]: Finished difference Result 6520 states and 14420 transitions. [2019-12-28 01:55:57,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-28 01:55:57,025 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86 [2019-12-28 01:55:57,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:57,033 INFO L225 Difference]: With dead ends: 6520 [2019-12-28 01:55:57,033 INFO L226 Difference]: Without dead ends: 6414 [2019-12-28 01:55:57,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2019-12-28 01:55:57,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6414 states. [2019-12-28 01:55:57,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6414 to 4916. [2019-12-28 01:55:57,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4916 states. [2019-12-28 01:55:57,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4916 states to 4916 states and 11017 transitions. [2019-12-28 01:55:57,091 INFO L78 Accepts]: Start accepts. Automaton has 4916 states and 11017 transitions. Word has length 86 [2019-12-28 01:55:57,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:57,091 INFO L462 AbstractCegarLoop]: Abstraction has 4916 states and 11017 transitions. [2019-12-28 01:55:57,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 01:55:57,092 INFO L276 IsEmpty]: Start isEmpty. Operand 4916 states and 11017 transitions. [2019-12-28 01:55:57,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 01:55:57,096 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:57,096 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] [2019-12-28 01:55:57,097 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:57,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:57,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1011259222, now seen corresponding path program 2 times [2019-12-28 01:55:57,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:57,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905375670] [2019-12-28 01:55:57,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:57,220 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-28 01:55:57,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905375670] [2019-12-28 01:55:57,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:57,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:55:57,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [319924171] [2019-12-28 01:55:57,221 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:57,239 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:57,293 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 149 states and 198 transitions. [2019-12-28 01:55:57,293 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:57,332 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 01:55:57,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 01:55:57,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:57,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 01:55:57,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:55:57,334 INFO L87 Difference]: Start difference. First operand 4916 states and 11017 transitions. Second operand 9 states. [2019-12-28 01:55:58,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:55:58,501 INFO L93 Difference]: Finished difference Result 14433 states and 32533 transitions. [2019-12-28 01:55:58,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-28 01:55:58,501 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-12-28 01:55:58,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:55:58,517 INFO L225 Difference]: With dead ends: 14433 [2019-12-28 01:55:58,518 INFO L226 Difference]: Without dead ends: 14379 [2019-12-28 01:55:58,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2019-12-28 01:55:58,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14379 states. [2019-12-28 01:55:58,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14379 to 5888. [2019-12-28 01:55:58,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5888 states. [2019-12-28 01:55:58,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5888 states to 5888 states and 13190 transitions. [2019-12-28 01:55:58,625 INFO L78 Accepts]: Start accepts. Automaton has 5888 states and 13190 transitions. Word has length 86 [2019-12-28 01:55:58,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:55:58,626 INFO L462 AbstractCegarLoop]: Abstraction has 5888 states and 13190 transitions. [2019-12-28 01:55:58,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 01:55:58,626 INFO L276 IsEmpty]: Start isEmpty. Operand 5888 states and 13190 transitions. [2019-12-28 01:55:58,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 01:55:58,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:55:58,632 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] [2019-12-28 01:55:58,632 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:55:58,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:55:58,632 INFO L82 PathProgramCache]: Analyzing trace with hash -785692137, now seen corresponding path program 1 times [2019-12-28 01:55:58,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:55:58,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897583952] [2019-12-28 01:55:58,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:55:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:55:58,728 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-28 01:55:58,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897583952] [2019-12-28 01:55:58,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:55:58,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:55:58,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [34666879] [2019-12-28 01:55:58,729 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:55:58,747 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:55:58,810 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 149 states and 198 transitions. [2019-12-28 01:55:58,811 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:55:58,920 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-28 01:55:58,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-28 01:55:58,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:55:58,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-28 01:55:58,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-28 01:55:58,922 INFO L87 Difference]: Start difference. First operand 5888 states and 13190 transitions. Second operand 13 states. [2019-12-28 01:56:01,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:01,582 INFO L93 Difference]: Finished difference Result 20822 states and 47375 transitions. [2019-12-28 01:56:01,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-28 01:56:01,583 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2019-12-28 01:56:01,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:01,619 INFO L225 Difference]: With dead ends: 20822 [2019-12-28 01:56:01,620 INFO L226 Difference]: Without dead ends: 20822 [2019-12-28 01:56:01,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=550, Invalid=1900, Unknown=0, NotChecked=0, Total=2450 [2019-12-28 01:56:01,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20822 states. [2019-12-28 01:56:02,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20822 to 6501. [2019-12-28 01:56:02,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6501 states. [2019-12-28 01:56:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6501 states to 6501 states and 14637 transitions. [2019-12-28 01:56:02,021 INFO L78 Accepts]: Start accepts. Automaton has 6501 states and 14637 transitions. Word has length 86 [2019-12-28 01:56:02,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:02,022 INFO L462 AbstractCegarLoop]: Abstraction has 6501 states and 14637 transitions. [2019-12-28 01:56:02,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-28 01:56:02,022 INFO L276 IsEmpty]: Start isEmpty. Operand 6501 states and 14637 transitions. [2019-12-28 01:56:02,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 01:56:02,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:02,035 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] [2019-12-28 01:56:02,035 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:02,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:02,036 INFO L82 PathProgramCache]: Analyzing trace with hash 101811544, now seen corresponding path program 1 times [2019-12-28 01:56:02,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:02,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319112497] [2019-12-28 01:56:02,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:02,156 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-28 01:56:02,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319112497] [2019-12-28 01:56:02,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:02,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:56:02,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [401770376] [2019-12-28 01:56:02,157 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:02,194 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:02,281 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 149 states and 198 transitions. [2019-12-28 01:56:02,281 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:02,426 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-28 01:56:02,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-28 01:56:02,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:02,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-28 01:56:02,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-28 01:56:02,427 INFO L87 Difference]: Start difference. First operand 6501 states and 14637 transitions. Second operand 12 states. [2019-12-28 01:56:02,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:02,906 INFO L93 Difference]: Finished difference Result 7825 states and 17474 transitions. [2019-12-28 01:56:02,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-28 01:56:02,906 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 86 [2019-12-28 01:56:02,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:02,916 INFO L225 Difference]: With dead ends: 7825 [2019-12-28 01:56:02,917 INFO L226 Difference]: Without dead ends: 7825 [2019-12-28 01:56:02,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2019-12-28 01:56:02,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7825 states. [2019-12-28 01:56:03,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7825 to 5931. [2019-12-28 01:56:03,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5931 states. [2019-12-28 01:56:03,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5931 states to 5931 states and 13252 transitions. [2019-12-28 01:56:03,031 INFO L78 Accepts]: Start accepts. Automaton has 5931 states and 13252 transitions. Word has length 86 [2019-12-28 01:56:03,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:03,032 INFO L462 AbstractCegarLoop]: Abstraction has 5931 states and 13252 transitions. [2019-12-28 01:56:03,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-28 01:56:03,032 INFO L276 IsEmpty]: Start isEmpty. Operand 5931 states and 13252 transitions. [2019-12-28 01:56:03,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 01:56:03,044 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:03,044 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] [2019-12-28 01:56:03,044 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:03,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:03,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1630164008, now seen corresponding path program 1 times [2019-12-28 01:56:03,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:03,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495915572] [2019-12-28 01:56:03,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:03,223 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-28 01:56:03,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495915572] [2019-12-28 01:56:03,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:03,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:56:03,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2062229105] [2019-12-28 01:56:03,226 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:03,261 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:03,347 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 149 states and 198 transitions. [2019-12-28 01:56:03,348 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:03,349 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:56:03,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:56:03,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:03,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:56:03,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:56:03,350 INFO L87 Difference]: Start difference. First operand 5931 states and 13252 transitions. Second operand 6 states. [2019-12-28 01:56:03,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:03,560 INFO L93 Difference]: Finished difference Result 5805 states and 12832 transitions. [2019-12-28 01:56:03,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 01:56:03,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-12-28 01:56:03,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:03,571 INFO L225 Difference]: With dead ends: 5805 [2019-12-28 01:56:03,571 INFO L226 Difference]: Without dead ends: 5805 [2019-12-28 01:56:03,572 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-28 01:56:03,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5805 states. [2019-12-28 01:56:03,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5805 to 3359. [2019-12-28 01:56:03,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3359 states. [2019-12-28 01:56:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3359 states to 3359 states and 7576 transitions. [2019-12-28 01:56:03,662 INFO L78 Accepts]: Start accepts. Automaton has 3359 states and 7576 transitions. Word has length 86 [2019-12-28 01:56:03,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:03,663 INFO L462 AbstractCegarLoop]: Abstraction has 3359 states and 7576 transitions. [2019-12-28 01:56:03,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:56:03,663 INFO L276 IsEmpty]: Start isEmpty. Operand 3359 states and 7576 transitions. [2019-12-28 01:56:03,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-28 01:56:03,670 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:03,670 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] [2019-12-28 01:56:03,670 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:03,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:03,671 INFO L82 PathProgramCache]: Analyzing trace with hash 2082346205, now seen corresponding path program 1 times [2019-12-28 01:56:03,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:03,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885124612] [2019-12-28 01:56:03,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:03,821 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-28 01:56:03,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885124612] [2019-12-28 01:56:03,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:03,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 01:56:03,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1967724721] [2019-12-28 01:56:03,828 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:03,867 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:03,947 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 215 transitions. [2019-12-28 01:56:03,948 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:03,948 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 01:56:03,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 01:56:03,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:03,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 01:56:03,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 01:56:03,952 INFO L87 Difference]: Start difference. First operand 3359 states and 7576 transitions. Second operand 6 states. [2019-12-28 01:56:04,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:04,187 INFO L93 Difference]: Finished difference Result 3543 states and 7942 transitions. [2019-12-28 01:56:04,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 01:56:04,188 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2019-12-28 01:56:04,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:04,193 INFO L225 Difference]: With dead ends: 3543 [2019-12-28 01:56:04,193 INFO L226 Difference]: Without dead ends: 3543 [2019-12-28 01:56:04,193 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-28 01:56:04,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3543 states. [2019-12-28 01:56:04,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3543 to 3296. [2019-12-28 01:56:04,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3296 states. [2019-12-28 01:56:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3296 states to 3296 states and 7423 transitions. [2019-12-28 01:56:04,227 INFO L78 Accepts]: Start accepts. Automaton has 3296 states and 7423 transitions. Word has length 88 [2019-12-28 01:56:04,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:04,228 INFO L462 AbstractCegarLoop]: Abstraction has 3296 states and 7423 transitions. [2019-12-28 01:56:04,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 01:56:04,228 INFO L276 IsEmpty]: Start isEmpty. Operand 3296 states and 7423 transitions. [2019-12-28 01:56:04,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-28 01:56:04,231 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:04,231 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] [2019-12-28 01:56:04,231 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:04,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:04,231 INFO L82 PathProgramCache]: Analyzing trace with hash -751041092, now seen corresponding path program 1 times [2019-12-28 01:56:04,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:04,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204560580] [2019-12-28 01:56:04,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:04,453 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-28 01:56:04,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204560580] [2019-12-28 01:56:04,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:04,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 01:56:04,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1329673575] [2019-12-28 01:56:04,454 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:04,473 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:04,545 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 215 transitions. [2019-12-28 01:56:04,546 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:04,574 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 01:56:04,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 01:56:04,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:04,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 01:56:04,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-28 01:56:04,575 INFO L87 Difference]: Start difference. First operand 3296 states and 7423 transitions. Second operand 9 states. [2019-12-28 01:56:05,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:05,794 INFO L93 Difference]: Finished difference Result 4220 states and 9384 transitions. [2019-12-28 01:56:05,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-28 01:56:05,795 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-12-28 01:56:05,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:05,800 INFO L225 Difference]: With dead ends: 4220 [2019-12-28 01:56:05,801 INFO L226 Difference]: Without dead ends: 4220 [2019-12-28 01:56:05,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-12-28 01:56:05,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4220 states. [2019-12-28 01:56:05,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4220 to 3744. [2019-12-28 01:56:05,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3744 states. [2019-12-28 01:56:05,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3744 states and 8379 transitions. [2019-12-28 01:56:05,864 INFO L78 Accepts]: Start accepts. Automaton has 3744 states and 8379 transitions. Word has length 88 [2019-12-28 01:56:05,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:05,864 INFO L462 AbstractCegarLoop]: Abstraction has 3744 states and 8379 transitions. [2019-12-28 01:56:05,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 01:56:05,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3744 states and 8379 transitions. [2019-12-28 01:56:05,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-28 01:56:05,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:05,870 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] [2019-12-28 01:56:05,870 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:05,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:05,871 INFO L82 PathProgramCache]: Analyzing trace with hash 136462589, now seen corresponding path program 1 times [2019-12-28 01:56:05,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:05,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799194563] [2019-12-28 01:56:05,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:06,008 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-28 01:56:06,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799194563] [2019-12-28 01:56:06,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:06,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 01:56:06,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1788092624] [2019-12-28 01:56:06,009 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:06,030 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:06,172 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 215 transitions. [2019-12-28 01:56:06,172 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:06,195 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 01:56:06,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 01:56:06,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:06,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 01:56:06,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-28 01:56:06,196 INFO L87 Difference]: Start difference. First operand 3744 states and 8379 transitions. Second operand 8 states. [2019-12-28 01:56:06,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:06,313 INFO L93 Difference]: Finished difference Result 6386 states and 14377 transitions. [2019-12-28 01:56:06,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 01:56:06,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2019-12-28 01:56:06,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:06,318 INFO L225 Difference]: With dead ends: 6386 [2019-12-28 01:56:06,318 INFO L226 Difference]: Without dead ends: 2734 [2019-12-28 01:56:06,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-28 01:56:06,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2734 states. [2019-12-28 01:56:06,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2734 to 2734. [2019-12-28 01:56:06,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2734 states. [2019-12-28 01:56:06,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2734 states to 2734 states and 6146 transitions. [2019-12-28 01:56:06,355 INFO L78 Accepts]: Start accepts. Automaton has 2734 states and 6146 transitions. Word has length 88 [2019-12-28 01:56:06,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:06,355 INFO L462 AbstractCegarLoop]: Abstraction has 2734 states and 6146 transitions. [2019-12-28 01:56:06,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 01:56:06,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2734 states and 6146 transitions. [2019-12-28 01:56:06,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-28 01:56:06,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:06,359 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] [2019-12-28 01:56:06,359 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:06,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:06,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1710229601, now seen corresponding path program 2 times [2019-12-28 01:56:06,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:06,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923164662] [2019-12-28 01:56:06,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 01:56:06,484 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-28 01:56:06,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923164662] [2019-12-28 01:56:06,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 01:56:06,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 01:56:06,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [499814979] [2019-12-28 01:56:06,486 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 01:56:06,509 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 01:56:06,566 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 127 states and 160 transitions. [2019-12-28 01:56:06,566 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 01:56:06,596 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 01:56:06,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 01:56:06,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 01:56:06,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 01:56:06,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-28 01:56:06,598 INFO L87 Difference]: Start difference. First operand 2734 states and 6146 transitions. Second operand 11 states. [2019-12-28 01:56:07,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 01:56:07,427 INFO L93 Difference]: Finished difference Result 5044 states and 11327 transitions. [2019-12-28 01:56:07,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-28 01:56:07,427 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 88 [2019-12-28 01:56:07,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 01:56:07,432 INFO L225 Difference]: With dead ends: 5044 [2019-12-28 01:56:07,432 INFO L226 Difference]: Without dead ends: 3347 [2019-12-28 01:56:07,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-28 01:56:07,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3347 states. [2019-12-28 01:56:07,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3347 to 2781. [2019-12-28 01:56:07,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2781 states. [2019-12-28 01:56:07,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 6187 transitions. [2019-12-28 01:56:07,462 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 6187 transitions. Word has length 88 [2019-12-28 01:56:07,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 01:56:07,462 INFO L462 AbstractCegarLoop]: Abstraction has 2781 states and 6187 transitions. [2019-12-28 01:56:07,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 01:56:07,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 6187 transitions. [2019-12-28 01:56:07,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-28 01:56:07,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 01:56:07,466 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] [2019-12-28 01:56:07,466 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 01:56:07,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 01:56:07,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1220418877, now seen corresponding path program 3 times [2019-12-28 01:56:07,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 01:56:07,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371203508] [2019-12-28 01:56:07,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 01:56:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 01:56:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 01:56:07,542 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 01:56:07,543 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 01:56:07,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 01:56:07 BasicIcfg [2019-12-28 01:56:07,740 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 01:56:07,745 INFO L168 Benchmark]: Toolchain (without parser) took 44180.47 ms. Allocated memory was 136.8 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 99.8 MB in the beginning and 1.0 GB in the end (delta: -931.5 MB). Peak memory consumption was 984.8 MB. Max. memory is 7.1 GB. [2019-12-28 01:56:07,746 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-28 01:56:07,746 INFO L168 Benchmark]: CACSL2BoogieTranslator took 732.38 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.3 MB in the beginning and 155.7 MB in the end (delta: -56.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-28 01:56:07,747 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.99 ms. Allocated memory is still 200.8 MB. Free memory was 155.7 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 01:56:07,747 INFO L168 Benchmark]: Boogie Preprocessor took 37.16 ms. Allocated memory is still 200.8 MB. Free memory was 153.0 MB in the beginning and 150.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-28 01:56:07,753 INFO L168 Benchmark]: RCFGBuilder took 806.03 ms. Allocated memory is still 200.8 MB. Free memory was 150.9 MB in the beginning and 109.4 MB in the end (delta: 41.5 MB). Peak memory consumption was 41.5 MB. Max. memory is 7.1 GB. [2019-12-28 01:56:07,754 INFO L168 Benchmark]: TraceAbstraction took 42534.32 ms. Allocated memory was 200.8 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 108.7 MB in the beginning and 1.0 GB in the end (delta: -922.5 MB). Peak memory consumption was 929.8 MB. Max. memory is 7.1 GB. [2019-12-28 01:56:07,756 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 732.38 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.3 MB in the beginning and 155.7 MB in the end (delta: -56.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.99 ms. Allocated memory is still 200.8 MB. Free memory was 155.7 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.16 ms. Allocated memory is still 200.8 MB. Free memory was 153.0 MB in the beginning and 150.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 806.03 ms. Allocated memory is still 200.8 MB. Free memory was 150.9 MB in the beginning and 109.4 MB in the end (delta: 41.5 MB). Peak memory consumption was 41.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 42534.32 ms. Allocated memory was 200.8 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 108.7 MB in the beginning and 1.0 GB in the end (delta: -922.5 MB). Peak memory consumption was 929.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L701] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L703] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L705] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L706] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0] [L707] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L709] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L711] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L712] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L713] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L714] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L715] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L716] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L717] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L718] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L719] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L720] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L721] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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}] [L722] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L723] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L724] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L725] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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] [L727] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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, z=0] [L728] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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, z=0] [L729] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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, z=0] [L809] 0 pthread_t t847; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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, z=0] [L810] FCALL, FORK 0 pthread_create(&t847, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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, z=0] [L811] 0 pthread_t t848; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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, z=0] [L812] FCALL, FORK 0 pthread_create(&t848, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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, z=0] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L772] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L773] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L774] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L775] 2 y$r_buff0_thd2 = (_Bool)1 [L778] 2 z = 1 [L781] 2 __unbuffered_p1_EAX = z [L784] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 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) [L788] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] 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 [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L752] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 1 y = y$flush_delayed ? y$mem_tmp : y [L755] 1 y$flush_delayed = (_Bool)0 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] 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 [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L791] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] 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 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] 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) [L819] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 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 [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L822] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 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 [L825] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 133 locations, 2 error locations. Result: UNSAFE, OverallTime: 42.1s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 19.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7208 SDtfs, 12065 SDslu, 19846 SDs, 0 SdLazy, 8396 SolverSat, 704 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 449 GetRequests, 156 SyntacticMatches, 14 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1199 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56774occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 72155 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1921 NumberOfCodeBlocks, 1921 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1807 ConstructedInterpolants, 0 QuantifiedInterpolants, 305043 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...