/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/mix034_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 02:04:17,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 02:04:17,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 02:04:17,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 02:04:17,162 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 02:04:17,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 02:04:17,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 02:04:17,180 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 02:04:17,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 02:04:17,184 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 02:04:17,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 02:04:17,187 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 02:04:17,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 02:04:17,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 02:04:17,192 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 02:04:17,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 02:04:17,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 02:04:17,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 02:04:17,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 02:04:17,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 02:04:17,209 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 02:04:17,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 02:04:17,213 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 02:04:17,215 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 02:04:17,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 02:04:17,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 02:04:17,218 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 02:04:17,220 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 02:04:17,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 02:04:17,223 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 02:04:17,223 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 02:04:17,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 02:04:17,226 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 02:04:17,227 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 02:04:17,229 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 02:04:17,229 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 02:04:17,230 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 02:04:17,231 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 02:04:17,231 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 02:04:17,234 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 02:04:17,236 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 02:04:17,237 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 02:04:17,253 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 02:04:17,254 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 02:04:17,255 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 02:04:17,255 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 02:04:17,255 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 02:04:17,256 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 02:04:17,256 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 02:04:17,256 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 02:04:17,256 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 02:04:17,256 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 02:04:17,257 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 02:04:17,257 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 02:04:17,257 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 02:04:17,257 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 02:04:17,257 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 02:04:17,258 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 02:04:17,258 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 02:04:17,258 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 02:04:17,258 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 02:04:17,259 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 02:04:17,259 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 02:04:17,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 02:04:17,259 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 02:04:17,259 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 02:04:17,260 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 02:04:17,260 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 02:04:17,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 02:04:17,260 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 02:04:17,261 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 02:04:17,261 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 02:04:17,261 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 02:04:17,261 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 02:04:17,557 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 02:04:17,574 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 02:04:17,577 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 02:04:17,579 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 02:04:17,580 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 02:04:17,580 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_tso.opt.i [2019-12-28 02:04:17,656 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c5cfd260/bfb5480188e140ceb5a44a7ba5ca1947/FLAG7dc6bbf26 [2019-12-28 02:04:18,217 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 02:04:18,217 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_tso.opt.i [2019-12-28 02:04:18,239 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c5cfd260/bfb5480188e140ceb5a44a7ba5ca1947/FLAG7dc6bbf26 [2019-12-28 02:04:18,475 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c5cfd260/bfb5480188e140ceb5a44a7ba5ca1947 [2019-12-28 02:04:18,483 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 02:04:18,485 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 02:04:18,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 02:04:18,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 02:04:18,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 02:04:18,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:04:18" (1/1) ... [2019-12-28 02:04:18,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cf90666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:04:18, skipping insertion in model container [2019-12-28 02:04:18,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 02:04:18" (1/1) ... [2019-12-28 02:04:18,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 02:04:18,549 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 02:04:19,043 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 02:04:19,058 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 02:04:19,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 02:04:19,220 INFO L208 MainTranslator]: Completed translation [2019-12-28 02:04:19,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:04:19 WrapperNode [2019-12-28 02:04:19,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 02:04:19,221 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 02:04:19,221 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 02:04:19,221 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 02:04:19,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:04:19" (1/1) ... [2019-12-28 02:04:19,247 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:04:19" (1/1) ... [2019-12-28 02:04:19,275 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 02:04:19,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 02:04:19,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 02:04:19,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 02:04:19,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:04:19" (1/1) ... [2019-12-28 02:04:19,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:04:19" (1/1) ... [2019-12-28 02:04:19,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:04:19" (1/1) ... [2019-12-28 02:04:19,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:04:19" (1/1) ... [2019-12-28 02:04:19,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:04:19" (1/1) ... [2019-12-28 02:04:19,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:04:19" (1/1) ... [2019-12-28 02:04:19,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:04:19" (1/1) ... [2019-12-28 02:04:19,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 02:04:19,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 02:04:19,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 02:04:19,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 02:04:19,313 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:04:19" (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 02:04:19,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 02:04:19,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 02:04:19,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 02:04:19,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 02:04:19,372 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 02:04:19,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 02:04:19,372 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 02:04:19,373 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 02:04:19,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 02:04:19,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 02:04:19,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 02:04:19,375 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 02:04:20,056 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 02:04:20,057 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 02:04:20,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:04:20 BoogieIcfgContainer [2019-12-28 02:04:20,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 02:04:20,059 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 02:04:20,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 02:04:20,063 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 02:04:20,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 02:04:18" (1/3) ... [2019-12-28 02:04:20,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1a2edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:04:20, skipping insertion in model container [2019-12-28 02:04:20,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 02:04:19" (2/3) ... [2019-12-28 02:04:20,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1a2edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 02:04:20, skipping insertion in model container [2019-12-28 02:04:20,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 02:04:20" (3/3) ... [2019-12-28 02:04:20,067 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_tso.opt.i [2019-12-28 02:04:20,078 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 02:04:20,078 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 02:04:20,086 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 02:04:20,087 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 02:04:20,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,125 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,126 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,148 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,150 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,151 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,151 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,151 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,152 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,163 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,163 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,163 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,169 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,170 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 02:04:20,191 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 02:04:20,212 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 02:04:20,213 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 02:04:20,213 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 02:04:20,213 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 02:04:20,213 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 02:04:20,214 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 02:04:20,214 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 02:04:20,214 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 02:04:20,244 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 137 places, 165 transitions [2019-12-28 02:04:21,737 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25977 states. [2019-12-28 02:04:21,739 INFO L276 IsEmpty]: Start isEmpty. Operand 25977 states. [2019-12-28 02:04:21,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-28 02:04:21,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:21,751 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:21,751 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:21,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:21,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1560542466, now seen corresponding path program 1 times [2019-12-28 02:04:21,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:21,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900706954] [2019-12-28 02:04:21,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:22,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:04:22,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900706954] [2019-12-28 02:04:22,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:22,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:04:22,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [556843259] [2019-12-28 02:04:22,079 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:22,086 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:22,118 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 40 transitions. [2019-12-28 02:04:22,119 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:22,125 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:22,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:04:22,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:22,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:04:22,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:04:22,139 INFO L87 Difference]: Start difference. First operand 25977 states. Second operand 4 states. [2019-12-28 02:04:23,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:23,434 INFO L93 Difference]: Finished difference Result 26617 states and 102122 transitions. [2019-12-28 02:04:23,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 02:04:23,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-28 02:04:23,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:23,636 INFO L225 Difference]: With dead ends: 26617 [2019-12-28 02:04:23,636 INFO L226 Difference]: Without dead ends: 20361 [2019-12-28 02:04:23,638 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 02:04:23,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20361 states. [2019-12-28 02:04:24,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20361 to 20361. [2019-12-28 02:04:24,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20361 states. [2019-12-28 02:04:24,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20361 states to 20361 states and 78426 transitions. [2019-12-28 02:04:24,643 INFO L78 Accepts]: Start accepts. Automaton has 20361 states and 78426 transitions. Word has length 40 [2019-12-28 02:04:24,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:24,644 INFO L462 AbstractCegarLoop]: Abstraction has 20361 states and 78426 transitions. [2019-12-28 02:04:24,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:04:24,645 INFO L276 IsEmpty]: Start isEmpty. Operand 20361 states and 78426 transitions. [2019-12-28 02:04:24,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-28 02:04:24,658 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:24,658 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:24,659 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:24,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:24,659 INFO L82 PathProgramCache]: Analyzing trace with hash 880832033, now seen corresponding path program 1 times [2019-12-28 02:04:24,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:24,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617910473] [2019-12-28 02:04:24,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:24,826 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 02:04:24,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617910473] [2019-12-28 02:04:24,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:24,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:04:24,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1969610174] [2019-12-28 02:04:24,835 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:24,844 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:24,854 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 48 transitions. [2019-12-28 02:04:24,855 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:24,856 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:24,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:04:24,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:24,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:04:24,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:04:24,859 INFO L87 Difference]: Start difference. First operand 20361 states and 78426 transitions. Second operand 5 states. [2019-12-28 02:04:25,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:25,883 INFO L93 Difference]: Finished difference Result 31839 states and 116043 transitions. [2019-12-28 02:04:25,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:04:25,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-28 02:04:25,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:26,029 INFO L225 Difference]: With dead ends: 31839 [2019-12-28 02:04:26,030 INFO L226 Difference]: Without dead ends: 31287 [2019-12-28 02:04:26,031 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 02:04:27,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31287 states. [2019-12-28 02:04:27,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31287 to 29706. [2019-12-28 02:04:27,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29706 states. [2019-12-28 02:04:28,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29706 states to 29706 states and 109520 transitions. [2019-12-28 02:04:28,191 INFO L78 Accepts]: Start accepts. Automaton has 29706 states and 109520 transitions. Word has length 48 [2019-12-28 02:04:28,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:28,192 INFO L462 AbstractCegarLoop]: Abstraction has 29706 states and 109520 transitions. [2019-12-28 02:04:28,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:04:28,193 INFO L276 IsEmpty]: Start isEmpty. Operand 29706 states and 109520 transitions. [2019-12-28 02:04:28,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-28 02:04:28,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:28,199 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:28,199 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:28,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:28,200 INFO L82 PathProgramCache]: Analyzing trace with hash 19573473, now seen corresponding path program 1 times [2019-12-28 02:04:28,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:28,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775130322] [2019-12-28 02:04:28,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:28,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:04:28,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775130322] [2019-12-28 02:04:28,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:28,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:04:28,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [996463326] [2019-12-28 02:04:28,306 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:28,313 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:28,322 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 121 transitions. [2019-12-28 02:04:28,323 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:28,390 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:04:28,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:04:28,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:28,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:04:28,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:04:28,392 INFO L87 Difference]: Start difference. First operand 29706 states and 109520 transitions. Second operand 6 states. [2019-12-28 02:04:29,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:29,002 INFO L93 Difference]: Finished difference Result 38697 states and 139692 transitions. [2019-12-28 02:04:29,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:04:29,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-12-28 02:04:29,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:29,208 INFO L225 Difference]: With dead ends: 38697 [2019-12-28 02:04:29,208 INFO L226 Difference]: Without dead ends: 38249 [2019-12-28 02:04:29,208 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 02:04:29,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38249 states. [2019-12-28 02:04:30,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38249 to 32952. [2019-12-28 02:04:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32952 states. [2019-12-28 02:04:32,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32952 states to 32952 states and 120529 transitions. [2019-12-28 02:04:32,480 INFO L78 Accepts]: Start accepts. Automaton has 32952 states and 120529 transitions. Word has length 49 [2019-12-28 02:04:32,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:32,480 INFO L462 AbstractCegarLoop]: Abstraction has 32952 states and 120529 transitions. [2019-12-28 02:04:32,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:04:32,481 INFO L276 IsEmpty]: Start isEmpty. Operand 32952 states and 120529 transitions. [2019-12-28 02:04:32,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-28 02:04:32,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:32,491 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 02:04:32,493 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:32,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:32,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1781202873, now seen corresponding path program 1 times [2019-12-28 02:04:32,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:32,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282579353] [2019-12-28 02:04:32,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:32,551 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 02:04:32,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282579353] [2019-12-28 02:04:32,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:32,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 02:04:32,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [394554140] [2019-12-28 02:04:32,553 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:32,560 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:32,572 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 139 transitions. [2019-12-28 02:04:32,572 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:32,627 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 02:04:32,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:04:32,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:32,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:04:32,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:04:32,628 INFO L87 Difference]: Start difference. First operand 32952 states and 120529 transitions. Second operand 5 states. [2019-12-28 02:04:32,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:32,967 INFO L93 Difference]: Finished difference Result 42413 states and 152020 transitions. [2019-12-28 02:04:32,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 02:04:32,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-28 02:04:32,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:33,101 INFO L225 Difference]: With dead ends: 42413 [2019-12-28 02:04:33,101 INFO L226 Difference]: Without dead ends: 42413 [2019-12-28 02:04:33,102 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 02:04:33,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42413 states. [2019-12-28 02:04:34,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42413 to 37666. [2019-12-28 02:04:34,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37666 states. [2019-12-28 02:04:34,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37666 states to 37666 states and 136333 transitions. [2019-12-28 02:04:34,409 INFO L78 Accepts]: Start accepts. Automaton has 37666 states and 136333 transitions. Word has length 51 [2019-12-28 02:04:34,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:34,409 INFO L462 AbstractCegarLoop]: Abstraction has 37666 states and 136333 transitions. [2019-12-28 02:04:34,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:04:34,409 INFO L276 IsEmpty]: Start isEmpty. Operand 37666 states and 136333 transitions. [2019-12-28 02:04:34,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 02:04:34,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:34,427 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:34,427 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:34,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:34,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1972041490, now seen corresponding path program 1 times [2019-12-28 02:04:34,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:34,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950618454] [2019-12-28 02:04:34,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:34,529 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 02:04:34,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950618454] [2019-12-28 02:04:34,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:34,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:04:34,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [734715443] [2019-12-28 02:04:34,530 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:34,540 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:34,558 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 116 states and 175 transitions. [2019-12-28 02:04:34,559 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:34,611 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 02:04:34,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:04:34,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:34,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:04:34,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:04:34,612 INFO L87 Difference]: Start difference. First operand 37666 states and 136333 transitions. Second operand 8 states. [2019-12-28 02:04:35,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:35,696 INFO L93 Difference]: Finished difference Result 48757 states and 172982 transitions. [2019-12-28 02:04:35,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 02:04:35,697 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-28 02:04:35,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:35,843 INFO L225 Difference]: With dead ends: 48757 [2019-12-28 02:04:35,843 INFO L226 Difference]: Without dead ends: 48237 [2019-12-28 02:04:35,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-28 02:04:36,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48237 states. [2019-12-28 02:04:36,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48237 to 38230. [2019-12-28 02:04:36,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38230 states. [2019-12-28 02:04:38,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38230 states to 38230 states and 138496 transitions. [2019-12-28 02:04:38,716 INFO L78 Accepts]: Start accepts. Automaton has 38230 states and 138496 transitions. Word has length 55 [2019-12-28 02:04:38,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:38,717 INFO L462 AbstractCegarLoop]: Abstraction has 38230 states and 138496 transitions. [2019-12-28 02:04:38,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:04:38,717 INFO L276 IsEmpty]: Start isEmpty. Operand 38230 states and 138496 transitions. [2019-12-28 02:04:38,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 02:04:38,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:38,731 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:38,731 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:38,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:38,732 INFO L82 PathProgramCache]: Analyzing trace with hash 305776006, now seen corresponding path program 1 times [2019-12-28 02:04:38,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:38,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697684386] [2019-12-28 02:04:38,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:38,852 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 02:04:38,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697684386] [2019-12-28 02:04:38,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:38,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:04:38,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2147386175] [2019-12-28 02:04:38,853 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:38,864 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:38,876 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 59 transitions. [2019-12-28 02:04:38,876 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:38,900 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 02:04:38,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:04:38,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:38,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:04:38,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:04:38,902 INFO L87 Difference]: Start difference. First operand 38230 states and 138496 transitions. Second operand 8 states. [2019-12-28 02:04:39,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:39,826 INFO L93 Difference]: Finished difference Result 53006 states and 189572 transitions. [2019-12-28 02:04:39,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 02:04:39,826 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-28 02:04:39,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:39,964 INFO L225 Difference]: With dead ends: 53006 [2019-12-28 02:04:39,964 INFO L226 Difference]: Without dead ends: 52030 [2019-12-28 02:04:39,965 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 02:04:40,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52030 states. [2019-12-28 02:04:41,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52030 to 48783. [2019-12-28 02:04:41,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48783 states. [2019-12-28 02:04:41,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48783 states to 48783 states and 175227 transitions. [2019-12-28 02:04:41,146 INFO L78 Accepts]: Start accepts. Automaton has 48783 states and 175227 transitions. Word has length 55 [2019-12-28 02:04:41,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:41,146 INFO L462 AbstractCegarLoop]: Abstraction has 48783 states and 175227 transitions. [2019-12-28 02:04:41,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:04:41,147 INFO L276 IsEmpty]: Start isEmpty. Operand 48783 states and 175227 transitions. [2019-12-28 02:04:41,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 02:04:41,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:41,162 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:41,162 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:41,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:41,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1491175353, now seen corresponding path program 1 times [2019-12-28 02:04:41,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:41,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845510055] [2019-12-28 02:04:41,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:41,265 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 02:04:41,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845510055] [2019-12-28 02:04:41,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:41,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:04:41,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1352781639] [2019-12-28 02:04:41,266 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:41,272 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:41,279 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 59 transitions. [2019-12-28 02:04:41,279 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:41,301 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 02:04:41,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 02:04:41,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:41,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 02:04:41,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:04:41,302 INFO L87 Difference]: Start difference. First operand 48783 states and 175227 transitions. Second operand 9 states. [2019-12-28 02:04:42,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:42,977 INFO L93 Difference]: Finished difference Result 70898 states and 244524 transitions. [2019-12-28 02:04:42,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 02:04:42,977 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-28 02:04:42,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:43,127 INFO L225 Difference]: With dead ends: 70898 [2019-12-28 02:04:43,127 INFO L226 Difference]: Without dead ends: 70898 [2019-12-28 02:04:43,127 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 02:04:43,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70898 states. [2019-12-28 02:04:46,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70898 to 57891. [2019-12-28 02:04:46,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57891 states. [2019-12-28 02:04:46,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57891 states to 57891 states and 203151 transitions. [2019-12-28 02:04:46,492 INFO L78 Accepts]: Start accepts. Automaton has 57891 states and 203151 transitions. Word has length 55 [2019-12-28 02:04:46,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:46,492 INFO L462 AbstractCegarLoop]: Abstraction has 57891 states and 203151 transitions. [2019-12-28 02:04:46,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 02:04:46,492 INFO L276 IsEmpty]: Start isEmpty. Operand 57891 states and 203151 transitions. [2019-12-28 02:04:46,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 02:04:46,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:46,506 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:46,506 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:46,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:46,506 INFO L82 PathProgramCache]: Analyzing trace with hash -603671672, now seen corresponding path program 1 times [2019-12-28 02:04:46,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:46,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82640422] [2019-12-28 02:04:46,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:46,603 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 02:04:46,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82640422] [2019-12-28 02:04:46,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:46,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:04:46,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [653802111] [2019-12-28 02:04:46,604 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:46,612 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:46,619 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 59 transitions. [2019-12-28 02:04:46,620 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:46,620 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:46,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:04:46,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:46,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:04:46,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:04:46,621 INFO L87 Difference]: Start difference. First operand 57891 states and 203151 transitions. Second operand 4 states. [2019-12-28 02:04:46,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:46,687 INFO L93 Difference]: Finished difference Result 10861 states and 33396 transitions. [2019-12-28 02:04:46,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:04:46,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-28 02:04:46,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:46,707 INFO L225 Difference]: With dead ends: 10861 [2019-12-28 02:04:46,707 INFO L226 Difference]: Without dead ends: 9362 [2019-12-28 02:04:46,708 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 02:04:46,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9362 states. [2019-12-28 02:04:46,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9362 to 9314. [2019-12-28 02:04:46,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9314 states. [2019-12-28 02:04:46,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9314 states to 9314 states and 28346 transitions. [2019-12-28 02:04:46,876 INFO L78 Accepts]: Start accepts. Automaton has 9314 states and 28346 transitions. Word has length 55 [2019-12-28 02:04:46,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:46,877 INFO L462 AbstractCegarLoop]: Abstraction has 9314 states and 28346 transitions. [2019-12-28 02:04:46,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:04:46,877 INFO L276 IsEmpty]: Start isEmpty. Operand 9314 states and 28346 transitions. [2019-12-28 02:04:46,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-28 02:04:46,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:46,882 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:46,882 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:46,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:46,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1220452560, now seen corresponding path program 1 times [2019-12-28 02:04:46,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:46,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517473054] [2019-12-28 02:04:46,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:46,961 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 02:04:46,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517473054] [2019-12-28 02:04:46,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:46,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:04:46,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [417014062] [2019-12-28 02:04:46,964 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:46,979 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:47,011 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 201 transitions. [2019-12-28 02:04:47,011 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:47,037 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:04:47,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:04:47,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:47,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:04:47,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:04:47,039 INFO L87 Difference]: Start difference. First operand 9314 states and 28346 transitions. Second operand 5 states. [2019-12-28 02:04:47,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:47,210 INFO L93 Difference]: Finished difference Result 10889 states and 33038 transitions. [2019-12-28 02:04:47,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:04:47,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-28 02:04:47,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:47,225 INFO L225 Difference]: With dead ends: 10889 [2019-12-28 02:04:47,225 INFO L226 Difference]: Without dead ends: 10889 [2019-12-28 02:04:47,226 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 02:04:47,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10889 states. [2019-12-28 02:04:47,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10889 to 9881. [2019-12-28 02:04:47,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9881 states. [2019-12-28 02:04:47,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9881 states to 9881 states and 30017 transitions. [2019-12-28 02:04:47,359 INFO L78 Accepts]: Start accepts. Automaton has 9881 states and 30017 transitions. Word has length 65 [2019-12-28 02:04:47,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:47,359 INFO L462 AbstractCegarLoop]: Abstraction has 9881 states and 30017 transitions. [2019-12-28 02:04:47,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:04:47,360 INFO L276 IsEmpty]: Start isEmpty. Operand 9881 states and 30017 transitions. [2019-12-28 02:04:47,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-28 02:04:47,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:47,367 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 02:04:47,367 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:47,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:47,368 INFO L82 PathProgramCache]: Analyzing trace with hash 522357775, now seen corresponding path program 1 times [2019-12-28 02:04:47,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:47,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50268888] [2019-12-28 02:04:47,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:47,430 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 02:04:47,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50268888] [2019-12-28 02:04:47,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:47,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:04:47,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1755934175] [2019-12-28 02:04:47,431 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:47,441 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:47,467 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 201 transitions. [2019-12-28 02:04:47,467 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:47,485 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:04:47,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:04:47,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:47,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:04:47,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:04:47,487 INFO L87 Difference]: Start difference. First operand 9881 states and 30017 transitions. Second operand 7 states. [2019-12-28 02:04:48,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:48,292 INFO L93 Difference]: Finished difference Result 12787 states and 38227 transitions. [2019-12-28 02:04:48,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-28 02:04:48,293 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-28 02:04:48,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:48,310 INFO L225 Difference]: With dead ends: 12787 [2019-12-28 02:04:48,310 INFO L226 Difference]: Without dead ends: 12739 [2019-12-28 02:04:48,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-28 02:04:48,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12739 states. [2019-12-28 02:04:48,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12739 to 10620. [2019-12-28 02:04:48,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10620 states. [2019-12-28 02:04:48,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10620 states to 10620 states and 32070 transitions. [2019-12-28 02:04:48,453 INFO L78 Accepts]: Start accepts. Automaton has 10620 states and 32070 transitions. Word has length 65 [2019-12-28 02:04:48,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:48,453 INFO L462 AbstractCegarLoop]: Abstraction has 10620 states and 32070 transitions. [2019-12-28 02:04:48,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:04:48,453 INFO L276 IsEmpty]: Start isEmpty. Operand 10620 states and 32070 transitions. [2019-12-28 02:04:48,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 02:04:48,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04: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 02:04:48,461 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:48,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:48,461 INFO L82 PathProgramCache]: Analyzing trace with hash -250494389, now seen corresponding path program 1 times [2019-12-28 02:04:48,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:48,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452711344] [2019-12-28 02:04:48,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:48,525 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 02:04:48,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452711344] [2019-12-28 02:04:48,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:48,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:04:48,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [834790893] [2019-12-28 02:04:48,527 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:48,537 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:48,549 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 67 transitions. [2019-12-28 02:04:48,550 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:48,550 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:48,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:04:48,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:48,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:04:48,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:04:48,551 INFO L87 Difference]: Start difference. First operand 10620 states and 32070 transitions. Second operand 4 states. [2019-12-28 02:04:48,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:48,802 INFO L93 Difference]: Finished difference Result 13322 states and 39672 transitions. [2019-12-28 02:04:48,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 02:04:48,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-28 02:04:48,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:48,820 INFO L225 Difference]: With dead ends: 13322 [2019-12-28 02:04:48,821 INFO L226 Difference]: Without dead ends: 13322 [2019-12-28 02:04:48,821 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 02:04:48,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13322 states. [2019-12-28 02:04:48,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13322 to 12176. [2019-12-28 02:04:48,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12176 states. [2019-12-28 02:04:48,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12176 states to 12176 states and 36361 transitions. [2019-12-28 02:04:48,980 INFO L78 Accepts]: Start accepts. Automaton has 12176 states and 36361 transitions. Word has length 67 [2019-12-28 02:04:48,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:48,980 INFO L462 AbstractCegarLoop]: Abstraction has 12176 states and 36361 transitions. [2019-12-28 02:04:48,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:04:48,981 INFO L276 IsEmpty]: Start isEmpty. Operand 12176 states and 36361 transitions. [2019-12-28 02:04:48,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 02:04:48,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:48,990 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 02:04:48,991 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:48,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:48,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1967263564, now seen corresponding path program 1 times [2019-12-28 02:04:48,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:48,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843753438] [2019-12-28 02:04:48,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:49,035 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 02:04:49,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843753438] [2019-12-28 02:04:49,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:49,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 02:04:49,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1105811973] [2019-12-28 02:04:49,036 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:49,046 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:49,058 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 67 transitions. [2019-12-28 02:04:49,059 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:49,059 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:49,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 02:04:49,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:49,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 02:04:49,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 02:04:49,060 INFO L87 Difference]: Start difference. First operand 12176 states and 36361 transitions. Second operand 3 states. [2019-12-28 02:04:49,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:49,246 INFO L93 Difference]: Finished difference Result 12702 states and 37766 transitions. [2019-12-28 02:04:49,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 02:04:49,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-28 02:04:49,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:49,265 INFO L225 Difference]: With dead ends: 12702 [2019-12-28 02:04:49,265 INFO L226 Difference]: Without dead ends: 12702 [2019-12-28 02:04:49,266 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 02:04:49,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12702 states. [2019-12-28 02:04:49,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12702 to 12464. [2019-12-28 02:04:49,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12464 states. [2019-12-28 02:04:49,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12464 states to 12464 states and 37125 transitions. [2019-12-28 02:04:49,419 INFO L78 Accepts]: Start accepts. Automaton has 12464 states and 37125 transitions. Word has length 67 [2019-12-28 02:04:49,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:49,419 INFO L462 AbstractCegarLoop]: Abstraction has 12464 states and 37125 transitions. [2019-12-28 02:04:49,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 02:04:49,419 INFO L276 IsEmpty]: Start isEmpty. Operand 12464 states and 37125 transitions. [2019-12-28 02:04:49,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:04:49,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:49,429 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 02:04:49,430 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:49,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:49,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1379599333, now seen corresponding path program 1 times [2019-12-28 02:04:49,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:49,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382663328] [2019-12-28 02:04:49,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:49,490 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 02:04:49,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382663328] [2019-12-28 02:04:49,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:49,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:04:49,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [346515618] [2019-12-28 02:04:49,492 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:49,503 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:49,516 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 02:04:49,516 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:49,517 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:49,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:04:49,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:49,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:04:49,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:04:49,518 INFO L87 Difference]: Start difference. First operand 12464 states and 37125 transitions. Second operand 6 states. [2019-12-28 02:04:50,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:50,372 INFO L93 Difference]: Finished difference Result 23174 states and 68856 transitions. [2019-12-28 02:04:50,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 02:04:50,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-28 02:04:50,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:50,413 INFO L225 Difference]: With dead ends: 23174 [2019-12-28 02:04:50,414 INFO L226 Difference]: Without dead ends: 23174 [2019-12-28 02:04:50,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-28 02:04:50,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23174 states. [2019-12-28 02:04:50,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23174 to 16076. [2019-12-28 02:04:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16076 states. [2019-12-28 02:04:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16076 states to 16076 states and 47615 transitions. [2019-12-28 02:04:50,907 INFO L78 Accepts]: Start accepts. Automaton has 16076 states and 47615 transitions. Word has length 69 [2019-12-28 02:04:50,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:50,907 INFO L462 AbstractCegarLoop]: Abstraction has 16076 states and 47615 transitions. [2019-12-28 02:04:50,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:04:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand 16076 states and 47615 transitions. [2019-12-28 02:04:50,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:04:50,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:50,923 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 02:04:50,923 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:50,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:50,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1890133510, now seen corresponding path program 1 times [2019-12-28 02:04:50,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:50,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910933530] [2019-12-28 02:04:50,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:51,027 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 02:04:51,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910933530] [2019-12-28 02:04:51,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:51,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:04:51,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [308260620] [2019-12-28 02:04:51,028 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:51,043 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:51,058 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 02:04:51,059 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:51,059 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:51,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 02:04:51,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:51,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 02:04:51,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 02:04:51,060 INFO L87 Difference]: Start difference. First operand 16076 states and 47615 transitions. Second operand 6 states. [2019-12-28 02:04:51,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:51,631 INFO L93 Difference]: Finished difference Result 16312 states and 48080 transitions. [2019-12-28 02:04:51,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:04:51,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-28 02:04:51,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:51,654 INFO L225 Difference]: With dead ends: 16312 [2019-12-28 02:04:51,654 INFO L226 Difference]: Without dead ends: 16312 [2019-12-28 02:04:51,654 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 02:04:51,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16312 states. [2019-12-28 02:04:51,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16312 to 15788. [2019-12-28 02:04:51,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15788 states. [2019-12-28 02:04:51,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15788 states to 15788 states and 46696 transitions. [2019-12-28 02:04:51,856 INFO L78 Accepts]: Start accepts. Automaton has 15788 states and 46696 transitions. Word has length 69 [2019-12-28 02:04:51,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:51,856 INFO L462 AbstractCegarLoop]: Abstraction has 15788 states and 46696 transitions. [2019-12-28 02:04:51,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 02:04:51,856 INFO L276 IsEmpty]: Start isEmpty. Operand 15788 states and 46696 transitions. [2019-12-28 02:04:51,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:04:51,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:51,869 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 02:04:51,869 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:51,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:51,869 INFO L82 PathProgramCache]: Analyzing trace with hash 838158620, now seen corresponding path program 1 times [2019-12-28 02:04:51,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:51,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357963124] [2019-12-28 02:04:51,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:51,954 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 02:04:51,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357963124] [2019-12-28 02:04:51,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:51,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:04:51,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [632661548] [2019-12-28 02:04:51,955 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:51,966 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:51,976 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 02:04:51,977 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:51,977 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:51,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:04:51,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:51,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:04:51,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:04:51,978 INFO L87 Difference]: Start difference. First operand 15788 states and 46696 transitions. Second operand 5 states. [2019-12-28 02:04:52,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:52,284 INFO L93 Difference]: Finished difference Result 20228 states and 59547 transitions. [2019-12-28 02:04:52,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 02:04:52,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-28 02:04:52,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:52,311 INFO L225 Difference]: With dead ends: 20228 [2019-12-28 02:04:52,312 INFO L226 Difference]: Without dead ends: 20228 [2019-12-28 02:04:52,312 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 02:04:52,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20228 states. [2019-12-28 02:04:52,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20228 to 15792. [2019-12-28 02:04:52,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15792 states. [2019-12-28 02:04:52,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15792 states to 15792 states and 46227 transitions. [2019-12-28 02:04:52,549 INFO L78 Accepts]: Start accepts. Automaton has 15792 states and 46227 transitions. Word has length 69 [2019-12-28 02:04:52,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:52,549 INFO L462 AbstractCegarLoop]: Abstraction has 15792 states and 46227 transitions. [2019-12-28 02:04:52,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:04:52,550 INFO L276 IsEmpty]: Start isEmpty. Operand 15792 states and 46227 transitions. [2019-12-28 02:04:52,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:04:52,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:52,563 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 02:04:52,563 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:52,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:52,564 INFO L82 PathProgramCache]: Analyzing trace with hash 327624443, now seen corresponding path program 1 times [2019-12-28 02:04:52,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:52,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269555728] [2019-12-28 02:04:52,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:52,617 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 02:04:52,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269555728] [2019-12-28 02:04:52,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:52,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:04:52,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [593424120] [2019-12-28 02:04:52,618 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:52,629 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:52,643 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 02:04:52,643 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:52,643 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:52,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:04:52,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:52,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:04:52,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:04:52,644 INFO L87 Difference]: Start difference. First operand 15792 states and 46227 transitions. Second operand 5 states. [2019-12-28 02:04:53,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:53,328 INFO L93 Difference]: Finished difference Result 20568 states and 59927 transitions. [2019-12-28 02:04:53,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 02:04:53,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-28 02:04:53,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:53,357 INFO L225 Difference]: With dead ends: 20568 [2019-12-28 02:04:53,357 INFO L226 Difference]: Without dead ends: 20568 [2019-12-28 02:04:53,357 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 02:04:53,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20568 states. [2019-12-28 02:04:53,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20568 to 16697. [2019-12-28 02:04:53,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16697 states. [2019-12-28 02:04:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16697 states to 16697 states and 48872 transitions. [2019-12-28 02:04:53,590 INFO L78 Accepts]: Start accepts. Automaton has 16697 states and 48872 transitions. Word has length 69 [2019-12-28 02:04:53,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:53,590 INFO L462 AbstractCegarLoop]: Abstraction has 16697 states and 48872 transitions. [2019-12-28 02:04:53,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:04:53,590 INFO L276 IsEmpty]: Start isEmpty. Operand 16697 states and 48872 transitions. [2019-12-28 02:04:53,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:04:53,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:53,601 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 02:04:53,601 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:53,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:53,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1479830020, now seen corresponding path program 1 times [2019-12-28 02:04:53,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:53,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194811309] [2019-12-28 02:04:53,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:53,656 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 02:04:53,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194811309] [2019-12-28 02:04:53,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:53,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 02:04:53,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [132392927] [2019-12-28 02:04:53,657 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:53,668 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:53,683 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 02:04:53,683 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:53,684 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:53,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 02:04:53,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:53,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 02:04:53,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 02:04:53,685 INFO L87 Difference]: Start difference. First operand 16697 states and 48872 transitions. Second operand 4 states. [2019-12-28 02:04:54,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:54,220 INFO L93 Difference]: Finished difference Result 21470 states and 62923 transitions. [2019-12-28 02:04:54,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 02:04:54,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-28 02:04:54,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:54,251 INFO L225 Difference]: With dead ends: 21470 [2019-12-28 02:04:54,251 INFO L226 Difference]: Without dead ends: 21206 [2019-12-28 02:04:54,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:04:54,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21206 states. [2019-12-28 02:04:54,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21206 to 19805. [2019-12-28 02:04:54,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19805 states. [2019-12-28 02:04:54,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19805 states to 19805 states and 58090 transitions. [2019-12-28 02:04:54,510 INFO L78 Accepts]: Start accepts. Automaton has 19805 states and 58090 transitions. Word has length 69 [2019-12-28 02:04:54,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:54,510 INFO L462 AbstractCegarLoop]: Abstraction has 19805 states and 58090 transitions. [2019-12-28 02:04:54,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 02:04:54,511 INFO L276 IsEmpty]: Start isEmpty. Operand 19805 states and 58090 transitions. [2019-12-28 02:04:54,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:04:54,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:54,522 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 02:04:54,523 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:54,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:54,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1018185917, now seen corresponding path program 1 times [2019-12-28 02:04:54,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:54,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61986303] [2019-12-28 02:04:54,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:54,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:54,656 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 02:04:54,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61986303] [2019-12-28 02:04:54,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:54,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:04:54,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [357624222] [2019-12-28 02:04:54,657 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:54,664 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:54,674 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 02:04:54,674 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:54,674 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:54,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:04:54,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:54,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:04:54,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:04:54,675 INFO L87 Difference]: Start difference. First operand 19805 states and 58090 transitions. Second operand 7 states. [2019-12-28 02:04:55,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:55,142 INFO L93 Difference]: Finished difference Result 18762 states and 52474 transitions. [2019-12-28 02:04:55,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 02:04:55,143 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-28 02:04:55,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:55,167 INFO L225 Difference]: With dead ends: 18762 [2019-12-28 02:04:55,167 INFO L226 Difference]: Without dead ends: 18762 [2019-12-28 02:04:55,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-28 02:04:55,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18762 states. [2019-12-28 02:04:55,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18762 to 12328. [2019-12-28 02:04:55,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12328 states. [2019-12-28 02:04:55,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12328 states to 12328 states and 34556 transitions. [2019-12-28 02:04:55,374 INFO L78 Accepts]: Start accepts. Automaton has 12328 states and 34556 transitions. Word has length 69 [2019-12-28 02:04:55,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:55,374 INFO L462 AbstractCegarLoop]: Abstraction has 12328 states and 34556 transitions. [2019-12-28 02:04:55,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:04:55,374 INFO L276 IsEmpty]: Start isEmpty. Operand 12328 states and 34556 transitions. [2019-12-28 02:04:55,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 02:04:55,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:55,384 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 02:04:55,384 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:55,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:55,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1905689598, now seen corresponding path program 1 times [2019-12-28 02:04:55,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:55,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668783296] [2019-12-28 02:04:55,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:55,455 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 02:04:55,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668783296] [2019-12-28 02:04:55,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:55,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:04:55,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1489776555] [2019-12-28 02:04:55,455 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:55,462 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:55,472 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 02:04:55,472 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:55,473 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 02:04:55,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 02:04:55,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:55,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 02:04:55,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 02:04:55,474 INFO L87 Difference]: Start difference. First operand 12328 states and 34556 transitions. Second operand 5 states. [2019-12-28 02:04:55,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:55,521 INFO L93 Difference]: Finished difference Result 3895 states and 9407 transitions. [2019-12-28 02:04:55,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 02:04:55,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-28 02:04:55,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:55,526 INFO L225 Difference]: With dead ends: 3895 [2019-12-28 02:04:55,526 INFO L226 Difference]: Without dead ends: 3216 [2019-12-28 02:04:55,526 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 02:04:55,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3216 states. [2019-12-28 02:04:55,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3216 to 2984. [2019-12-28 02:04:55,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2984 states. [2019-12-28 02:04:55,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2984 states and 7116 transitions. [2019-12-28 02:04:55,761 INFO L78 Accepts]: Start accepts. Automaton has 2984 states and 7116 transitions. Word has length 69 [2019-12-28 02:04:55,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:55,761 INFO L462 AbstractCegarLoop]: Abstraction has 2984 states and 7116 transitions. [2019-12-28 02:04:55,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 02:04:55,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2984 states and 7116 transitions. [2019-12-28 02:04:55,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 02:04:55,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:55,764 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 02:04:55,765 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:55,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:55,765 INFO L82 PathProgramCache]: Analyzing trace with hash -924760562, now seen corresponding path program 1 times [2019-12-28 02:04:55,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:55,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286021219] [2019-12-28 02:04:55,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:55,887 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 02:04:55,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286021219] [2019-12-28 02:04:55,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:55,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:04:55,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1519130072] [2019-12-28 02:04:55,888 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:55,907 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:55,965 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 137 states and 178 transitions. [2019-12-28 02:04:55,965 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:55,991 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 02:04:55,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:04:55,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:55,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:04:55,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:04:55,992 INFO L87 Difference]: Start difference. First operand 2984 states and 7116 transitions. Second operand 8 states. [2019-12-28 02:04:56,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:56,339 INFO L93 Difference]: Finished difference Result 3903 states and 9109 transitions. [2019-12-28 02:04:56,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 02:04:56,339 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86 [2019-12-28 02:04:56,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:56,344 INFO L225 Difference]: With dead ends: 3903 [2019-12-28 02:04:56,345 INFO L226 Difference]: Without dead ends: 3815 [2019-12-28 02:04:56,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-28 02:04:56,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3815 states. [2019-12-28 02:04:56,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3815 to 2837. [2019-12-28 02:04:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2837 states. [2019-12-28 02:04:56,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2837 states to 2837 states and 6640 transitions. [2019-12-28 02:04:56,393 INFO L78 Accepts]: Start accepts. Automaton has 2837 states and 6640 transitions. Word has length 86 [2019-12-28 02:04:56,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:56,393 INFO L462 AbstractCegarLoop]: Abstraction has 2837 states and 6640 transitions. [2019-12-28 02:04:56,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:04:56,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2837 states and 6640 transitions. [2019-12-28 02:04:56,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 02:04:56,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:56,397 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 02:04:56,398 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:56,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:56,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1292997391, now seen corresponding path program 1 times [2019-12-28 02:04:56,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:56,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055407818] [2019-12-28 02:04:56,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:56,509 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 02:04:56,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055407818] [2019-12-28 02:04:56,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:56,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 02:04:56,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [675158250] [2019-12-28 02:04:56,511 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:56,529 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:56,589 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 137 states and 178 transitions. [2019-12-28 02:04:56,589 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:56,604 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 02:04:56,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 02:04:56,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:56,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 02:04:56,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-28 02:04:56,606 INFO L87 Difference]: Start difference. First operand 2837 states and 6640 transitions. Second operand 8 states. [2019-12-28 02:04:56,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:56,766 INFO L93 Difference]: Finished difference Result 4867 states and 11494 transitions. [2019-12-28 02:04:56,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 02:04:56,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86 [2019-12-28 02:04:56,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:56,771 INFO L225 Difference]: With dead ends: 4867 [2019-12-28 02:04:56,772 INFO L226 Difference]: Without dead ends: 2110 [2019-12-28 02:04:56,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-28 02:04:56,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2110 states. [2019-12-28 02:04:56,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 2077. [2019-12-28 02:04:56,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2077 states. [2019-12-28 02:04:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 2077 states and 4914 transitions. [2019-12-28 02:04:56,811 INFO L78 Accepts]: Start accepts. Automaton has 2077 states and 4914 transitions. Word has length 86 [2019-12-28 02:04:56,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:56,812 INFO L462 AbstractCegarLoop]: Abstraction has 2077 states and 4914 transitions. [2019-12-28 02:04:56,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 02:04:56,812 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 4914 transitions. [2019-12-28 02:04:56,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 02:04:56,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:56,816 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 02:04:56,816 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:56,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:56,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1636502420, now seen corresponding path program 1 times [2019-12-28 02:04:56,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:56,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948351115] [2019-12-28 02:04:56,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:56,907 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 02:04:56,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948351115] [2019-12-28 02:04:56,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:56,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 02:04:56,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [579846521] [2019-12-28 02:04:56,909 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:56,928 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:56,988 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 128 states and 168 transitions. [2019-12-28 02:04:56,988 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:57,021 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 02:04:57,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:04:57,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:57,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:04:57,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:04:57,023 INFO L87 Difference]: Start difference. First operand 2077 states and 4914 transitions. Second operand 7 states. [2019-12-28 02:04:57,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:57,797 INFO L93 Difference]: Finished difference Result 3007 states and 6805 transitions. [2019-12-28 02:04:57,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 02:04:57,798 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-12-28 02:04:57,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:57,802 INFO L225 Difference]: With dead ends: 3007 [2019-12-28 02:04:57,803 INFO L226 Difference]: Without dead ends: 2985 [2019-12-28 02:04:57,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-28 02:04:57,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2019-12-28 02:04:57,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2107. [2019-12-28 02:04:57,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2107 states. [2019-12-28 02:04:57,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 4809 transitions. [2019-12-28 02:04:57,826 INFO L78 Accepts]: Start accepts. Automaton has 2107 states and 4809 transitions. Word has length 86 [2019-12-28 02:04:57,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:57,826 INFO L462 AbstractCegarLoop]: Abstraction has 2107 states and 4809 transitions. [2019-12-28 02:04:57,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:04:57,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 4809 transitions. [2019-12-28 02:04:57,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 02:04:57,828 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:57,828 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 02:04:57,828 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:57,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:57,829 INFO L82 PathProgramCache]: Analyzing trace with hash -943400723, now seen corresponding path program 1 times [2019-12-28 02:04:57,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:57,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902453744] [2019-12-28 02:04:57,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:57,948 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 02:04:57,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902453744] [2019-12-28 02:04:57,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:57,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 02:04:57,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [44096362] [2019-12-28 02:04:57,949 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:57,968 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:58,019 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 128 states and 168 transitions. [2019-12-28 02:04:58,019 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:58,042 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 02:04:58,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 02:04:58,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:58,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 02:04:58,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-28 02:04:58,044 INFO L87 Difference]: Start difference. First operand 2107 states and 4809 transitions. Second operand 7 states. [2019-12-28 02:04:58,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:04:58,568 INFO L93 Difference]: Finished difference Result 2722 states and 6074 transitions. [2019-12-28 02:04:58,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 02:04:58,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-12-28 02:04:58,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:04:58,572 INFO L225 Difference]: With dead ends: 2722 [2019-12-28 02:04:58,572 INFO L226 Difference]: Without dead ends: 2722 [2019-12-28 02:04:58,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-28 02:04:58,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2722 states. [2019-12-28 02:04:58,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2722 to 2252. [2019-12-28 02:04:58,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2252 states. [2019-12-28 02:04:58,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 5074 transitions. [2019-12-28 02:04:58,595 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 5074 transitions. Word has length 86 [2019-12-28 02:04:58,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:04:58,595 INFO L462 AbstractCegarLoop]: Abstraction has 2252 states and 5074 transitions. [2019-12-28 02:04:58,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 02:04:58,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 5074 transitions. [2019-12-28 02:04:58,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 02:04:58,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:04:58,597 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 02:04:58,597 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:04:58,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:04:58,598 INFO L82 PathProgramCache]: Analyzing trace with hash -881687860, now seen corresponding path program 1 times [2019-12-28 02:04:58,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:04:58,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030098994] [2019-12-28 02:04:58,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:04:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:04:58,750 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 02:04:58,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030098994] [2019-12-28 02:04:58,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:04:58,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 02:04:58,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1774891204] [2019-12-28 02:04:58,752 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:04:58,774 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:04:59,054 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 182 transitions. [2019-12-28 02:04:59,054 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:04:59,174 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-28 02:04:59,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 02:04:59,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:04:59,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 02:04:59,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-28 02:04:59,175 INFO L87 Difference]: Start difference. First operand 2252 states and 5074 transitions. Second operand 11 states. [2019-12-28 02:05:00,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:05:00,753 INFO L93 Difference]: Finished difference Result 2968 states and 6627 transitions. [2019-12-28 02:05:00,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-28 02:05:00,754 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2019-12-28 02:05:00,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:05:00,758 INFO L225 Difference]: With dead ends: 2968 [2019-12-28 02:05:00,758 INFO L226 Difference]: Without dead ends: 2968 [2019-12-28 02:05:00,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2019-12-28 02:05:00,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2019-12-28 02:05:00,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 2249. [2019-12-28 02:05:00,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2249 states. [2019-12-28 02:05:00,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2249 states to 2249 states and 5068 transitions. [2019-12-28 02:05:00,813 INFO L78 Accepts]: Start accepts. Automaton has 2249 states and 5068 transitions. Word has length 86 [2019-12-28 02:05:00,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:05:00,814 INFO L462 AbstractCegarLoop]: Abstraction has 2249 states and 5068 transitions. [2019-12-28 02:05:00,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 02:05:00,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2249 states and 5068 transitions. [2019-12-28 02:05:00,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 02:05:00,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:05:00,819 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 02:05:00,819 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:05:00,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:05:00,820 INFO L82 PathProgramCache]: Analyzing trace with hash 5815821, now seen corresponding path program 2 times [2019-12-28 02:05:00,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:05:00,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151461721] [2019-12-28 02:05:00,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:05:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 02:05:01,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 02:05:01,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151461721] [2019-12-28 02:05:01,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 02:05:01,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 02:05:01,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1699455297] [2019-12-28 02:05:01,076 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 02:05:01,107 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 02:05:01,191 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 182 transitions. [2019-12-28 02:05:01,191 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 02:05:01,237 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 02:05:01,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 02:05:01,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 02:05:01,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 02:05:01,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-28 02:05:01,239 INFO L87 Difference]: Start difference. First operand 2249 states and 5068 transitions. Second operand 11 states. [2019-12-28 02:05:02,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 02:05:02,263 INFO L93 Difference]: Finished difference Result 4252 states and 9496 transitions. [2019-12-28 02:05:02,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-28 02:05:02,263 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2019-12-28 02:05:02,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 02:05:02,269 INFO L225 Difference]: With dead ends: 4252 [2019-12-28 02:05:02,269 INFO L226 Difference]: Without dead ends: 2971 [2019-12-28 02:05:02,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-28 02:05:02,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2019-12-28 02:05:02,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 2316. [2019-12-28 02:05:02,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2316 states. [2019-12-28 02:05:02,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 2316 states and 5142 transitions. [2019-12-28 02:05:02,323 INFO L78 Accepts]: Start accepts. Automaton has 2316 states and 5142 transitions. Word has length 86 [2019-12-28 02:05:02,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 02:05:02,323 INFO L462 AbstractCegarLoop]: Abstraction has 2316 states and 5142 transitions. [2019-12-28 02:05:02,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 02:05:02,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 5142 transitions. [2019-12-28 02:05:02,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 02:05:02,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 02:05:02,327 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 02:05:02,328 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 02:05:02,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 02:05:02,328 INFO L82 PathProgramCache]: Analyzing trace with hash 64546379, now seen corresponding path program 3 times [2019-12-28 02:05:02,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 02:05:02,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165192391] [2019-12-28 02:05:02,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 02:05:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 02:05:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 02:05:02,484 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 02:05:02,485 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 02:05:02,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 02:05:02 BasicIcfg [2019-12-28 02:05:02,805 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 02:05:02,815 INFO L168 Benchmark]: Toolchain (without parser) took 44325.75 ms. Allocated memory was 138.9 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 102.4 MB in the beginning and 1.0 GB in the end (delta: -926.1 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-28 02:05:02,816 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-28 02:05:02,816 INFO L168 Benchmark]: CACSL2BoogieTranslator took 734.10 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 102.2 MB in the beginning and 159.7 MB in the end (delta: -57.4 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-12-28 02:05:02,818 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.88 ms. Allocated memory is still 204.5 MB. Free memory was 159.7 MB in the beginning and 156.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-28 02:05:02,819 INFO L168 Benchmark]: Boogie Preprocessor took 36.19 ms. Allocated memory is still 204.5 MB. Free memory was 156.9 MB in the beginning and 154.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-28 02:05:02,820 INFO L168 Benchmark]: RCFGBuilder took 746.16 ms. Allocated memory is still 204.5 MB. Free memory was 154.9 MB in the beginning and 113.7 MB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 7.1 GB. [2019-12-28 02:05:02,820 INFO L168 Benchmark]: TraceAbstraction took 42746.03 ms. Allocated memory was 204.5 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 113.7 MB in the beginning and 1.0 GB in the end (delta: -914.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-28 02:05:02,830 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.17 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 734.10 ms. Allocated memory was 138.9 MB in the beginning and 204.5 MB in the end (delta: 65.5 MB). Free memory was 102.2 MB in the beginning and 159.7 MB in the end (delta: -57.4 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.88 ms. Allocated memory is still 204.5 MB. Free memory was 159.7 MB in the beginning and 156.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.19 ms. Allocated memory is still 204.5 MB. Free memory was 156.9 MB in the beginning and 154.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 746.16 ms. Allocated memory is still 204.5 MB. Free memory was 154.9 MB in the beginning and 113.7 MB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 42746.03 ms. Allocated memory was 204.5 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 113.7 MB in the beginning and 1.0 GB in the end (delta: -914.8 MB). Peak memory consumption was 1.1 GB. 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L707] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L708] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L709] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L710] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L711] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L712] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L713] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L714] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L715] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L716] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L717] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L718] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L719] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L799] 0 pthread_t t911; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L800] FCALL, FORK 0 pthread_create(&t911, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L801] 0 pthread_t t912; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t912, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L762] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L763] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L764] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L765] 2 x$r_buff0_thd2 = (_Bool)1 [L768] 2 y = 1 [L771] 2 __unbuffered_p1_EAX = y [L774] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L729] 1 z = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L780] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L781] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L742] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 1 x = x$flush_delayed ? x$mem_tmp : x [L745] 1 x$flush_delayed = (_Bool)0 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L804] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L810] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L812] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L815] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 42.2s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7121 SDtfs, 9169 SDslu, 17324 SDs, 0 SdLazy, 7471 SolverSat, 451 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 104 SyntacticMatches, 16 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57891occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.9s AutomataMinimizationTime, 25 MinimizatonAttempts, 70174 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1757 NumberOfCodeBlocks, 1757 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1646 ConstructedInterpolants, 0 QuantifiedInterpolants, 283100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...