/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix009_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 00:31:24,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 00:31:24,267 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 00:31:24,285 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 00:31:24,285 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 00:31:24,286 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 00:31:24,288 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 00:31:24,292 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 00:31:24,294 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 00:31:24,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 00:31:24,301 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 00:31:24,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 00:31:24,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 00:31:24,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 00:31:24,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 00:31:24,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 00:31:24,306 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 00:31:24,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 00:31:24,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 00:31:24,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 00:31:24,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 00:31:24,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 00:31:24,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 00:31:24,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 00:31:24,319 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 00:31:24,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 00:31:24,319 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 00:31:24,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 00:31:24,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 00:31:24,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 00:31:24,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 00:31:24,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 00:31:24,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 00:31:24,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 00:31:24,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 00:31:24,325 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 00:31:24,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 00:31:24,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 00:31:24,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 00:31:24,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 00:31:24,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 00:31:24,329 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-19 00:31:24,342 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 00:31:24,343 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 00:31:24,344 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 00:31:24,344 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 00:31:24,344 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 00:31:24,345 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 00:31:24,345 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 00:31:24,345 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 00:31:24,345 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 00:31:24,345 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 00:31:24,346 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 00:31:24,346 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 00:31:24,346 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 00:31:24,346 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 00:31:24,346 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 00:31:24,346 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 00:31:24,347 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 00:31:24,347 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 00:31:24,347 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 00:31:24,347 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 00:31:24,347 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 00:31:24,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 00:31:24,348 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 00:31:24,348 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 00:31:24,348 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 00:31:24,348 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 00:31:24,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 00:31:24,349 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 00:31:24,349 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 00:31:24,349 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 00:31:24,605 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 00:31:24,624 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 00:31:24,629 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 00:31:24,630 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 00:31:24,631 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 00:31:24,632 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009_power.oepc.i [2019-12-19 00:31:24,706 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/067e4ee22/dc99b3f88d4443308f59819e2d5023ce/FLAGcfc866564 [2019-12-19 00:31:25,228 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 00:31:25,229 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009_power.oepc.i [2019-12-19 00:31:25,252 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/067e4ee22/dc99b3f88d4443308f59819e2d5023ce/FLAGcfc866564 [2019-12-19 00:31:25,502 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/067e4ee22/dc99b3f88d4443308f59819e2d5023ce [2019-12-19 00:31:25,512 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 00:31:25,514 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 00:31:25,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 00:31:25,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 00:31:25,518 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 00:31:25,519 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 12:31:25" (1/1) ... [2019-12-19 00:31:25,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25b84ad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:31:25, skipping insertion in model container [2019-12-19 00:31:25,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 12:31:25" (1/1) ... [2019-12-19 00:31:25,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 00:31:25,580 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 00:31:26,102 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 00:31:26,119 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 00:31:26,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 00:31:26,271 INFO L208 MainTranslator]: Completed translation [2019-12-19 00:31:26,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:31:26 WrapperNode [2019-12-19 00:31:26,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 00:31:26,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 00:31:26,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 00:31:26,273 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 00:31:26,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:31:26" (1/1) ... [2019-12-19 00:31:26,303 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:31:26" (1/1) ... [2019-12-19 00:31:26,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 00:31:26,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 00:31:26,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 00:31:26,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 00:31:26,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:31:26" (1/1) ... [2019-12-19 00:31:26,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:31:26" (1/1) ... [2019-12-19 00:31:26,351 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:31:26" (1/1) ... [2019-12-19 00:31:26,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:31:26" (1/1) ... [2019-12-19 00:31:26,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:31:26" (1/1) ... [2019-12-19 00:31:26,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:31:26" (1/1) ... [2019-12-19 00:31:26,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:31:26" (1/1) ... [2019-12-19 00:31:26,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 00:31:26,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 00:31:26,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 00:31:26,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 00:31:26,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:31:26" (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-19 00:31:26,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 00:31:26,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 00:31:26,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 00:31:26,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 00:31:26,441 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 00:31:26,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 00:31:26,442 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 00:31:26,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 00:31:26,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 00:31:26,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 00:31:26,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 00:31:26,445 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 00:31:27,164 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 00:31:27,164 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 00:31:27,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:31:27 BoogieIcfgContainer [2019-12-19 00:31:27,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 00:31:27,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 00:31:27,167 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 00:31:27,171 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 00:31:27,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 12:31:25" (1/3) ... [2019-12-19 00:31:27,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eca1a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:31:27, skipping insertion in model container [2019-12-19 00:31:27,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:31:26" (2/3) ... [2019-12-19 00:31:27,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eca1a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:31:27, skipping insertion in model container [2019-12-19 00:31:27,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:31:27" (3/3) ... [2019-12-19 00:31:27,175 INFO L109 eAbstractionObserver]: Analyzing ICFG mix009_power.oepc.i [2019-12-19 00:31:27,187 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 00:31:27,187 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 00:31:27,196 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 00:31:27,197 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 00:31:27,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,239 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,240 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,240 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,242 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,242 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,259 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,260 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,319 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,322 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,323 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,326 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,329 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,333 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,334 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,335 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,335 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,335 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,336 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,339 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,340 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,344 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,346 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:31:27,364 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 00:31:27,388 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 00:31:27,388 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 00:31:27,388 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 00:31:27,388 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 00:31:27,389 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 00:31:27,389 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 00:31:27,389 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 00:31:27,389 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 00:31:27,407 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 150 places, 184 transitions [2019-12-19 00:31:29,404 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32594 states. [2019-12-19 00:31:29,406 INFO L276 IsEmpty]: Start isEmpty. Operand 32594 states. [2019-12-19 00:31:29,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-19 00:31:29,414 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:31:29,415 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] [2019-12-19 00:31:29,416 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:31:29,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:31:29,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1842126657, now seen corresponding path program 1 times [2019-12-19 00:31:29,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:31:29,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211299147] [2019-12-19 00:31:29,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:31:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:31:29,782 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-19 00:31:29,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211299147] [2019-12-19 00:31:29,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:31:29,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:31:29,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943426818] [2019-12-19 00:31:29,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:31:29,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:31:29,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:31:29,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:31:29,816 INFO L87 Difference]: Start difference. First operand 32594 states. Second operand 4 states. [2019-12-19 00:31:31,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:31:31,347 INFO L93 Difference]: Finished difference Result 33594 states and 129571 transitions. [2019-12-19 00:31:31,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 00:31:31,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-19 00:31:31,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:31:31,628 INFO L225 Difference]: With dead ends: 33594 [2019-12-19 00:31:31,628 INFO L226 Difference]: Without dead ends: 25706 [2019-12-19 00:31:31,630 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-19 00:31:32,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25706 states. [2019-12-19 00:31:32,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25706 to 25706. [2019-12-19 00:31:32,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25706 states. [2019-12-19 00:31:34,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25706 states to 25706 states and 99587 transitions. [2019-12-19 00:31:34,172 INFO L78 Accepts]: Start accepts. Automaton has 25706 states and 99587 transitions. Word has length 37 [2019-12-19 00:31:34,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:31:34,173 INFO L462 AbstractCegarLoop]: Abstraction has 25706 states and 99587 transitions. [2019-12-19 00:31:34,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:31:34,174 INFO L276 IsEmpty]: Start isEmpty. Operand 25706 states and 99587 transitions. [2019-12-19 00:31:34,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-19 00:31:34,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:31:34,190 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-19 00:31:34,191 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:31:34,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:31:34,191 INFO L82 PathProgramCache]: Analyzing trace with hash 994831418, now seen corresponding path program 1 times [2019-12-19 00:31:34,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:31:34,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782863837] [2019-12-19 00:31:34,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:31:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:31:34,357 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-19 00:31:34,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782863837] [2019-12-19 00:31:34,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:31:34,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:31:34,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039099644] [2019-12-19 00:31:34,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:31:34,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:31:34,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:31:34,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:31:34,363 INFO L87 Difference]: Start difference. First operand 25706 states and 99587 transitions. Second operand 5 states. [2019-12-19 00:31:35,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:31:35,305 INFO L93 Difference]: Finished difference Result 41084 states and 150434 transitions. [2019-12-19 00:31:35,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:31:35,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-19 00:31:35,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:31:35,462 INFO L225 Difference]: With dead ends: 41084 [2019-12-19 00:31:35,462 INFO L226 Difference]: Without dead ends: 40548 [2019-12-19 00:31:35,463 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-19 00:31:35,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40548 states. [2019-12-19 00:31:37,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40548 to 38928. [2019-12-19 00:31:37,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38928 states. [2019-12-19 00:31:38,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38928 states to 38928 states and 143584 transitions. [2019-12-19 00:31:38,076 INFO L78 Accepts]: Start accepts. Automaton has 38928 states and 143584 transitions. Word has length 49 [2019-12-19 00:31:38,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:31:38,085 INFO L462 AbstractCegarLoop]: Abstraction has 38928 states and 143584 transitions. [2019-12-19 00:31:38,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:31:38,086 INFO L276 IsEmpty]: Start isEmpty. Operand 38928 states and 143584 transitions. [2019-12-19 00:31:38,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-19 00:31:38,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:31:38,099 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:31:38,099 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:31:38,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:31:38,099 INFO L82 PathProgramCache]: Analyzing trace with hash -351997153, now seen corresponding path program 1 times [2019-12-19 00:31:38,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:31:38,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614679232] [2019-12-19 00:31:38,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:31:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:31:38,312 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-19 00:31:38,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614679232] [2019-12-19 00:31:38,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:31:38,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:31:38,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118176617] [2019-12-19 00:31:38,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:31:38,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:31:38,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:31:38,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:31:38,317 INFO L87 Difference]: Start difference. First operand 38928 states and 143584 transitions. Second operand 5 states. [2019-12-19 00:31:39,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:31:39,258 INFO L93 Difference]: Finished difference Result 49781 states and 180636 transitions. [2019-12-19 00:31:39,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:31:39,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-12-19 00:31:39,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:31:39,472 INFO L225 Difference]: With dead ends: 49781 [2019-12-19 00:31:39,472 INFO L226 Difference]: Without dead ends: 49277 [2019-12-19 00:31:39,473 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-19 00:31:39,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49277 states. [2019-12-19 00:31:42,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49277 to 42680. [2019-12-19 00:31:42,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42680 states. [2019-12-19 00:31:42,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42680 states to 42680 states and 156595 transitions. [2019-12-19 00:31:42,394 INFO L78 Accepts]: Start accepts. Automaton has 42680 states and 156595 transitions. Word has length 50 [2019-12-19 00:31:42,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:31:42,397 INFO L462 AbstractCegarLoop]: Abstraction has 42680 states and 156595 transitions. [2019-12-19 00:31:42,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:31:42,397 INFO L276 IsEmpty]: Start isEmpty. Operand 42680 states and 156595 transitions. [2019-12-19 00:31:42,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-19 00:31:42,408 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:31:42,409 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:31:42,409 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:31:42,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:31:42,409 INFO L82 PathProgramCache]: Analyzing trace with hash 2004382981, now seen corresponding path program 1 times [2019-12-19 00:31:42,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:31:42,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077737937] [2019-12-19 00:31:42,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:31:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:31:42,514 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-19 00:31:42,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077737937] [2019-12-19 00:31:42,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:31:42,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:31:42,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967625122] [2019-12-19 00:31:42,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:31:42,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:31:42,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:31:42,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:31:42,517 INFO L87 Difference]: Start difference. First operand 42680 states and 156595 transitions. Second operand 3 states. [2019-12-19 00:31:43,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:31:43,203 INFO L93 Difference]: Finished difference Result 61090 states and 221433 transitions. [2019-12-19 00:31:43,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:31:43,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-19 00:31:43,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:31:43,387 INFO L225 Difference]: With dead ends: 61090 [2019-12-19 00:31:43,388 INFO L226 Difference]: Without dead ends: 61090 [2019-12-19 00:31:43,388 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-19 00:31:43,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61090 states. [2019-12-19 00:31:46,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61090 to 48019. [2019-12-19 00:31:46,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48019 states. [2019-12-19 00:31:46,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48019 states to 48019 states and 174182 transitions. [2019-12-19 00:31:46,525 INFO L78 Accepts]: Start accepts. Automaton has 48019 states and 174182 transitions. Word has length 52 [2019-12-19 00:31:46,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:31:46,525 INFO L462 AbstractCegarLoop]: Abstraction has 48019 states and 174182 transitions. [2019-12-19 00:31:46,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:31:46,525 INFO L276 IsEmpty]: Start isEmpty. Operand 48019 states and 174182 transitions. [2019-12-19 00:31:46,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-19 00:31:46,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:31:46,544 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] [2019-12-19 00:31:46,544 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:31:46,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:31:46,545 INFO L82 PathProgramCache]: Analyzing trace with hash -189838484, now seen corresponding path program 1 times [2019-12-19 00:31:46,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:31:46,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454264471] [2019-12-19 00:31:46,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:31:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:31:46,687 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-19 00:31:46,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454264471] [2019-12-19 00:31:46,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:31:46,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:31:46,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837883976] [2019-12-19 00:31:46,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:31:46,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:31:46,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:31:46,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:31:46,689 INFO L87 Difference]: Start difference. First operand 48019 states and 174182 transitions. Second operand 6 states. [2019-12-19 00:31:48,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:31:48,005 INFO L93 Difference]: Finished difference Result 63759 states and 229382 transitions. [2019-12-19 00:31:48,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:31:48,006 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-19 00:31:48,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:31:48,154 INFO L225 Difference]: With dead ends: 63759 [2019-12-19 00:31:48,154 INFO L226 Difference]: Without dead ends: 63759 [2019-12-19 00:31:48,155 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-19 00:31:48,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63759 states. [2019-12-19 00:31:51,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63759 to 59952. [2019-12-19 00:31:51,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59952 states. [2019-12-19 00:31:51,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59952 states to 59952 states and 215675 transitions. [2019-12-19 00:31:51,295 INFO L78 Accepts]: Start accepts. Automaton has 59952 states and 215675 transitions. Word has length 56 [2019-12-19 00:31:51,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:31:51,296 INFO L462 AbstractCegarLoop]: Abstraction has 59952 states and 215675 transitions. [2019-12-19 00:31:51,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:31:51,296 INFO L276 IsEmpty]: Start isEmpty. Operand 59952 states and 215675 transitions. [2019-12-19 00:31:51,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-19 00:31:51,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:31:51,313 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] [2019-12-19 00:31:51,314 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:31:51,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:31:51,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1986789843, now seen corresponding path program 1 times [2019-12-19 00:31:51,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:31:51,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116724442] [2019-12-19 00:31:51,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:31:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:31:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:31:51,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116724442] [2019-12-19 00:31:51,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:31:51,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:31:51,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676635779] [2019-12-19 00:31:51,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:31:51,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:31:51,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:31:51,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:31:51,424 INFO L87 Difference]: Start difference. First operand 59952 states and 215675 transitions. Second operand 7 states. [2019-12-19 00:31:53,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:31:53,240 INFO L93 Difference]: Finished difference Result 83688 states and 290100 transitions. [2019-12-19 00:31:53,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 00:31:53,240 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-12-19 00:31:53,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:31:53,423 INFO L225 Difference]: With dead ends: 83688 [2019-12-19 00:31:53,423 INFO L226 Difference]: Without dead ends: 83688 [2019-12-19 00:31:53,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 00:31:53,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83688 states. [2019-12-19 00:31:56,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83688 to 71015. [2019-12-19 00:31:56,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71015 states. [2019-12-19 00:31:57,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71015 states to 71015 states and 249889 transitions. [2019-12-19 00:31:57,106 INFO L78 Accepts]: Start accepts. Automaton has 71015 states and 249889 transitions. Word has length 56 [2019-12-19 00:31:57,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:31:57,107 INFO L462 AbstractCegarLoop]: Abstraction has 71015 states and 249889 transitions. [2019-12-19 00:31:57,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:31:57,107 INFO L276 IsEmpty]: Start isEmpty. Operand 71015 states and 249889 transitions. [2019-12-19 00:31:57,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-19 00:31:57,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:31:57,121 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] [2019-12-19 00:31:57,121 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:31:57,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:31:57,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1099286162, now seen corresponding path program 1 times [2019-12-19 00:31:57,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:31:57,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983036801] [2019-12-19 00:31:57,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:31:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:31:57,186 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-19 00:31:57,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983036801] [2019-12-19 00:31:57,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:31:57,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:31:57,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15795144] [2019-12-19 00:31:57,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:31:57,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:31:57,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:31:57,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:31:57,193 INFO L87 Difference]: Start difference. First operand 71015 states and 249889 transitions. Second operand 3 states. [2019-12-19 00:31:57,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:31:57,424 INFO L93 Difference]: Finished difference Result 54024 states and 188921 transitions. [2019-12-19 00:31:57,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:31:57,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-19 00:31:57,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:31:57,544 INFO L225 Difference]: With dead ends: 54024 [2019-12-19 00:31:57,544 INFO L226 Difference]: Without dead ends: 54024 [2019-12-19 00:31:57,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:31:57,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54024 states. [2019-12-19 00:31:58,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54024 to 53409. [2019-12-19 00:31:58,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53409 states. [2019-12-19 00:31:59,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53409 states to 53409 states and 187040 transitions. [2019-12-19 00:31:59,003 INFO L78 Accepts]: Start accepts. Automaton has 53409 states and 187040 transitions. Word has length 56 [2019-12-19 00:31:59,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:31:59,004 INFO L462 AbstractCegarLoop]: Abstraction has 53409 states and 187040 transitions. [2019-12-19 00:31:59,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:31:59,004 INFO L276 IsEmpty]: Start isEmpty. Operand 53409 states and 187040 transitions. [2019-12-19 00:31:59,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-19 00:31:59,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:31:59,013 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] [2019-12-19 00:31:59,013 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:31:59,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:31:59,013 INFO L82 PathProgramCache]: Analyzing trace with hash -541236016, now seen corresponding path program 1 times [2019-12-19 00:31:59,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:31:59,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353119977] [2019-12-19 00:31:59,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:31:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:31:59,095 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-19 00:31:59,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353119977] [2019-12-19 00:31:59,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:31:59,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:31:59,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480703432] [2019-12-19 00:31:59,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:31:59,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:31:59,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:31:59,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:31:59,098 INFO L87 Difference]: Start difference. First operand 53409 states and 187040 transitions. Second operand 6 states. [2019-12-19 00:31:59,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:31:59,810 INFO L93 Difference]: Finished difference Result 68649 states and 237304 transitions. [2019-12-19 00:31:59,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 00:31:59,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-19 00:31:59,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:00,659 INFO L225 Difference]: With dead ends: 68649 [2019-12-19 00:32:00,659 INFO L226 Difference]: Without dead ends: 68081 [2019-12-19 00:32:00,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-19 00:32:00,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68081 states. [2019-12-19 00:32:01,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68081 to 53493. [2019-12-19 00:32:01,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53493 states. [2019-12-19 00:32:01,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53493 states to 53493 states and 187737 transitions. [2019-12-19 00:32:01,670 INFO L78 Accepts]: Start accepts. Automaton has 53493 states and 187737 transitions. Word has length 56 [2019-12-19 00:32:01,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:01,670 INFO L462 AbstractCegarLoop]: Abstraction has 53493 states and 187737 transitions. [2019-12-19 00:32:01,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:32:01,670 INFO L276 IsEmpty]: Start isEmpty. Operand 53493 states and 187737 transitions. [2019-12-19 00:32:01,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-19 00:32:01,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:01,681 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:01,681 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:01,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:01,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1873901397, now seen corresponding path program 1 times [2019-12-19 00:32:01,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:01,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726428563] [2019-12-19 00:32:01,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:01,799 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-19 00:32:01,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726428563] [2019-12-19 00:32:01,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:01,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:32:01,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614303181] [2019-12-19 00:32:01,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:32:01,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:01,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:32:01,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:32:01,805 INFO L87 Difference]: Start difference. First operand 53493 states and 187737 transitions. Second operand 5 states. [2019-12-19 00:32:02,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:02,725 INFO L93 Difference]: Finished difference Result 53613 states and 187581 transitions. [2019-12-19 00:32:02,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 00:32:02,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-19 00:32:02,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:02,838 INFO L225 Difference]: With dead ends: 53613 [2019-12-19 00:32:02,838 INFO L226 Difference]: Without dead ends: 53613 [2019-12-19 00:32:02,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:32:03,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53613 states. [2019-12-19 00:32:03,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53613 to 53526. [2019-12-19 00:32:03,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53526 states. [2019-12-19 00:32:03,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53526 states to 53526 states and 187311 transitions. [2019-12-19 00:32:03,762 INFO L78 Accepts]: Start accepts. Automaton has 53526 states and 187311 transitions. Word has length 57 [2019-12-19 00:32:03,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:03,762 INFO L462 AbstractCegarLoop]: Abstraction has 53526 states and 187311 transitions. [2019-12-19 00:32:03,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:32:03,762 INFO L276 IsEmpty]: Start isEmpty. Operand 53526 states and 187311 transitions. [2019-12-19 00:32:03,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-19 00:32:03,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:03,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:03,773 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:03,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:03,773 INFO L82 PathProgramCache]: Analyzing trace with hash -986397716, now seen corresponding path program 1 times [2019-12-19 00:32:03,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:03,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131900661] [2019-12-19 00:32:03,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:03,859 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-19 00:32:03,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131900661] [2019-12-19 00:32:03,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:03,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:32:03,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065985081] [2019-12-19 00:32:03,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:32:03,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:03,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:32:03,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:32:03,862 INFO L87 Difference]: Start difference. First operand 53526 states and 187311 transitions. Second operand 4 states. [2019-12-19 00:32:03,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:03,936 INFO L93 Difference]: Finished difference Result 10215 states and 31231 transitions. [2019-12-19 00:32:03,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 00:32:03,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-19 00:32:03,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:03,953 INFO L225 Difference]: With dead ends: 10215 [2019-12-19 00:32:03,953 INFO L226 Difference]: Without dead ends: 8510 [2019-12-19 00:32:03,954 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-19 00:32:03,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8510 states. [2019-12-19 00:32:04,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8510 to 8462. [2019-12-19 00:32:04,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8462 states. [2019-12-19 00:32:04,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8462 states to 8462 states and 25310 transitions. [2019-12-19 00:32:04,378 INFO L78 Accepts]: Start accepts. Automaton has 8462 states and 25310 transitions. Word has length 57 [2019-12-19 00:32:04,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:04,379 INFO L462 AbstractCegarLoop]: Abstraction has 8462 states and 25310 transitions. [2019-12-19 00:32:04,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:32:04,379 INFO L276 IsEmpty]: Start isEmpty. Operand 8462 states and 25310 transitions. [2019-12-19 00:32:04,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-19 00:32:04,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:04,383 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:04,384 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:04,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:04,384 INFO L82 PathProgramCache]: Analyzing trace with hash 227053228, now seen corresponding path program 1 times [2019-12-19 00:32:04,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:04,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254376268] [2019-12-19 00:32:04,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:04,443 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-19 00:32:04,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254376268] [2019-12-19 00:32:04,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:04,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:32:04,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835651365] [2019-12-19 00:32:04,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:32:04,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:04,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:32:04,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:32:04,446 INFO L87 Difference]: Start difference. First operand 8462 states and 25310 transitions. Second operand 4 states. [2019-12-19 00:32:04,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:04,570 INFO L93 Difference]: Finished difference Result 9709 states and 29089 transitions. [2019-12-19 00:32:04,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 00:32:04,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-19 00:32:04,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:04,588 INFO L225 Difference]: With dead ends: 9709 [2019-12-19 00:32:04,588 INFO L226 Difference]: Without dead ends: 9709 [2019-12-19 00:32:04,588 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-19 00:32:04,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9709 states. [2019-12-19 00:32:04,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9709 to 8882. [2019-12-19 00:32:04,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8882 states. [2019-12-19 00:32:04,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8882 states to 8882 states and 26573 transitions. [2019-12-19 00:32:04,703 INFO L78 Accepts]: Start accepts. Automaton has 8882 states and 26573 transitions. Word has length 64 [2019-12-19 00:32:04,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:04,703 INFO L462 AbstractCegarLoop]: Abstraction has 8882 states and 26573 transitions. [2019-12-19 00:32:04,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:32:04,703 INFO L276 IsEmpty]: Start isEmpty. Operand 8882 states and 26573 transitions. [2019-12-19 00:32:04,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-19 00:32:04,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:04,707 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:04,707 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:04,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:04,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1969863563, now seen corresponding path program 1 times [2019-12-19 00:32:04,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:04,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844623065] [2019-12-19 00:32:04,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:04,770 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-19 00:32:04,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844623065] [2019-12-19 00:32:04,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:04,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:32:04,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357199890] [2019-12-19 00:32:04,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:32:04,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:04,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:32:04,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:32:04,772 INFO L87 Difference]: Start difference. First operand 8882 states and 26573 transitions. Second operand 6 states. [2019-12-19 00:32:05,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:05,208 INFO L93 Difference]: Finished difference Result 11198 states and 33042 transitions. [2019-12-19 00:32:05,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 00:32:05,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-19 00:32:05,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:05,225 INFO L225 Difference]: With dead ends: 11198 [2019-12-19 00:32:05,225 INFO L226 Difference]: Without dead ends: 11137 [2019-12-19 00:32:05,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 00:32:05,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11137 states. [2019-12-19 00:32:05,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11137 to 10413. [2019-12-19 00:32:05,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10413 states. [2019-12-19 00:32:05,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10413 states to 10413 states and 30918 transitions. [2019-12-19 00:32:05,361 INFO L78 Accepts]: Start accepts. Automaton has 10413 states and 30918 transitions. Word has length 64 [2019-12-19 00:32:05,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:05,362 INFO L462 AbstractCegarLoop]: Abstraction has 10413 states and 30918 transitions. [2019-12-19 00:32:05,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:32:05,362 INFO L276 IsEmpty]: Start isEmpty. Operand 10413 states and 30918 transitions. [2019-12-19 00:32:05,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 00:32:05,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:05,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, 1, 1, 1, 1, 1] [2019-12-19 00:32:05,367 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:05,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:05,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1630047156, now seen corresponding path program 1 times [2019-12-19 00:32:05,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:05,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138764068] [2019-12-19 00:32:05,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:05,429 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-19 00:32:05,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138764068] [2019-12-19 00:32:05,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:05,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:32:05,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212069501] [2019-12-19 00:32:05,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:32:05,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:05,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:32:05,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:32:05,431 INFO L87 Difference]: Start difference. First operand 10413 states and 30918 transitions. Second operand 5 states. [2019-12-19 00:32:06,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:06,224 INFO L93 Difference]: Finished difference Result 23564 states and 70323 transitions. [2019-12-19 00:32:06,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 00:32:06,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-12-19 00:32:06,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:06,258 INFO L225 Difference]: With dead ends: 23564 [2019-12-19 00:32:06,258 INFO L226 Difference]: Without dead ends: 23564 [2019-12-19 00:32:06,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:32:06,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23564 states. [2019-12-19 00:32:06,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23564 to 12623. [2019-12-19 00:32:06,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12623 states. [2019-12-19 00:32:06,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12623 states to 12623 states and 37510 transitions. [2019-12-19 00:32:06,484 INFO L78 Accepts]: Start accepts. Automaton has 12623 states and 37510 transitions. Word has length 70 [2019-12-19 00:32:06,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:06,484 INFO L462 AbstractCegarLoop]: Abstraction has 12623 states and 37510 transitions. [2019-12-19 00:32:06,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:32:06,484 INFO L276 IsEmpty]: Start isEmpty. Operand 12623 states and 37510 transitions. [2019-12-19 00:32:06,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 00:32:06,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:06,490 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] [2019-12-19 00:32:06,490 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:06,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:06,491 INFO L82 PathProgramCache]: Analyzing trace with hash -166904203, now seen corresponding path program 1 times [2019-12-19 00:32:06,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:06,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168832762] [2019-12-19 00:32:06,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:06,566 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-19 00:32:06,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168832762] [2019-12-19 00:32:06,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:06,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:32:06,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53056499] [2019-12-19 00:32:06,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:32:06,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:06,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:32:06,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:32:06,568 INFO L87 Difference]: Start difference. First operand 12623 states and 37510 transitions. Second operand 4 states. [2019-12-19 00:32:06,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:06,938 INFO L93 Difference]: Finished difference Result 16661 states and 48900 transitions. [2019-12-19 00:32:06,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 00:32:06,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-12-19 00:32:06,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:06,971 INFO L225 Difference]: With dead ends: 16661 [2019-12-19 00:32:06,971 INFO L226 Difference]: Without dead ends: 16661 [2019-12-19 00:32:06,972 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-19 00:32:07,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16661 states. [2019-12-19 00:32:07,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16661 to 14390. [2019-12-19 00:32:07,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14390 states. [2019-12-19 00:32:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14390 states to 14390 states and 42416 transitions. [2019-12-19 00:32:07,252 INFO L78 Accepts]: Start accepts. Automaton has 14390 states and 42416 transitions. Word has length 70 [2019-12-19 00:32:07,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:07,253 INFO L462 AbstractCegarLoop]: Abstraction has 14390 states and 42416 transitions. [2019-12-19 00:32:07,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:32:07,253 INFO L276 IsEmpty]: Start isEmpty. Operand 14390 states and 42416 transitions. [2019-12-19 00:32:07,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 00:32:07,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:07,264 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] [2019-12-19 00:32:07,264 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:07,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:07,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1077860278, now seen corresponding path program 1 times [2019-12-19 00:32:07,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:07,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714822764] [2019-12-19 00:32:07,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:07,410 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-19 00:32:07,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714822764] [2019-12-19 00:32:07,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:07,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:32:07,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936900150] [2019-12-19 00:32:07,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:32:07,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:07,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:32:07,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:32:07,412 INFO L87 Difference]: Start difference. First operand 14390 states and 42416 transitions. Second operand 6 states. [2019-12-19 00:32:08,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:08,161 INFO L93 Difference]: Finished difference Result 15631 states and 45417 transitions. [2019-12-19 00:32:08,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:32:08,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-19 00:32:08,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:08,184 INFO L225 Difference]: With dead ends: 15631 [2019-12-19 00:32:08,185 INFO L226 Difference]: Without dead ends: 15631 [2019-12-19 00:32:08,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:32:08,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15631 states. [2019-12-19 00:32:08,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15631 to 15301. [2019-12-19 00:32:08,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15301 states. [2019-12-19 00:32:08,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15301 states to 15301 states and 44579 transitions. [2019-12-19 00:32:08,380 INFO L78 Accepts]: Start accepts. Automaton has 15301 states and 44579 transitions. Word has length 70 [2019-12-19 00:32:08,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:08,380 INFO L462 AbstractCegarLoop]: Abstraction has 15301 states and 44579 transitions. [2019-12-19 00:32:08,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:32:08,380 INFO L276 IsEmpty]: Start isEmpty. Operand 15301 states and 44579 transitions. [2019-12-19 00:32:08,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 00:32:08,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:08,391 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] [2019-12-19 00:32:08,391 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:08,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:08,391 INFO L82 PathProgramCache]: Analyzing trace with hash -999349065, now seen corresponding path program 1 times [2019-12-19 00:32:08,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:08,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84267710] [2019-12-19 00:32:08,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:08,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:32:08,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84267710] [2019-12-19 00:32:08,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:08,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:32:08,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56913863] [2019-12-19 00:32:08,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:32:08,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:08,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:32:08,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:32:08,488 INFO L87 Difference]: Start difference. First operand 15301 states and 44579 transitions. Second operand 6 states. [2019-12-19 00:32:08,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:08,962 INFO L93 Difference]: Finished difference Result 17459 states and 49461 transitions. [2019-12-19 00:32:08,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 00:32:08,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-19 00:32:08,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:08,985 INFO L225 Difference]: With dead ends: 17459 [2019-12-19 00:32:08,985 INFO L226 Difference]: Without dead ends: 17459 [2019-12-19 00:32:08,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 00:32:09,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17459 states. [2019-12-19 00:32:09,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17459 to 15842. [2019-12-19 00:32:09,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15842 states. [2019-12-19 00:32:09,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15842 states to 15842 states and 45416 transitions. [2019-12-19 00:32:09,192 INFO L78 Accepts]: Start accepts. Automaton has 15842 states and 45416 transitions. Word has length 70 [2019-12-19 00:32:09,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:09,193 INFO L462 AbstractCegarLoop]: Abstraction has 15842 states and 45416 transitions. [2019-12-19 00:32:09,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:32:09,193 INFO L276 IsEmpty]: Start isEmpty. Operand 15842 states and 45416 transitions. [2019-12-19 00:32:09,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 00:32:09,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:09,201 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:09,201 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:09,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:09,202 INFO L82 PathProgramCache]: Analyzing trace with hash -787998152, now seen corresponding path program 1 times [2019-12-19 00:32:09,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:09,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207993516] [2019-12-19 00:32:09,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:09,329 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-19 00:32:09,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207993516] [2019-12-19 00:32:09,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:09,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:32:09,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810628370] [2019-12-19 00:32:09,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:32:09,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:09,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:32:09,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:32:09,331 INFO L87 Difference]: Start difference. First operand 15842 states and 45416 transitions. Second operand 7 states. [2019-12-19 00:32:09,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:09,962 INFO L93 Difference]: Finished difference Result 18414 states and 51438 transitions. [2019-12-19 00:32:09,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 00:32:09,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-12-19 00:32:09,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:09,986 INFO L225 Difference]: With dead ends: 18414 [2019-12-19 00:32:09,986 INFO L226 Difference]: Without dead ends: 18414 [2019-12-19 00:32:09,987 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-19 00:32:10,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18414 states. [2019-12-19 00:32:10,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18414 to 16245. [2019-12-19 00:32:10,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16245 states. [2019-12-19 00:32:10,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16245 states to 16245 states and 45209 transitions. [2019-12-19 00:32:10,195 INFO L78 Accepts]: Start accepts. Automaton has 16245 states and 45209 transitions. Word has length 70 [2019-12-19 00:32:10,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:10,195 INFO L462 AbstractCegarLoop]: Abstraction has 16245 states and 45209 transitions. [2019-12-19 00:32:10,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:32:10,195 INFO L276 IsEmpty]: Start isEmpty. Operand 16245 states and 45209 transitions. [2019-12-19 00:32:10,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 00:32:10,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:10,202 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] [2019-12-19 00:32:10,202 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:10,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:10,202 INFO L82 PathProgramCache]: Analyzing trace with hash 99505529, now seen corresponding path program 1 times [2019-12-19 00:32:10,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:10,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958327022] [2019-12-19 00:32:10,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:10,282 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-19 00:32:10,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958327022] [2019-12-19 00:32:10,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:10,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:32:10,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045200566] [2019-12-19 00:32:10,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:32:10,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:10,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:32:10,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:32:10,284 INFO L87 Difference]: Start difference. First operand 16245 states and 45209 transitions. Second operand 5 states. [2019-12-19 00:32:10,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:10,337 INFO L93 Difference]: Finished difference Result 5337 states and 12605 transitions. [2019-12-19 00:32:10,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 00:32:10,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-12-19 00:32:10,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:10,345 INFO L225 Difference]: With dead ends: 5337 [2019-12-19 00:32:10,345 INFO L226 Difference]: Without dead ends: 4650 [2019-12-19 00:32:10,345 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-19 00:32:10,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4650 states. [2019-12-19 00:32:10,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4650 to 4325. [2019-12-19 00:32:10,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4325 states. [2019-12-19 00:32:10,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4325 states to 4325 states and 9952 transitions. [2019-12-19 00:32:10,410 INFO L78 Accepts]: Start accepts. Automaton has 4325 states and 9952 transitions. Word has length 70 [2019-12-19 00:32:10,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:10,411 INFO L462 AbstractCegarLoop]: Abstraction has 4325 states and 9952 transitions. [2019-12-19 00:32:10,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:32:10,411 INFO L276 IsEmpty]: Start isEmpty. Operand 4325 states and 9952 transitions. [2019-12-19 00:32:10,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-19 00:32:10,415 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:10,415 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] [2019-12-19 00:32:10,415 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:10,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:10,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1027808388, now seen corresponding path program 1 times [2019-12-19 00:32:10,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:10,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373633930] [2019-12-19 00:32:10,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:10,441 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-19 00:32:10,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373633930] [2019-12-19 00:32:10,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:10,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:32:10,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743964360] [2019-12-19 00:32:10,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:32:10,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:10,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:32:10,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:32:10,443 INFO L87 Difference]: Start difference. First operand 4325 states and 9952 transitions. Second operand 3 states. [2019-12-19 00:32:10,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:10,481 INFO L93 Difference]: Finished difference Result 5345 states and 12117 transitions. [2019-12-19 00:32:10,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:32:10,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-19 00:32:10,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:10,488 INFO L225 Difference]: With dead ends: 5345 [2019-12-19 00:32:10,489 INFO L226 Difference]: Without dead ends: 5345 [2019-12-19 00:32:10,489 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-19 00:32:10,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5345 states. [2019-12-19 00:32:10,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5345 to 4260. [2019-12-19 00:32:10,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4260 states. [2019-12-19 00:32:10,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4260 states to 4260 states and 9560 transitions. [2019-12-19 00:32:10,593 INFO L78 Accepts]: Start accepts. Automaton has 4260 states and 9560 transitions. Word has length 70 [2019-12-19 00:32:10,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:10,593 INFO L462 AbstractCegarLoop]: Abstraction has 4260 states and 9560 transitions. [2019-12-19 00:32:10,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:32:10,593 INFO L276 IsEmpty]: Start isEmpty. Operand 4260 states and 9560 transitions. [2019-12-19 00:32:10,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-19 00:32:10,600 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:10,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, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:10,601 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:10,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:10,602 INFO L82 PathProgramCache]: Analyzing trace with hash -812209841, now seen corresponding path program 1 times [2019-12-19 00:32:10,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:10,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778950096] [2019-12-19 00:32:10,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:10,665 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-19 00:32:10,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778950096] [2019-12-19 00:32:10,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:10,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:32:10,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099724490] [2019-12-19 00:32:10,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:32:10,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:10,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:32:10,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:32:10,667 INFO L87 Difference]: Start difference. First operand 4260 states and 9560 transitions. Second operand 5 states. [2019-12-19 00:32:10,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:10,922 INFO L93 Difference]: Finished difference Result 5299 states and 11944 transitions. [2019-12-19 00:32:10,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 00:32:10,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-12-19 00:32:10,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:10,933 INFO L225 Difference]: With dead ends: 5299 [2019-12-19 00:32:10,933 INFO L226 Difference]: Without dead ends: 5299 [2019-12-19 00:32:10,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-19 00:32:10,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5299 states. [2019-12-19 00:32:11,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5299 to 4888. [2019-12-19 00:32:11,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4888 states. [2019-12-19 00:32:11,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 10968 transitions. [2019-12-19 00:32:11,027 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 10968 transitions. Word has length 76 [2019-12-19 00:32:11,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:11,028 INFO L462 AbstractCegarLoop]: Abstraction has 4888 states and 10968 transitions. [2019-12-19 00:32:11,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:32:11,028 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 10968 transitions. [2019-12-19 00:32:11,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-19 00:32:11,034 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:11,035 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:11,035 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:11,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:11,035 INFO L82 PathProgramCache]: Analyzing trace with hash 930600494, now seen corresponding path program 1 times [2019-12-19 00:32:11,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:11,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631088985] [2019-12-19 00:32:11,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:11,105 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-19 00:32:11,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631088985] [2019-12-19 00:32:11,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:11,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:32:11,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896177312] [2019-12-19 00:32:11,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:32:11,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:11,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:32:11,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:32:11,107 INFO L87 Difference]: Start difference. First operand 4888 states and 10968 transitions. Second operand 7 states. [2019-12-19 00:32:11,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:11,536 INFO L93 Difference]: Finished difference Result 5520 states and 12289 transitions. [2019-12-19 00:32:11,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 00:32:11,537 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2019-12-19 00:32:11,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:11,543 INFO L225 Difference]: With dead ends: 5520 [2019-12-19 00:32:11,544 INFO L226 Difference]: Without dead ends: 5467 [2019-12-19 00:32:11,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-19 00:32:11,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5467 states. [2019-12-19 00:32:11,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5467 to 4912. [2019-12-19 00:32:11,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4912 states. [2019-12-19 00:32:11,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4912 states to 4912 states and 10945 transitions. [2019-12-19 00:32:11,598 INFO L78 Accepts]: Start accepts. Automaton has 4912 states and 10945 transitions. Word has length 76 [2019-12-19 00:32:11,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:11,598 INFO L462 AbstractCegarLoop]: Abstraction has 4912 states and 10945 transitions. [2019-12-19 00:32:11,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:32:11,598 INFO L276 IsEmpty]: Start isEmpty. Operand 4912 states and 10945 transitions. [2019-12-19 00:32:11,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 00:32:11,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:11,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:11,604 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:11,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:11,605 INFO L82 PathProgramCache]: Analyzing trace with hash 513999619, now seen corresponding path program 1 times [2019-12-19 00:32:11,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:11,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646872964] [2019-12-19 00:32:11,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:11,665 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-19 00:32:11,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646872964] [2019-12-19 00:32:11,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:11,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:32:11,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935847724] [2019-12-19 00:32:11,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:32:11,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:11,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:32:11,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:32:11,667 INFO L87 Difference]: Start difference. First operand 4912 states and 10945 transitions. Second operand 4 states. [2019-12-19 00:32:11,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:11,772 INFO L93 Difference]: Finished difference Result 5854 states and 12960 transitions. [2019-12-19 00:32:11,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 00:32:11,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-19 00:32:11,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:11,778 INFO L225 Difference]: With dead ends: 5854 [2019-12-19 00:32:11,778 INFO L226 Difference]: Without dead ends: 5854 [2019-12-19 00:32:11,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:32:11,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5854 states. [2019-12-19 00:32:11,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5854 to 5244. [2019-12-19 00:32:11,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5244 states. [2019-12-19 00:32:11,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5244 states to 5244 states and 11647 transitions. [2019-12-19 00:32:11,831 INFO L78 Accepts]: Start accepts. Automaton has 5244 states and 11647 transitions. Word has length 97 [2019-12-19 00:32:11,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:11,831 INFO L462 AbstractCegarLoop]: Abstraction has 5244 states and 11647 transitions. [2019-12-19 00:32:11,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:32:11,831 INFO L276 IsEmpty]: Start isEmpty. Operand 5244 states and 11647 transitions. [2019-12-19 00:32:11,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:32:11,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:11,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:11,836 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:11,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:11,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1028011755, now seen corresponding path program 1 times [2019-12-19 00:32:11,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:11,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136326151] [2019-12-19 00:32:11,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:11,932 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-19 00:32:11,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136326151] [2019-12-19 00:32:11,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:11,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:32:11,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819355024] [2019-12-19 00:32:11,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:32:11,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:11,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:32:11,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:32:11,934 INFO L87 Difference]: Start difference. First operand 5244 states and 11647 transitions. Second operand 6 states. [2019-12-19 00:32:12,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:12,620 INFO L93 Difference]: Finished difference Result 7912 states and 17668 transitions. [2019-12-19 00:32:12,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 00:32:12,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-12-19 00:32:12,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:12,630 INFO L225 Difference]: With dead ends: 7912 [2019-12-19 00:32:12,631 INFO L226 Difference]: Without dead ends: 7912 [2019-12-19 00:32:12,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-19 00:32:12,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7912 states. [2019-12-19 00:32:12,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7912 to 6039. [2019-12-19 00:32:12,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6039 states. [2019-12-19 00:32:12,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6039 states to 6039 states and 13543 transitions. [2019-12-19 00:32:12,702 INFO L78 Accepts]: Start accepts. Automaton has 6039 states and 13543 transitions. Word has length 99 [2019-12-19 00:32:12,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:12,702 INFO L462 AbstractCegarLoop]: Abstraction has 6039 states and 13543 transitions. [2019-12-19 00:32:12,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:32:12,702 INFO L276 IsEmpty]: Start isEmpty. Operand 6039 states and 13543 transitions. [2019-12-19 00:32:12,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:32:12,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:12,711 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:12,711 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:12,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:12,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1016695628, now seen corresponding path program 1 times [2019-12-19 00:32:12,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:12,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931815786] [2019-12-19 00:32:12,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:12,811 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-19 00:32:12,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931815786] [2019-12-19 00:32:12,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:12,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:32:12,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640586102] [2019-12-19 00:32:12,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:32:12,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:12,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:32:12,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:32:12,813 INFO L87 Difference]: Start difference. First operand 6039 states and 13543 transitions. Second operand 7 states. [2019-12-19 00:32:14,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:14,051 INFO L93 Difference]: Finished difference Result 8510 states and 18883 transitions. [2019-12-19 00:32:14,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-19 00:32:14,052 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2019-12-19 00:32:14,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:14,061 INFO L225 Difference]: With dead ends: 8510 [2019-12-19 00:32:14,061 INFO L226 Difference]: Without dead ends: 8430 [2019-12-19 00:32:14,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-12-19 00:32:14,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8430 states. [2019-12-19 00:32:14,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8430 to 7002. [2019-12-19 00:32:14,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7002 states. [2019-12-19 00:32:14,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7002 states to 7002 states and 15651 transitions. [2019-12-19 00:32:14,138 INFO L78 Accepts]: Start accepts. Automaton has 7002 states and 15651 transitions. Word has length 99 [2019-12-19 00:32:14,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:14,138 INFO L462 AbstractCegarLoop]: Abstraction has 7002 states and 15651 transitions. [2019-12-19 00:32:14,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:32:14,138 INFO L276 IsEmpty]: Start isEmpty. Operand 7002 states and 15651 transitions. [2019-12-19 00:32:14,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:32:14,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:14,147 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:14,147 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:14,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:14,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1201062325, now seen corresponding path program 1 times [2019-12-19 00:32:14,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:14,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474347481] [2019-12-19 00:32:14,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:14,267 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-19 00:32:14,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474347481] [2019-12-19 00:32:14,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:14,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:32:14,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250518881] [2019-12-19 00:32:14,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:32:14,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:14,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:32:14,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:32:14,269 INFO L87 Difference]: Start difference. First operand 7002 states and 15651 transitions. Second operand 6 states. [2019-12-19 00:32:14,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:14,501 INFO L93 Difference]: Finished difference Result 6225 states and 13653 transitions. [2019-12-19 00:32:14,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 00:32:14,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-12-19 00:32:14,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:14,508 INFO L225 Difference]: With dead ends: 6225 [2019-12-19 00:32:14,509 INFO L226 Difference]: Without dead ends: 6189 [2019-12-19 00:32:14,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:32:14,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6189 states. [2019-12-19 00:32:14,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6189 to 5424. [2019-12-19 00:32:14,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5424 states. [2019-12-19 00:32:14,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5424 states to 5424 states and 11934 transitions. [2019-12-19 00:32:14,564 INFO L78 Accepts]: Start accepts. Automaton has 5424 states and 11934 transitions. Word has length 99 [2019-12-19 00:32:14,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:14,564 INFO L462 AbstractCegarLoop]: Abstraction has 5424 states and 11934 transitions. [2019-12-19 00:32:14,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:32:14,565 INFO L276 IsEmpty]: Start isEmpty. Operand 5424 states and 11934 transitions. [2019-12-19 00:32:14,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:32:14,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:14,572 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:14,572 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:14,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:14,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1192417937, now seen corresponding path program 1 times [2019-12-19 00:32:14,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:14,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535008459] [2019-12-19 00:32:14,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:14,638 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-19 00:32:14,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535008459] [2019-12-19 00:32:14,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:14,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:32:14,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330673768] [2019-12-19 00:32:14,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:32:14,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:14,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:32:14,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:32:14,640 INFO L87 Difference]: Start difference. First operand 5424 states and 11934 transitions. Second operand 5 states. [2019-12-19 00:32:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:14,753 INFO L93 Difference]: Finished difference Result 5914 states and 12996 transitions. [2019-12-19 00:32:14,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 00:32:14,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-12-19 00:32:14,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:14,760 INFO L225 Difference]: With dead ends: 5914 [2019-12-19 00:32:14,760 INFO L226 Difference]: Without dead ends: 5914 [2019-12-19 00:32:14,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:32:14,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5914 states. [2019-12-19 00:32:14,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5914 to 4663. [2019-12-19 00:32:14,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4663 states. [2019-12-19 00:32:14,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4663 states to 4663 states and 10258 transitions. [2019-12-19 00:32:14,808 INFO L78 Accepts]: Start accepts. Automaton has 4663 states and 10258 transitions. Word has length 99 [2019-12-19 00:32:14,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:14,808 INFO L462 AbstractCegarLoop]: Abstraction has 4663 states and 10258 transitions. [2019-12-19 00:32:14,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:32:14,808 INFO L276 IsEmpty]: Start isEmpty. Operand 4663 states and 10258 transitions. [2019-12-19 00:32:14,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:32:14,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:14,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:14,813 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:14,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:14,813 INFO L82 PathProgramCache]: Analyzing trace with hash -2077057360, now seen corresponding path program 1 times [2019-12-19 00:32:14,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:14,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847140069] [2019-12-19 00:32:14,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:14,900 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-19 00:32:14,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847140069] [2019-12-19 00:32:14,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:14,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:32:14,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894269302] [2019-12-19 00:32:14,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:32:14,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:14,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:32:14,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:32:14,902 INFO L87 Difference]: Start difference. First operand 4663 states and 10258 transitions. Second operand 5 states. [2019-12-19 00:32:15,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:15,443 INFO L93 Difference]: Finished difference Result 5588 states and 12229 transitions. [2019-12-19 00:32:15,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 00:32:15,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-12-19 00:32:15,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:15,453 INFO L225 Difference]: With dead ends: 5588 [2019-12-19 00:32:15,454 INFO L226 Difference]: Without dead ends: 5528 [2019-12-19 00:32:15,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:32:15,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5528 states. [2019-12-19 00:32:15,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5528 to 5222. [2019-12-19 00:32:15,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5222 states. [2019-12-19 00:32:15,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5222 states to 5222 states and 11466 transitions. [2019-12-19 00:32:15,578 INFO L78 Accepts]: Start accepts. Automaton has 5222 states and 11466 transitions. Word has length 99 [2019-12-19 00:32:15,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:15,579 INFO L462 AbstractCegarLoop]: Abstraction has 5222 states and 11466 transitions. [2019-12-19 00:32:15,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:32:15,579 INFO L276 IsEmpty]: Start isEmpty. Operand 5222 states and 11466 transitions. [2019-12-19 00:32:15,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:32:15,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:15,586 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:15,586 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:15,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:15,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1963173391, now seen corresponding path program 1 times [2019-12-19 00:32:15,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:15,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329675869] [2019-12-19 00:32:15,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:15,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:32:15,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329675869] [2019-12-19 00:32:15,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:15,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:32:15,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682493096] [2019-12-19 00:32:15,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:32:15,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:15,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:32:15,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:32:15,660 INFO L87 Difference]: Start difference. First operand 5222 states and 11466 transitions. Second operand 5 states. [2019-12-19 00:32:15,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:15,899 INFO L93 Difference]: Finished difference Result 6154 states and 13387 transitions. [2019-12-19 00:32:15,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:32:15,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-12-19 00:32:15,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:15,907 INFO L225 Difference]: With dead ends: 6154 [2019-12-19 00:32:15,907 INFO L226 Difference]: Without dead ends: 6096 [2019-12-19 00:32:15,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:32:15,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6096 states. [2019-12-19 00:32:15,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6096 to 4963. [2019-12-19 00:32:15,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4963 states. [2019-12-19 00:32:15,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4963 states to 4963 states and 10944 transitions. [2019-12-19 00:32:15,965 INFO L78 Accepts]: Start accepts. Automaton has 4963 states and 10944 transitions. Word has length 99 [2019-12-19 00:32:15,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:15,965 INFO L462 AbstractCegarLoop]: Abstraction has 4963 states and 10944 transitions. [2019-12-19 00:32:15,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:32:15,965 INFO L276 IsEmpty]: Start isEmpty. Operand 4963 states and 10944 transitions. [2019-12-19 00:32:15,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:32:15,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:15,970 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:15,970 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:15,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:15,970 INFO L82 PathProgramCache]: Analyzing trace with hash 579065745, now seen corresponding path program 2 times [2019-12-19 00:32:15,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:15,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659333098] [2019-12-19 00:32:15,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:16,057 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-19 00:32:16,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659333098] [2019-12-19 00:32:16,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:16,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:32:16,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039502626] [2019-12-19 00:32:16,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:32:16,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:16,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:32:16,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:32:16,059 INFO L87 Difference]: Start difference. First operand 4963 states and 10944 transitions. Second operand 6 states. [2019-12-19 00:32:16,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:16,268 INFO L93 Difference]: Finished difference Result 5219 states and 11466 transitions. [2019-12-19 00:32:16,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:32:16,269 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-12-19 00:32:16,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:16,276 INFO L225 Difference]: With dead ends: 5219 [2019-12-19 00:32:16,277 INFO L226 Difference]: Without dead ends: 5219 [2019-12-19 00:32:16,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:32:16,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5219 states. [2019-12-19 00:32:16,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5219 to 4905. [2019-12-19 00:32:16,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4905 states. [2019-12-19 00:32:16,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4905 states to 4905 states and 10818 transitions. [2019-12-19 00:32:16,365 INFO L78 Accepts]: Start accepts. Automaton has 4905 states and 10818 transitions. Word has length 99 [2019-12-19 00:32:16,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:16,365 INFO L462 AbstractCegarLoop]: Abstraction has 4905 states and 10818 transitions. [2019-12-19 00:32:16,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:32:16,365 INFO L276 IsEmpty]: Start isEmpty. Operand 4905 states and 10818 transitions. [2019-12-19 00:32:16,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:32:16,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:16,374 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:16,374 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:16,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:16,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1461100972, now seen corresponding path program 1 times [2019-12-19 00:32:16,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:16,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146682076] [2019-12-19 00:32:16,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:16,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:32:16,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146682076] [2019-12-19 00:32:16,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:16,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 00:32:16,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016211915] [2019-12-19 00:32:16,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 00:32:16,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:16,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 00:32:16,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:32:16,559 INFO L87 Difference]: Start difference. First operand 4905 states and 10818 transitions. Second operand 8 states. [2019-12-19 00:32:16,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:16,938 INFO L93 Difference]: Finished difference Result 5693 states and 12426 transitions. [2019-12-19 00:32:16,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-19 00:32:16,939 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2019-12-19 00:32:16,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:16,945 INFO L225 Difference]: With dead ends: 5693 [2019-12-19 00:32:16,945 INFO L226 Difference]: Without dead ends: 5693 [2019-12-19 00:32:16,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-12-19 00:32:16,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5693 states. [2019-12-19 00:32:16,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5693 to 5213. [2019-12-19 00:32:16,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5213 states. [2019-12-19 00:32:16,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5213 states to 5213 states and 11437 transitions. [2019-12-19 00:32:16,998 INFO L78 Accepts]: Start accepts. Automaton has 5213 states and 11437 transitions. Word has length 99 [2019-12-19 00:32:16,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:16,999 INFO L462 AbstractCegarLoop]: Abstraction has 5213 states and 11437 transitions. [2019-12-19 00:32:16,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 00:32:16,999 INFO L276 IsEmpty]: Start isEmpty. Operand 5213 states and 11437 transitions. [2019-12-19 00:32:17,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:32:17,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:17,004 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:17,004 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:17,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:17,004 INFO L82 PathProgramCache]: Analyzing trace with hash -573597291, now seen corresponding path program 1 times [2019-12-19 00:32:17,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:17,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636306429] [2019-12-19 00:32:17,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:32:17,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:32:17,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636306429] [2019-12-19 00:32:17,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:32:17,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 00:32:17,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082636712] [2019-12-19 00:32:17,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 00:32:17,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:32:17,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 00:32:17,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:32:17,144 INFO L87 Difference]: Start difference. First operand 5213 states and 11437 transitions. Second operand 8 states. [2019-12-19 00:32:17,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:32:17,246 INFO L93 Difference]: Finished difference Result 8304 states and 18320 transitions. [2019-12-19 00:32:17,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:32:17,247 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2019-12-19 00:32:17,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:32:17,251 INFO L225 Difference]: With dead ends: 8304 [2019-12-19 00:32:17,252 INFO L226 Difference]: Without dead ends: 3273 [2019-12-19 00:32:17,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-19 00:32:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3273 states. [2019-12-19 00:32:17,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3273 to 3273. [2019-12-19 00:32:17,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3273 states. [2019-12-19 00:32:17,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3273 states to 3273 states and 7226 transitions. [2019-12-19 00:32:17,293 INFO L78 Accepts]: Start accepts. Automaton has 3273 states and 7226 transitions. Word has length 99 [2019-12-19 00:32:17,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:32:17,293 INFO L462 AbstractCegarLoop]: Abstraction has 3273 states and 7226 transitions. [2019-12-19 00:32:17,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 00:32:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 3273 states and 7226 transitions. [2019-12-19 00:32:17,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-19 00:32:17,298 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:32:17,298 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:32:17,298 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:32:17,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:32:17,299 INFO L82 PathProgramCache]: Analyzing trace with hash 790630937, now seen corresponding path program 2 times [2019-12-19 00:32:17,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:32:17,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437649919] [2019-12-19 00:32:17,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:32:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 00:32:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 00:32:17,385 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 00:32:17,385 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 00:32:17,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 12:32:17 BasicIcfg [2019-12-19 00:32:17,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 00:32:17,599 INFO L168 Benchmark]: Toolchain (without parser) took 52085.43 ms. Allocated memory was 145.8 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 102.1 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-19 00:32:17,603 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 145.8 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-19 00:32:17,603 INFO L168 Benchmark]: CACSL2BoogieTranslator took 757.46 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.9 MB in the beginning and 155.5 MB in the end (delta: -53.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-19 00:32:17,604 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.42 ms. Allocated memory is still 203.4 MB. Free memory was 155.5 MB in the beginning and 153.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-19 00:32:17,604 INFO L168 Benchmark]: Boogie Preprocessor took 44.66 ms. Allocated memory is still 203.4 MB. Free memory was 153.5 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-19 00:32:17,605 INFO L168 Benchmark]: RCFGBuilder took 784.82 ms. Allocated memory is still 203.4 MB. Free memory was 150.8 MB in the beginning and 105.7 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. [2019-12-19 00:32:17,605 INFO L168 Benchmark]: TraceAbstraction took 50429.78 ms. Allocated memory was 203.4 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 105.7 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-19 00:32:17,607 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.48 ms. Allocated memory is still 145.8 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 757.46 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.9 MB in the beginning and 155.5 MB in the end (delta: -53.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.42 ms. Allocated memory is still 203.4 MB. Free memory was 155.5 MB in the beginning and 153.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.66 ms. Allocated memory is still 203.4 MB. Free memory was 153.5 MB in the beginning and 150.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 784.82 ms. Allocated memory is still 203.4 MB. Free memory was 150.8 MB in the beginning and 105.7 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 50429.78 ms. Allocated memory was 203.4 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 105.7 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L700] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L702] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L703] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L704] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L706] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L708] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L710] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L711] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L712] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L713] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L714] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L715] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L716] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L717] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L718] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L719] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L720] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L721] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L722] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L723] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L724] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L725] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L726] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 0 pthread_t t241; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK 0 pthread_create(&t241, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 1 z$w_buff1 = z$w_buff0 [L731] 1 z$w_buff0 = 1 [L732] 1 z$w_buff1_used = z$w_buff0_used [L733] 1 z$w_buff0_used = (_Bool)1 [L810] 0 pthread_t t242; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] FCALL, FORK 0 pthread_create(&t242, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L735] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L736] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L737] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 [L744] 1 __unbuffered_p0_EAX = x [L747] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 [L767] 2 __unbuffered_p1_EAX = y [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 z$flush_delayed = weak$$choice2 [L773] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L775] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L776] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L777] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L780] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L751] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L753] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 z = z$flush_delayed ? z$mem_tmp : z [L783] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L786] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L790] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L790] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L818] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 144 locations, 2 error locations. Result: UNSAFE, OverallTime: 50.0s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 19.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8604 SDtfs, 10740 SDslu, 17556 SDs, 0 SdLazy, 7169 SolverSat, 573 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 299 GetRequests, 81 SyntacticMatches, 21 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71015occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 24.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 82521 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2383 NumberOfCodeBlocks, 2383 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2253 ConstructedInterpolants, 0 QuantifiedInterpolants, 491203 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...