/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/mix022_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 01:23:25,258 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 01:23:25,260 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 01:23:25,272 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 01:23:25,272 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 01:23:25,273 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 01:23:25,275 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 01:23:25,277 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 01:23:25,278 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 01:23:25,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 01:23:25,280 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 01:23:25,281 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 01:23:25,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 01:23:25,283 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 01:23:25,284 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 01:23:25,285 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 01:23:25,285 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 01:23:25,286 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 01:23:25,288 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 01:23:25,290 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 01:23:25,292 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 01:23:25,293 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 01:23:25,294 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 01:23:25,295 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 01:23:25,302 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 01:23:25,303 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 01:23:25,303 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 01:23:25,306 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 01:23:25,308 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 01:23:25,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 01:23:25,310 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 01:23:25,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 01:23:25,311 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 01:23:25,314 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 01:23:25,315 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 01:23:25,315 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 01:23:25,316 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 01:23:25,316 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 01:23:25,316 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 01:23:25,320 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 01:23:25,321 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 01:23:25,322 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 01:23:25,350 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 01:23:25,350 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 01:23:25,352 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 01:23:25,352 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 01:23:25,352 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 01:23:25,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 01:23:25,355 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 01:23:25,355 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 01:23:25,355 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 01:23:25,355 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 01:23:25,356 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 01:23:25,356 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 01:23:25,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 01:23:25,356 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 01:23:25,356 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 01:23:25,357 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 01:23:25,357 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 01:23:25,357 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 01:23:25,357 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 01:23:25,357 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 01:23:25,359 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 01:23:25,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 01:23:25,359 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 01:23:25,360 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 01:23:25,360 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 01:23:25,360 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 01:23:25,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 01:23:25,361 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 01:23:25,361 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 01:23:25,361 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 01:23:25,642 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 01:23:25,664 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 01:23:25,668 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 01:23:25,669 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 01:23:25,670 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 01:23:25,671 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_pso.oepc.i [2019-12-19 01:23:25,738 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c50a2c039/b945c77ec2ad4a8289e7b923a7886110/FLAG28e69f1ed [2019-12-19 01:23:26,274 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 01:23:26,275 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_pso.oepc.i [2019-12-19 01:23:26,291 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c50a2c039/b945c77ec2ad4a8289e7b923a7886110/FLAG28e69f1ed [2019-12-19 01:23:26,585 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c50a2c039/b945c77ec2ad4a8289e7b923a7886110 [2019-12-19 01:23:26,594 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 01:23:26,596 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 01:23:26,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 01:23:26,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 01:23:26,600 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 01:23:26,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:23:26" (1/1) ... [2019-12-19 01:23:26,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745d7f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:23:26, skipping insertion in model container [2019-12-19 01:23:26,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:23:26" (1/1) ... [2019-12-19 01:23:26,609 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 01:23:26,667 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 01:23:27,217 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 01:23:27,232 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 01:23:27,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 01:23:27,375 INFO L208 MainTranslator]: Completed translation [2019-12-19 01:23:27,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:23:27 WrapperNode [2019-12-19 01:23:27,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 01:23:27,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 01:23:27,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 01:23:27,377 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 01:23:27,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:23:27" (1/1) ... [2019-12-19 01:23:27,421 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:23:27" (1/1) ... [2019-12-19 01:23:27,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 01:23:27,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 01:23:27,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 01:23:27,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 01:23:27,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:23:27" (1/1) ... [2019-12-19 01:23:27,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:23:27" (1/1) ... [2019-12-19 01:23:27,467 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:23:27" (1/1) ... [2019-12-19 01:23:27,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:23:27" (1/1) ... [2019-12-19 01:23:27,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:23:27" (1/1) ... [2019-12-19 01:23:27,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:23:27" (1/1) ... [2019-12-19 01:23:27,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:23:27" (1/1) ... [2019-12-19 01:23:27,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 01:23:27,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 01:23:27,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 01:23:27,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 01:23:27,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:23:27" (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 01:23:27,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 01:23:27,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 01:23:27,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 01:23:27,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 01:23:27,582 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 01:23:27,582 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 01:23:27,582 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 01:23:27,582 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 01:23:27,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 01:23:27,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 01:23:27,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 01:23:27,585 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 01:23:28,306 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 01:23:28,307 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 01:23:28,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:23:28 BoogieIcfgContainer [2019-12-19 01:23:28,308 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 01:23:28,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 01:23:28,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 01:23:28,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 01:23:28,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 01:23:26" (1/3) ... [2019-12-19 01:23:28,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@122d58d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:23:28, skipping insertion in model container [2019-12-19 01:23:28,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:23:27" (2/3) ... [2019-12-19 01:23:28,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@122d58d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:23:28, skipping insertion in model container [2019-12-19 01:23:28,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:23:28" (3/3) ... [2019-12-19 01:23:28,317 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_pso.oepc.i [2019-12-19 01:23:28,328 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 01:23:28,329 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 01:23:28,337 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 01:23:28,338 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 01:23:28,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,379 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,379 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,380 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,380 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,381 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,397 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,398 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,463 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,464 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,464 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,473 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,476 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 01:23:28,493 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 01:23:28,517 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 01:23:28,517 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 01:23:28,518 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 01:23:28,518 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 01:23:28,518 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 01:23:28,518 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 01:23:28,518 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 01:23:28,518 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 01:23:28,531 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 147 places, 181 transitions [2019-12-19 01:23:30,585 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32591 states. [2019-12-19 01:23:30,587 INFO L276 IsEmpty]: Start isEmpty. Operand 32591 states. [2019-12-19 01:23:30,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-19 01:23:30,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:30,595 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] [2019-12-19 01:23:30,596 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:30,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:30,601 INFO L82 PathProgramCache]: Analyzing trace with hash 515763664, now seen corresponding path program 1 times [2019-12-19 01:23:30,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:30,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717795640] [2019-12-19 01:23:30,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:30,935 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 01:23:30,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717795640] [2019-12-19 01:23:30,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:30,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 01:23:30,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881868039] [2019-12-19 01:23:30,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 01:23:30,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:30,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 01:23:30,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 01:23:30,961 INFO L87 Difference]: Start difference. First operand 32591 states. Second operand 4 states. [2019-12-19 01:23:32,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:32,658 INFO L93 Difference]: Finished difference Result 33591 states and 129568 transitions. [2019-12-19 01:23:32,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 01:23:32,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-19 01:23:32,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:33,002 INFO L225 Difference]: With dead ends: 33591 [2019-12-19 01:23:33,002 INFO L226 Difference]: Without dead ends: 25703 [2019-12-19 01:23:33,010 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 01:23:33,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25703 states. [2019-12-19 01:23:34,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25703 to 25703. [2019-12-19 01:23:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25703 states. [2019-12-19 01:23:34,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25703 states to 25703 states and 99584 transitions. [2019-12-19 01:23:34,691 INFO L78 Accepts]: Start accepts. Automaton has 25703 states and 99584 transitions. Word has length 34 [2019-12-19 01:23:34,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:34,692 INFO L462 AbstractCegarLoop]: Abstraction has 25703 states and 99584 transitions. [2019-12-19 01:23:34,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 01:23:34,692 INFO L276 IsEmpty]: Start isEmpty. Operand 25703 states and 99584 transitions. [2019-12-19 01:23:34,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-19 01:23:34,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:34,703 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] [2019-12-19 01:23:34,704 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:34,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:34,704 INFO L82 PathProgramCache]: Analyzing trace with hash 471938879, now seen corresponding path program 1 times [2019-12-19 01:23:34,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:34,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449292205] [2019-12-19 01:23:34,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:34,899 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 01:23:34,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449292205] [2019-12-19 01:23:34,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:34,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 01:23:34,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258784148] [2019-12-19 01:23:34,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 01:23:34,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:34,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 01:23:34,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 01:23:34,904 INFO L87 Difference]: Start difference. First operand 25703 states and 99584 transitions. Second operand 5 states. [2019-12-19 01:23:35,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:35,963 INFO L93 Difference]: Finished difference Result 41081 states and 150431 transitions. [2019-12-19 01:23:35,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 01:23:35,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-19 01:23:35,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:37,411 INFO L225 Difference]: With dead ends: 41081 [2019-12-19 01:23:37,411 INFO L226 Difference]: Without dead ends: 40545 [2019-12-19 01:23:37,412 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 01:23:37,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40545 states. [2019-12-19 01:23:38,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40545 to 38925. [2019-12-19 01:23:38,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38925 states. [2019-12-19 01:23:38,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38925 states to 38925 states and 143581 transitions. [2019-12-19 01:23:38,841 INFO L78 Accepts]: Start accepts. Automaton has 38925 states and 143581 transitions. Word has length 46 [2019-12-19 01:23:38,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:38,842 INFO L462 AbstractCegarLoop]: Abstraction has 38925 states and 143581 transitions. [2019-12-19 01:23:38,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 01:23:38,842 INFO L276 IsEmpty]: Start isEmpty. Operand 38925 states and 143581 transitions. [2019-12-19 01:23:38,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-19 01:23:38,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:38,848 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] [2019-12-19 01:23:38,849 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:38,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:38,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1446923185, now seen corresponding path program 1 times [2019-12-19 01:23:38,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:38,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932952426] [2019-12-19 01:23:38,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:38,978 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 01:23:38,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932952426] [2019-12-19 01:23:38,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:38,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 01:23:38,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305037972] [2019-12-19 01:23:38,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 01:23:38,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:38,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 01:23:38,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 01:23:38,981 INFO L87 Difference]: Start difference. First operand 38925 states and 143581 transitions. Second operand 5 states. [2019-12-19 01:23:39,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:39,904 INFO L93 Difference]: Finished difference Result 49778 states and 180633 transitions. [2019-12-19 01:23:39,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 01:23:39,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-19 01:23:39,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:40,242 INFO L225 Difference]: With dead ends: 49778 [2019-12-19 01:23:40,243 INFO L226 Difference]: Without dead ends: 49274 [2019-12-19 01:23:40,243 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 01:23:40,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49274 states. [2019-12-19 01:23:42,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49274 to 42677. [2019-12-19 01:23:43,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42677 states. [2019-12-19 01:23:43,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42677 states to 42677 states and 156592 transitions. [2019-12-19 01:23:43,112 INFO L78 Accepts]: Start accepts. Automaton has 42677 states and 156592 transitions. Word has length 47 [2019-12-19 01:23:43,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:43,112 INFO L462 AbstractCegarLoop]: Abstraction has 42677 states and 156592 transitions. [2019-12-19 01:23:43,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 01:23:43,112 INFO L276 IsEmpty]: Start isEmpty. Operand 42677 states and 156592 transitions. [2019-12-19 01:23:43,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-19 01:23:43,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:43,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] [2019-12-19 01:23:43,122 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:43,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:43,122 INFO L82 PathProgramCache]: Analyzing trace with hash -104992681, now seen corresponding path program 1 times [2019-12-19 01:23:43,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:43,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763627859] [2019-12-19 01:23:43,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:43,177 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 01:23:43,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763627859] [2019-12-19 01:23:43,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:43,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 01:23:43,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437172009] [2019-12-19 01:23:43,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 01:23:43,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:43,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 01:23:43,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 01:23:43,181 INFO L87 Difference]: Start difference. First operand 42677 states and 156592 transitions. Second operand 3 states. [2019-12-19 01:23:43,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:43,827 INFO L93 Difference]: Finished difference Result 61087 states and 221430 transitions. [2019-12-19 01:23:43,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 01:23:43,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-12-19 01:23:43,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:44,022 INFO L225 Difference]: With dead ends: 61087 [2019-12-19 01:23:44,023 INFO L226 Difference]: Without dead ends: 61087 [2019-12-19 01:23:44,024 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 01:23:44,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61087 states. [2019-12-19 01:23:46,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61087 to 48016. [2019-12-19 01:23:46,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48016 states. [2019-12-19 01:23:47,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48016 states to 48016 states and 174179 transitions. [2019-12-19 01:23:47,107 INFO L78 Accepts]: Start accepts. Automaton has 48016 states and 174179 transitions. Word has length 49 [2019-12-19 01:23:47,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:47,108 INFO L462 AbstractCegarLoop]: Abstraction has 48016 states and 174179 transitions. [2019-12-19 01:23:47,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 01:23:47,108 INFO L276 IsEmpty]: Start isEmpty. Operand 48016 states and 174179 transitions. [2019-12-19 01:23:47,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 01:23:47,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:47,126 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:23:47,126 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:47,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:47,127 INFO L82 PathProgramCache]: Analyzing trace with hash -604414232, now seen corresponding path program 1 times [2019-12-19 01:23:47,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:47,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407141707] [2019-12-19 01:23:47,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:47,179 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 01:23:47,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407141707] [2019-12-19 01:23:47,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:47,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 01:23:47,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783998442] [2019-12-19 01:23:47,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 01:23:47,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:47,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 01:23:47,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 01:23:47,182 INFO L87 Difference]: Start difference. First operand 48016 states and 174179 transitions. Second operand 3 states. [2019-12-19 01:23:47,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:47,706 INFO L93 Difference]: Finished difference Result 53336 states and 193527 transitions. [2019-12-19 01:23:47,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 01:23:47,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-19 01:23:47,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:47,819 INFO L225 Difference]: With dead ends: 53336 [2019-12-19 01:23:47,820 INFO L226 Difference]: Without dead ends: 53336 [2019-12-19 01:23:47,820 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 01:23:48,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53336 states. [2019-12-19 01:23:49,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53336 to 50674. [2019-12-19 01:23:49,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50674 states. [2019-12-19 01:23:51,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50674 states to 50674 states and 183847 transitions. [2019-12-19 01:23:51,838 INFO L78 Accepts]: Start accepts. Automaton has 50674 states and 183847 transitions. Word has length 53 [2019-12-19 01:23:51,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:51,838 INFO L462 AbstractCegarLoop]: Abstraction has 50674 states and 183847 transitions. [2019-12-19 01:23:51,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 01:23:51,838 INFO L276 IsEmpty]: Start isEmpty. Operand 50674 states and 183847 transitions. [2019-12-19 01:23:51,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 01:23:51,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:51,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:23:51,853 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:51,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:51,854 INFO L82 PathProgramCache]: Analyzing trace with hash -2118465688, now seen corresponding path program 1 times [2019-12-19 01:23:51,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:51,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379582406] [2019-12-19 01:23:51,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:51,992 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 01:23:51,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379582406] [2019-12-19 01:23:51,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:51,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 01:23:51,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35467002] [2019-12-19 01:23:51,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 01:23:51,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:51,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 01:23:51,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 01:23:51,996 INFO L87 Difference]: Start difference. First operand 50674 states and 183847 transitions. Second operand 6 states. [2019-12-19 01:23:52,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:52,889 INFO L93 Difference]: Finished difference Result 65266 states and 234905 transitions. [2019-12-19 01:23:52,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 01:23:52,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-19 01:23:52,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:53,037 INFO L225 Difference]: With dead ends: 65266 [2019-12-19 01:23:53,037 INFO L226 Difference]: Without dead ends: 65266 [2019-12-19 01:23:53,037 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 01:23:53,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65266 states. [2019-12-19 01:23:54,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65266 to 59949. [2019-12-19 01:23:54,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59949 states. [2019-12-19 01:23:54,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59949 states to 59949 states and 215672 transitions. [2019-12-19 01:23:54,481 INFO L78 Accepts]: Start accepts. Automaton has 59949 states and 215672 transitions. Word has length 53 [2019-12-19 01:23:54,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:23:54,482 INFO L462 AbstractCegarLoop]: Abstraction has 59949 states and 215672 transitions. [2019-12-19 01:23:54,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 01:23:54,482 INFO L276 IsEmpty]: Start isEmpty. Operand 59949 states and 215672 transitions. [2019-12-19 01:23:54,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 01:23:54,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:23:54,498 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:23:54,499 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:23:54,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:23:54,499 INFO L82 PathProgramCache]: Analyzing trace with hash 379550249, now seen corresponding path program 1 times [2019-12-19 01:23:54,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:23:54,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845391777] [2019-12-19 01:23:54,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:23:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:23:54,632 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 01:23:54,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845391777] [2019-12-19 01:23:54,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:23:54,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 01:23:54,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303295413] [2019-12-19 01:23:54,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 01:23:54,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:23:54,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 01:23:54,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 01:23:54,635 INFO L87 Difference]: Start difference. First operand 59949 states and 215672 transitions. Second operand 7 states. [2019-12-19 01:23:56,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:23:56,420 INFO L93 Difference]: Finished difference Result 83685 states and 290097 transitions. [2019-12-19 01:23:56,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 01:23:56,420 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-19 01:23:56,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:23:56,614 INFO L225 Difference]: With dead ends: 83685 [2019-12-19 01:23:56,614 INFO L226 Difference]: Without dead ends: 83685 [2019-12-19 01:23:56,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 01:23:56,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83685 states. [2019-12-19 01:24:00,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83685 to 71012. [2019-12-19 01:24:00,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71012 states. [2019-12-19 01:24:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71012 states to 71012 states and 249886 transitions. [2019-12-19 01:24:00,569 INFO L78 Accepts]: Start accepts. Automaton has 71012 states and 249886 transitions. Word has length 53 [2019-12-19 01:24:00,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:24:00,569 INFO L462 AbstractCegarLoop]: Abstraction has 71012 states and 249886 transitions. [2019-12-19 01:24:00,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 01:24:00,570 INFO L276 IsEmpty]: Start isEmpty. Operand 71012 states and 249886 transitions. [2019-12-19 01:24:00,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 01:24:00,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:24:00,585 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:24:00,585 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:24:00,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:24:00,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1267053930, now seen corresponding path program 1 times [2019-12-19 01:24:00,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:24:00,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910652575] [2019-12-19 01:24:00,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:24:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:24:00,681 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 01:24:00,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910652575] [2019-12-19 01:24:00,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:24:00,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 01:24:00,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652904607] [2019-12-19 01:24:00,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 01:24:00,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:24:00,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 01:24:00,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 01:24:00,684 INFO L87 Difference]: Start difference. First operand 71012 states and 249886 transitions. Second operand 5 states. [2019-12-19 01:24:00,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:24:00,794 INFO L93 Difference]: Finished difference Result 12159 states and 37829 transitions. [2019-12-19 01:24:00,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 01:24:00,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-19 01:24:00,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:24:00,820 INFO L225 Difference]: With dead ends: 12159 [2019-12-19 01:24:00,821 INFO L226 Difference]: Without dead ends: 10674 [2019-12-19 01:24:00,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 01:24:00,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10674 states. [2019-12-19 01:24:01,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10674 to 10625. [2019-12-19 01:24:01,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10625 states. [2019-12-19 01:24:01,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10625 states to 10625 states and 32591 transitions. [2019-12-19 01:24:01,039 INFO L78 Accepts]: Start accepts. Automaton has 10625 states and 32591 transitions. Word has length 53 [2019-12-19 01:24:01,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:24:01,040 INFO L462 AbstractCegarLoop]: Abstraction has 10625 states and 32591 transitions. [2019-12-19 01:24:01,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 01:24:01,040 INFO L276 IsEmpty]: Start isEmpty. Operand 10625 states and 32591 transitions. [2019-12-19 01:24:01,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 01:24:01,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:24:01,043 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:24:01,043 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:24:01,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:24:01,043 INFO L82 PathProgramCache]: Analyzing trace with hash -2125589086, now seen corresponding path program 1 times [2019-12-19 01:24:01,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:24:01,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032848122] [2019-12-19 01:24:01,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:24:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:24:01,167 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 01:24:01,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032848122] [2019-12-19 01:24:01,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:24:01,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 01:24:01,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657004218] [2019-12-19 01:24:01,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 01:24:01,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:24:01,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 01:24:01,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 01:24:01,169 INFO L87 Difference]: Start difference. First operand 10625 states and 32591 transitions. Second operand 6 states. [2019-12-19 01:24:01,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:24:01,669 INFO L93 Difference]: Finished difference Result 13182 states and 39872 transitions. [2019-12-19 01:24:01,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 01:24:01,670 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-19 01:24:01,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:24:01,689 INFO L225 Difference]: With dead ends: 13182 [2019-12-19 01:24:01,689 INFO L226 Difference]: Without dead ends: 13119 [2019-12-19 01:24:01,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-19 01:24:01,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13119 states. [2019-12-19 01:24:01,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13119 to 11048. [2019-12-19 01:24:01,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11048 states. [2019-12-19 01:24:01,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11048 states to 11048 states and 33785 transitions. [2019-12-19 01:24:01,841 INFO L78 Accepts]: Start accepts. Automaton has 11048 states and 33785 transitions. Word has length 53 [2019-12-19 01:24:01,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:24:01,841 INFO L462 AbstractCegarLoop]: Abstraction has 11048 states and 33785 transitions. [2019-12-19 01:24:01,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 01:24:01,841 INFO L276 IsEmpty]: Start isEmpty. Operand 11048 states and 33785 transitions. [2019-12-19 01:24:01,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-19 01:24:01,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:24:01,845 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:24:01,845 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:24:01,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:24:01,845 INFO L82 PathProgramCache]: Analyzing trace with hash 340486782, now seen corresponding path program 1 times [2019-12-19 01:24:01,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:24:01,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404080512] [2019-12-19 01:24:01,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:24:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:24:01,897 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 01:24:01,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404080512] [2019-12-19 01:24:01,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:24:01,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 01:24:01,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537814461] [2019-12-19 01:24:01,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 01:24:01,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:24:01,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 01:24:01,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 01:24:01,899 INFO L87 Difference]: Start difference. First operand 11048 states and 33785 transitions. Second operand 4 states. [2019-12-19 01:24:02,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:24:02,448 INFO L93 Difference]: Finished difference Result 12862 states and 39391 transitions. [2019-12-19 01:24:02,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 01:24:02,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-19 01:24:02,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:24:02,467 INFO L225 Difference]: With dead ends: 12862 [2019-12-19 01:24:02,468 INFO L226 Difference]: Without dead ends: 12862 [2019-12-19 01:24:02,468 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 01:24:02,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12862 states. [2019-12-19 01:24:02,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12862 to 11693. [2019-12-19 01:24:02,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11693 states. [2019-12-19 01:24:02,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11693 states to 11693 states and 35762 transitions. [2019-12-19 01:24:02,631 INFO L78 Accepts]: Start accepts. Automaton has 11693 states and 35762 transitions. Word has length 61 [2019-12-19 01:24:02,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:24:02,632 INFO L462 AbstractCegarLoop]: Abstraction has 11693 states and 35762 transitions. [2019-12-19 01:24:02,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 01:24:02,632 INFO L276 IsEmpty]: Start isEmpty. Operand 11693 states and 35762 transitions. [2019-12-19 01:24:02,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-19 01:24:02,637 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:24:02,637 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:24:02,637 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:24:02,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:24:02,638 INFO L82 PathProgramCache]: Analyzing trace with hash 2083297117, now seen corresponding path program 1 times [2019-12-19 01:24:02,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:24:02,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052431337] [2019-12-19 01:24:02,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:24:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:24:02,713 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 01:24:02,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052431337] [2019-12-19 01:24:02,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:24:02,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 01:24:02,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871327968] [2019-12-19 01:24:02,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 01:24:02,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:24:02,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 01:24:02,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 01:24:02,715 INFO L87 Difference]: Start difference. First operand 11693 states and 35762 transitions. Second operand 6 states. [2019-12-19 01:24:03,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:24:03,164 INFO L93 Difference]: Finished difference Result 14219 states and 42860 transitions. [2019-12-19 01:24:03,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 01:24:03,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-19 01:24:03,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:24:03,186 INFO L225 Difference]: With dead ends: 14219 [2019-12-19 01:24:03,186 INFO L226 Difference]: Without dead ends: 14158 [2019-12-19 01:24:03,187 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 01:24:03,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14158 states. [2019-12-19 01:24:03,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14158 to 13461. [2019-12-19 01:24:03,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13461 states. [2019-12-19 01:24:03,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13461 states to 13461 states and 40779 transitions. [2019-12-19 01:24:03,373 INFO L78 Accepts]: Start accepts. Automaton has 13461 states and 40779 transitions. Word has length 61 [2019-12-19 01:24:03,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:24:03,373 INFO L462 AbstractCegarLoop]: Abstraction has 13461 states and 40779 transitions. [2019-12-19 01:24:03,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 01:24:03,374 INFO L276 IsEmpty]: Start isEmpty. Operand 13461 states and 40779 transitions. [2019-12-19 01:24:03,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 01:24:03,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:24:03,379 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:24:03,380 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:24:03,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:24:03,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1401730073, now seen corresponding path program 1 times [2019-12-19 01:24:03,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:24:03,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962785636] [2019-12-19 01:24:03,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:24:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:24:03,431 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 01:24:03,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962785636] [2019-12-19 01:24:03,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:24:03,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 01:24:03,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718072515] [2019-12-19 01:24:03,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 01:24:03,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:24:03,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 01:24:03,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 01:24:03,434 INFO L87 Difference]: Start difference. First operand 13461 states and 40779 transitions. Second operand 4 states. [2019-12-19 01:24:03,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:24:03,869 INFO L93 Difference]: Finished difference Result 18895 states and 55937 transitions. [2019-12-19 01:24:03,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 01:24:03,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-19 01:24:03,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:24:03,897 INFO L225 Difference]: With dead ends: 18895 [2019-12-19 01:24:03,897 INFO L226 Difference]: Without dead ends: 18847 [2019-12-19 01:24:03,897 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 01:24:03,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18847 states. [2019-12-19 01:24:04,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18847 to 14874. [2019-12-19 01:24:04,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14874 states. [2019-12-19 01:24:04,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14874 states to 14874 states and 44559 transitions. [2019-12-19 01:24:04,112 INFO L78 Accepts]: Start accepts. Automaton has 14874 states and 44559 transitions. Word has length 65 [2019-12-19 01:24:04,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:24:04,112 INFO L462 AbstractCegarLoop]: Abstraction has 14874 states and 44559 transitions. [2019-12-19 01:24:04,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 01:24:04,112 INFO L276 IsEmpty]: Start isEmpty. Operand 14874 states and 44559 transitions. [2019-12-19 01:24:04,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 01:24:04,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:24:04,119 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:24:04,119 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:24:04,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:24:04,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1648472742, now seen corresponding path program 1 times [2019-12-19 01:24:04,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:24:04,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380938113] [2019-12-19 01:24:04,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:24:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:24:04,179 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 01:24:04,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380938113] [2019-12-19 01:24:04,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:24:04,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 01:24:04,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131378293] [2019-12-19 01:24:04,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 01:24:04,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:24:04,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 01:24:04,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 01:24:04,182 INFO L87 Difference]: Start difference. First operand 14874 states and 44559 transitions. Second operand 4 states. [2019-12-19 01:24:04,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:24:04,534 INFO L93 Difference]: Finished difference Result 18169 states and 53762 transitions. [2019-12-19 01:24:04,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 01:24:04,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-19 01:24:04,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:24:04,565 INFO L225 Difference]: With dead ends: 18169 [2019-12-19 01:24:04,566 INFO L226 Difference]: Without dead ends: 18169 [2019-12-19 01:24:04,566 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 01:24:04,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18169 states. [2019-12-19 01:24:05,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18169 to 15114. [2019-12-19 01:24:05,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15114 states. [2019-12-19 01:24:05,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15114 states to 15114 states and 45207 transitions. [2019-12-19 01:24:05,154 INFO L78 Accepts]: Start accepts. Automaton has 15114 states and 45207 transitions. Word has length 65 [2019-12-19 01:24:05,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:24:05,155 INFO L462 AbstractCegarLoop]: Abstraction has 15114 states and 45207 transitions. [2019-12-19 01:24:05,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 01:24:05,155 INFO L276 IsEmpty]: Start isEmpty. Operand 15114 states and 45207 transitions. [2019-12-19 01:24:05,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 01:24:05,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:24:05,162 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:24:05,162 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:24:05,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:24:05,163 INFO L82 PathProgramCache]: Analyzing trace with hash -428736601, now seen corresponding path program 1 times [2019-12-19 01:24:05,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:24:05,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644226085] [2019-12-19 01:24:05,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:24:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:24:05,208 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 01:24:05,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644226085] [2019-12-19 01:24:05,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:24:05,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 01:24:05,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380624721] [2019-12-19 01:24:05,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 01:24:05,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:24:05,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 01:24:05,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 01:24:05,211 INFO L87 Difference]: Start difference. First operand 15114 states and 45207 transitions. Second operand 3 states. [2019-12-19 01:24:05,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:24:05,511 INFO L93 Difference]: Finished difference Result 15542 states and 46331 transitions. [2019-12-19 01:24:05,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 01:24:05,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-19 01:24:05,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:24:05,547 INFO L225 Difference]: With dead ends: 15542 [2019-12-19 01:24:05,548 INFO L226 Difference]: Without dead ends: 15542 [2019-12-19 01:24:05,549 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 01:24:05,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15542 states. [2019-12-19 01:24:05,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15542 to 15328. [2019-12-19 01:24:05,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15328 states. [2019-12-19 01:24:05,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15328 states to 15328 states and 45749 transitions. [2019-12-19 01:24:05,870 INFO L78 Accepts]: Start accepts. Automaton has 15328 states and 45749 transitions. Word has length 65 [2019-12-19 01:24:05,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:24:05,870 INFO L462 AbstractCegarLoop]: Abstraction has 15328 states and 45749 transitions. [2019-12-19 01:24:05,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 01:24:05,871 INFO L276 IsEmpty]: Start isEmpty. Operand 15328 states and 45749 transitions. [2019-12-19 01:24:05,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 01:24:05,883 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:24:05,883 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:24:05,883 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:24:05,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:24:05,884 INFO L82 PathProgramCache]: Analyzing trace with hash -812985011, now seen corresponding path program 1 times [2019-12-19 01:24:05,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:24:05,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74410872] [2019-12-19 01:24:05,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:24:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:24:06,020 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 01:24:06,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74410872] [2019-12-19 01:24:06,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:24:06,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 01:24:06,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438267057] [2019-12-19 01:24:06,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 01:24:06,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:24:06,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 01:24:06,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 01:24:06,022 INFO L87 Difference]: Start difference. First operand 15328 states and 45749 transitions. Second operand 6 states. [2019-12-19 01:24:06,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:24:06,482 INFO L93 Difference]: Finished difference Result 16701 states and 48916 transitions. [2019-12-19 01:24:06,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 01:24:06,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-19 01:24:06,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:24:06,507 INFO L225 Difference]: With dead ends: 16701 [2019-12-19 01:24:06,507 INFO L226 Difference]: Without dead ends: 16701 [2019-12-19 01:24:06,508 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 01:24:06,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16701 states. [2019-12-19 01:24:06,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16701 to 15510. [2019-12-19 01:24:06,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15510 states. [2019-12-19 01:24:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15510 states to 15510 states and 45935 transitions. [2019-12-19 01:24:06,716 INFO L78 Accepts]: Start accepts. Automaton has 15510 states and 45935 transitions. Word has length 67 [2019-12-19 01:24:06,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:24:06,716 INFO L462 AbstractCegarLoop]: Abstraction has 15510 states and 45935 transitions. [2019-12-19 01:24:06,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 01:24:06,716 INFO L276 IsEmpty]: Start isEmpty. Operand 15510 states and 45935 transitions. [2019-12-19 01:24:06,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 01:24:06,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:24:06,725 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:24:06,725 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:24:06,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:24:06,725 INFO L82 PathProgramCache]: Analyzing trace with hash -601634098, now seen corresponding path program 1 times [2019-12-19 01:24:06,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:24:06,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472408235] [2019-12-19 01:24:06,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:24:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:24:06,798 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 01:24:06,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472408235] [2019-12-19 01:24:06,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:24:06,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 01:24:06,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141329683] [2019-12-19 01:24:06,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 01:24:06,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:24:06,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 01:24:06,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 01:24:06,800 INFO L87 Difference]: Start difference. First operand 15510 states and 45935 transitions. Second operand 5 states. [2019-12-19 01:24:07,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:24:07,196 INFO L93 Difference]: Finished difference Result 19681 states and 57982 transitions. [2019-12-19 01:24:07,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 01:24:07,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-19 01:24:07,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:24:07,225 INFO L225 Difference]: With dead ends: 19681 [2019-12-19 01:24:07,225 INFO L226 Difference]: Without dead ends: 19681 [2019-12-19 01:24:07,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 01:24:07,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19681 states. [2019-12-19 01:24:07,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19681 to 18165. [2019-12-19 01:24:07,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18165 states. [2019-12-19 01:24:07,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18165 states to 18165 states and 53469 transitions. [2019-12-19 01:24:07,470 INFO L78 Accepts]: Start accepts. Automaton has 18165 states and 53469 transitions. Word has length 67 [2019-12-19 01:24:07,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:24:07,470 INFO L462 AbstractCegarLoop]: Abstraction has 18165 states and 53469 transitions. [2019-12-19 01:24:07,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 01:24:07,470 INFO L276 IsEmpty]: Start isEmpty. Operand 18165 states and 53469 transitions. [2019-12-19 01:24:07,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 01:24:07,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:24:07,481 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:24:07,481 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:24:07,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:24:07,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1112168275, now seen corresponding path program 1 times [2019-12-19 01:24:07,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:24:07,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457423376] [2019-12-19 01:24:07,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:24:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:24:07,540 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 01:24:07,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457423376] [2019-12-19 01:24:07,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:24:07,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 01:24:07,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936778784] [2019-12-19 01:24:07,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 01:24:07,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:24:07,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 01:24:07,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 01:24:07,542 INFO L87 Difference]: Start difference. First operand 18165 states and 53469 transitions. Second operand 5 states. [2019-12-19 01:24:08,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:24:08,517 INFO L93 Difference]: Finished difference Result 26550 states and 77182 transitions. [2019-12-19 01:24:08,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 01:24:08,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-19 01:24:08,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:24:08,556 INFO L225 Difference]: With dead ends: 26550 [2019-12-19 01:24:08,557 INFO L226 Difference]: Without dead ends: 26550 [2019-12-19 01:24:08,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 01:24:08,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26550 states. [2019-12-19 01:24:08,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26550 to 21618. [2019-12-19 01:24:08,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21618 states. [2019-12-19 01:24:08,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21618 states to 21618 states and 62902 transitions. [2019-12-19 01:24:08,875 INFO L78 Accepts]: Start accepts. Automaton has 21618 states and 62902 transitions. Word has length 67 [2019-12-19 01:24:08,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:24:08,875 INFO L462 AbstractCegarLoop]: Abstraction has 21618 states and 62902 transitions. [2019-12-19 01:24:08,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 01:24:08,875 INFO L276 IsEmpty]: Start isEmpty. Operand 21618 states and 62902 transitions. [2019-12-19 01:24:08,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 01:24:08,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:24:08,885 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:24:08,885 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:24:08,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:24:08,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1375344558, now seen corresponding path program 1 times [2019-12-19 01:24:08,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:24:08,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406433772] [2019-12-19 01:24:08,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:24:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:24:08,936 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 01:24:08,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406433772] [2019-12-19 01:24:08,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:24:08,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 01:24:08,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296801499] [2019-12-19 01:24:08,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 01:24:08,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:24:08,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 01:24:08,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 01:24:08,938 INFO L87 Difference]: Start difference. First operand 21618 states and 62902 transitions. Second operand 4 states. [2019-12-19 01:24:09,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:24:09,602 INFO L93 Difference]: Finished difference Result 28143 states and 82198 transitions. [2019-12-19 01:24:09,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 01:24:09,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-19 01:24:09,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:24:09,644 INFO L225 Difference]: With dead ends: 28143 [2019-12-19 01:24:09,644 INFO L226 Difference]: Without dead ends: 28008 [2019-12-19 01:24:09,645 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 01:24:09,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28008 states. [2019-12-19 01:24:09,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28008 to 26043. [2019-12-19 01:24:09,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26043 states. [2019-12-19 01:24:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26043 states to 26043 states and 76088 transitions. [2019-12-19 01:24:10,006 INFO L78 Accepts]: Start accepts. Automaton has 26043 states and 76088 transitions. Word has length 67 [2019-12-19 01:24:10,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:24:10,006 INFO L462 AbstractCegarLoop]: Abstraction has 26043 states and 76088 transitions. [2019-12-19 01:24:10,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 01:24:10,007 INFO L276 IsEmpty]: Start isEmpty. Operand 26043 states and 76088 transitions. [2019-12-19 01:24:10,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 01:24:10,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:24:10,017 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:24:10,018 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:24:10,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:24:10,018 INFO L82 PathProgramCache]: Analyzing trace with hash -421606801, now seen corresponding path program 1 times [2019-12-19 01:24:10,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:24:10,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299531789] [2019-12-19 01:24:10,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:24:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:24:10,204 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 01:24:10,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299531789] [2019-12-19 01:24:10,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:24:10,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 01:24:10,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010822046] [2019-12-19 01:24:10,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 01:24:10,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:24:10,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 01:24:10,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 01:24:10,207 INFO L87 Difference]: Start difference. First operand 26043 states and 76088 transitions. Second operand 7 states. [2019-12-19 01:24:10,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:24:10,796 INFO L93 Difference]: Finished difference Result 23304 states and 65259 transitions. [2019-12-19 01:24:10,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 01:24:10,797 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-19 01:24:10,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:24:10,827 INFO L225 Difference]: With dead ends: 23304 [2019-12-19 01:24:10,827 INFO L226 Difference]: Without dead ends: 23304 [2019-12-19 01:24:10,828 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 01:24:10,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23304 states. [2019-12-19 01:24:11,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23304 to 19068. [2019-12-19 01:24:11,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19068 states. [2019-12-19 01:24:11,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19068 states to 19068 states and 53401 transitions. [2019-12-19 01:24:11,464 INFO L78 Accepts]: Start accepts. Automaton has 19068 states and 53401 transitions. Word has length 67 [2019-12-19 01:24:11,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:24:11,464 INFO L462 AbstractCegarLoop]: Abstraction has 19068 states and 53401 transitions. [2019-12-19 01:24:11,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 01:24:11,464 INFO L276 IsEmpty]: Start isEmpty. Operand 19068 states and 53401 transitions. [2019-12-19 01:24:11,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 01:24:11,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:24:11,472 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:24:11,472 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:24:11,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:24:11,472 INFO L82 PathProgramCache]: Analyzing trace with hash 465896880, now seen corresponding path program 1 times [2019-12-19 01:24:11,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:24:11,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682670218] [2019-12-19 01:24:11,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:24:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:24:11,550 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 01:24:11,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682670218] [2019-12-19 01:24:11,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:24:11,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 01:24:11,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906275782] [2019-12-19 01:24:11,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 01:24:11,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:24:11,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 01:24:11,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 01:24:11,553 INFO L87 Difference]: Start difference. First operand 19068 states and 53401 transitions. Second operand 5 states. [2019-12-19 01:24:11,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:24:11,603 INFO L93 Difference]: Finished difference Result 5742 states and 13710 transitions. [2019-12-19 01:24:11,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 01:24:11,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-19 01:24:11,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:24:11,612 INFO L225 Difference]: With dead ends: 5742 [2019-12-19 01:24:11,612 INFO L226 Difference]: Without dead ends: 4764 [2019-12-19 01:24:11,612 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 01:24:11,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4764 states. [2019-12-19 01:24:11,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4764 to 3929. [2019-12-19 01:24:11,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3929 states. [2019-12-19 01:24:11,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3929 states to 3929 states and 9180 transitions. [2019-12-19 01:24:11,674 INFO L78 Accepts]: Start accepts. Automaton has 3929 states and 9180 transitions. Word has length 67 [2019-12-19 01:24:11,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:24:11,674 INFO L462 AbstractCegarLoop]: Abstraction has 3929 states and 9180 transitions. [2019-12-19 01:24:11,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 01:24:11,674 INFO L276 IsEmpty]: Start isEmpty. Operand 3929 states and 9180 transitions. [2019-12-19 01:24:11,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 01:24:11,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:24:11,679 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:24:11,679 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:24:11,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:24:11,679 INFO L82 PathProgramCache]: Analyzing trace with hash 2130159502, now seen corresponding path program 1 times [2019-12-19 01:24:11,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:24:11,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435969817] [2019-12-19 01:24:11,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:24:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:24:11,707 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 01:24:11,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435969817] [2019-12-19 01:24:11,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:24:11,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 01:24:11,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208916057] [2019-12-19 01:24:11,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 01:24:11,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:24:11,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 01:24:11,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 01:24:11,709 INFO L87 Difference]: Start difference. First operand 3929 states and 9180 transitions. Second operand 3 states. [2019-12-19 01:24:11,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:24:11,755 INFO L93 Difference]: Finished difference Result 4939 states and 11353 transitions. [2019-12-19 01:24:11,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 01:24:11,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-19 01:24:11,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:24:11,762 INFO L225 Difference]: With dead ends: 4939 [2019-12-19 01:24:11,762 INFO L226 Difference]: Without dead ends: 4939 [2019-12-19 01:24:11,763 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 01:24:11,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2019-12-19 01:24:11,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 3872. [2019-12-19 01:24:11,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3872 states. [2019-12-19 01:24:11,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3872 states to 3872 states and 8827 transitions. [2019-12-19 01:24:11,830 INFO L78 Accepts]: Start accepts. Automaton has 3872 states and 8827 transitions. Word has length 67 [2019-12-19 01:24:11,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:24:11,831 INFO L462 AbstractCegarLoop]: Abstraction has 3872 states and 8827 transitions. [2019-12-19 01:24:11,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 01:24:11,831 INFO L276 IsEmpty]: Start isEmpty. Operand 3872 states and 8827 transitions. [2019-12-19 01:24:11,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-19 01:24:11,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:24: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] [2019-12-19 01:24:11,836 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:24:11,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:24:11,837 INFO L82 PathProgramCache]: Analyzing trace with hash -347462239, now seen corresponding path program 1 times [2019-12-19 01:24:11,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:24:11,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766851012] [2019-12-19 01:24:11,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:24:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:24:11,888 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 01:24:11,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766851012] [2019-12-19 01:24:11,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:24:11,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 01:24:11,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541497645] [2019-12-19 01:24:11,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 01:24:11,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:24:11,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 01:24:11,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 01:24:11,890 INFO L87 Difference]: Start difference. First operand 3872 states and 8827 transitions. Second operand 5 states. [2019-12-19 01:24:12,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:24:12,056 INFO L93 Difference]: Finished difference Result 4823 states and 11022 transitions. [2019-12-19 01:24:12,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 01:24:12,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-12-19 01:24:12,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:24:12,063 INFO L225 Difference]: With dead ends: 4823 [2019-12-19 01:24:12,063 INFO L226 Difference]: Without dead ends: 4823 [2019-12-19 01:24:12,064 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 01:24:12,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4823 states. [2019-12-19 01:24:12,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4823 to 4258. [2019-12-19 01:24:12,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4258 states. [2019-12-19 01:24:12,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4258 states to 4258 states and 9716 transitions. [2019-12-19 01:24:12,121 INFO L78 Accepts]: Start accepts. Automaton has 4258 states and 9716 transitions. Word has length 73 [2019-12-19 01:24:12,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:24:12,121 INFO L462 AbstractCegarLoop]: Abstraction has 4258 states and 9716 transitions. [2019-12-19 01:24:12,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 01:24:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand 4258 states and 9716 transitions. [2019-12-19 01:24:12,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-19 01:24:12,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:24:12,125 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] [2019-12-19 01:24:12,125 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:24:12,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:24:12,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1395348096, now seen corresponding path program 1 times [2019-12-19 01:24:12,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:24:12,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694005219] [2019-12-19 01:24:12,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:24:12,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:24:12,183 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 01:24:12,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694005219] [2019-12-19 01:24:12,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:24:12,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 01:24:12,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241737484] [2019-12-19 01:24:12,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 01:24:12,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:24:12,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 01:24:12,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 01:24:12,185 INFO L87 Difference]: Start difference. First operand 4258 states and 9716 transitions. Second operand 7 states. [2019-12-19 01:24:12,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:24:12,658 INFO L93 Difference]: Finished difference Result 4955 states and 11180 transitions. [2019-12-19 01:24:12,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 01:24:12,658 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-12-19 01:24:12,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:24:12,665 INFO L225 Difference]: With dead ends: 4955 [2019-12-19 01:24:12,665 INFO L226 Difference]: Without dead ends: 4902 [2019-12-19 01:24:12,666 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 01:24:12,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4902 states. [2019-12-19 01:24:12,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4902 to 4316. [2019-12-19 01:24:12,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4316 states. [2019-12-19 01:24:12,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4316 states to 4316 states and 9765 transitions. [2019-12-19 01:24:12,711 INFO L78 Accepts]: Start accepts. Automaton has 4316 states and 9765 transitions. Word has length 73 [2019-12-19 01:24:12,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:24:12,711 INFO L462 AbstractCegarLoop]: Abstraction has 4316 states and 9765 transitions. [2019-12-19 01:24:12,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 01:24:12,711 INFO L276 IsEmpty]: Start isEmpty. Operand 4316 states and 9765 transitions. [2019-12-19 01:24:12,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 01:24:12,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:24:12,716 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:24:12,716 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:24:12,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:24:12,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1966822310, now seen corresponding path program 1 times [2019-12-19 01:24:12,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:24:12,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929885739] [2019-12-19 01:24:12,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:24:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:24:12,763 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 01:24:12,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929885739] [2019-12-19 01:24:12,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:24:12,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 01:24:12,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302088533] [2019-12-19 01:24:12,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 01:24:12,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:24:12,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 01:24:12,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 01:24:12,766 INFO L87 Difference]: Start difference. First operand 4316 states and 9765 transitions. Second operand 3 states. [2019-12-19 01:24:12,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:24:12,907 INFO L93 Difference]: Finished difference Result 5922 states and 13049 transitions. [2019-12-19 01:24:12,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 01:24:12,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-19 01:24:12,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:24:12,915 INFO L225 Difference]: With dead ends: 5922 [2019-12-19 01:24:12,915 INFO L226 Difference]: Without dead ends: 5631 [2019-12-19 01:24:12,917 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 01:24:12,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5631 states. [2019-12-19 01:24:12,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5631 to 5150. [2019-12-19 01:24:12,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5150 states. [2019-12-19 01:24:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5150 states to 5150 states and 11491 transitions. [2019-12-19 01:24:12,999 INFO L78 Accepts]: Start accepts. Automaton has 5150 states and 11491 transitions. Word has length 94 [2019-12-19 01:24:13,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:24:13,000 INFO L462 AbstractCegarLoop]: Abstraction has 5150 states and 11491 transitions. [2019-12-19 01:24:13,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 01:24:13,000 INFO L276 IsEmpty]: Start isEmpty. Operand 5150 states and 11491 transitions. [2019-12-19 01:24:13,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 01:24:13,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:24:13,007 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:24:13,007 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:24:13,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:24:13,008 INFO L82 PathProgramCache]: Analyzing trace with hash -2044994522, now seen corresponding path program 1 times [2019-12-19 01:24:13,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:24:13,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350101655] [2019-12-19 01:24:13,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:24:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:24:13,090 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 01:24:13,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350101655] [2019-12-19 01:24:13,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:24:13,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 01:24:13,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861039908] [2019-12-19 01:24:13,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 01:24:13,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:24:13,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 01:24:13,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 01:24:13,092 INFO L87 Difference]: Start difference. First operand 5150 states and 11491 transitions. Second operand 4 states. [2019-12-19 01:24:13,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:24:13,215 INFO L93 Difference]: Finished difference Result 5440 states and 12197 transitions. [2019-12-19 01:24:13,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 01:24:13,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-19 01:24:13,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:24:13,224 INFO L225 Difference]: With dead ends: 5440 [2019-12-19 01:24:13,224 INFO L226 Difference]: Without dead ends: 5440 [2019-12-19 01:24:13,224 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 01:24:13,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5440 states. [2019-12-19 01:24:13,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5440 to 4895. [2019-12-19 01:24:13,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4895 states. [2019-12-19 01:24:13,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4895 states to 4895 states and 11028 transitions. [2019-12-19 01:24:13,305 INFO L78 Accepts]: Start accepts. Automaton has 4895 states and 11028 transitions. Word has length 94 [2019-12-19 01:24:13,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:24:13,305 INFO L462 AbstractCegarLoop]: Abstraction has 4895 states and 11028 transitions. [2019-12-19 01:24:13,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 01:24:13,306 INFO L276 IsEmpty]: Start isEmpty. Operand 4895 states and 11028 transitions. [2019-12-19 01:24:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 01:24:13,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:24:13,311 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:24:13,311 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:24:13,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:24:13,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1707183412, now seen corresponding path program 1 times [2019-12-19 01:24:13,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:24:13,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017368500] [2019-12-19 01:24:13,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:24:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:24:13,375 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 01:24:13,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017368500] [2019-12-19 01:24:13,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:24:13,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 01:24:13,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847638771] [2019-12-19 01:24:13,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 01:24:13,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:24:13,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 01:24:13,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 01:24:13,377 INFO L87 Difference]: Start difference. First operand 4895 states and 11028 transitions. Second operand 5 states. [2019-12-19 01:24:13,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:24:13,493 INFO L93 Difference]: Finished difference Result 5578 states and 12520 transitions. [2019-12-19 01:24:13,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 01:24:13,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-19 01:24:13,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:24:13,501 INFO L225 Difference]: With dead ends: 5578 [2019-12-19 01:24:13,501 INFO L226 Difference]: Without dead ends: 5578 [2019-12-19 01:24:13,501 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 01:24:13,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5578 states. [2019-12-19 01:24:13,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5578 to 4288. [2019-12-19 01:24:13,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4288 states. [2019-12-19 01:24:13,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4288 states to 4288 states and 9629 transitions. [2019-12-19 01:24:13,551 INFO L78 Accepts]: Start accepts. Automaton has 4288 states and 9629 transitions. Word has length 96 [2019-12-19 01:24:13,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:24:13,551 INFO L462 AbstractCegarLoop]: Abstraction has 4288 states and 9629 transitions. [2019-12-19 01:24:13,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 01:24:13,551 INFO L276 IsEmpty]: Start isEmpty. Operand 4288 states and 9629 transitions. [2019-12-19 01:24:13,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 01:24:13,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:24:13,557 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:24:13,557 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:24:13,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:24:13,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1695867285, now seen corresponding path program 1 times [2019-12-19 01:24:13,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:24:13,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6732278] [2019-12-19 01:24:13,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:24:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:24:13,616 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 01:24:13,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6732278] [2019-12-19 01:24:13,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:24:13,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 01:24:13,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397801346] [2019-12-19 01:24:13,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 01:24:13,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:24:13,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 01:24:13,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 01:24:13,617 INFO L87 Difference]: Start difference. First operand 4288 states and 9629 transitions. Second operand 4 states. [2019-12-19 01:24:13,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:24:13,885 INFO L93 Difference]: Finished difference Result 5028 states and 11235 transitions. [2019-12-19 01:24:13,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 01:24:13,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-19 01:24:13,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:24:13,891 INFO L225 Difference]: With dead ends: 5028 [2019-12-19 01:24:13,891 INFO L226 Difference]: Without dead ends: 4972 [2019-12-19 01:24:13,891 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 01:24:13,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4972 states. [2019-12-19 01:24:13,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4972 to 4761. [2019-12-19 01:24:13,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4761 states. [2019-12-19 01:24:13,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4761 states to 4761 states and 10672 transitions. [2019-12-19 01:24:13,940 INFO L78 Accepts]: Start accepts. Automaton has 4761 states and 10672 transitions. Word has length 96 [2019-12-19 01:24:13,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:24:13,940 INFO L462 AbstractCegarLoop]: Abstraction has 4761 states and 10672 transitions. [2019-12-19 01:24:13,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 01:24:13,940 INFO L276 IsEmpty]: Start isEmpty. Operand 4761 states and 10672 transitions. [2019-12-19 01:24:13,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 01:24:13,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:24:13,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:24:13,946 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:24:13,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:24:13,947 INFO L82 PathProgramCache]: Analyzing trace with hash 521890668, now seen corresponding path program 1 times [2019-12-19 01:24:13,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:24:13,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024338124] [2019-12-19 01:24:13,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:24:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:24:14,130 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 01:24:14,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024338124] [2019-12-19 01:24:14,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:24:14,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 01:24:14,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003481913] [2019-12-19 01:24:14,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 01:24:14,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:24:14,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 01:24:14,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-19 01:24:14,132 INFO L87 Difference]: Start difference. First operand 4761 states and 10672 transitions. Second operand 9 states. [2019-12-19 01:24:15,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:24:15,118 INFO L93 Difference]: Finished difference Result 6421 states and 14150 transitions. [2019-12-19 01:24:15,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 01:24:15,118 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-12-19 01:24:15,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:24:15,127 INFO L225 Difference]: With dead ends: 6421 [2019-12-19 01:24:15,127 INFO L226 Difference]: Without dead ends: 6421 [2019-12-19 01:24:15,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-12-19 01:24:15,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6421 states. [2019-12-19 01:24:15,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6421 to 5243. [2019-12-19 01:24:15,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5243 states. [2019-12-19 01:24:15,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5243 states to 5243 states and 11670 transitions. [2019-12-19 01:24:15,190 INFO L78 Accepts]: Start accepts. Automaton has 5243 states and 11670 transitions. Word has length 96 [2019-12-19 01:24:15,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:24:15,190 INFO L462 AbstractCegarLoop]: Abstraction has 5243 states and 11670 transitions. [2019-12-19 01:24:15,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 01:24:15,190 INFO L276 IsEmpty]: Start isEmpty. Operand 5243 states and 11670 transitions. [2019-12-19 01:24:15,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 01:24:15,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:24:15,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:24:15,195 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:24:15,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:24:15,195 INFO L82 PathProgramCache]: Analyzing trace with hash 733241581, now seen corresponding path program 1 times [2019-12-19 01:24:15,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:24:15,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275943247] [2019-12-19 01:24:15,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:24:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:24:15,300 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 01:24:15,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275943247] [2019-12-19 01:24:15,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:24:15,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 01:24:15,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276490027] [2019-12-19 01:24:15,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 01:24:15,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:24:15,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 01:24:15,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 01:24:15,302 INFO L87 Difference]: Start difference. First operand 5243 states and 11670 transitions. Second operand 5 states. [2019-12-19 01:24:15,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:24:15,348 INFO L93 Difference]: Finished difference Result 5243 states and 11661 transitions. [2019-12-19 01:24:15,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 01:24:15,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-19 01:24:15,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:24:15,355 INFO L225 Difference]: With dead ends: 5243 [2019-12-19 01:24:15,355 INFO L226 Difference]: Without dead ends: 5243 [2019-12-19 01:24:15,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-19 01:24:15,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5243 states. [2019-12-19 01:24:15,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5243 to 5007. [2019-12-19 01:24:15,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5007 states. [2019-12-19 01:24:15,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5007 states to 5007 states and 11134 transitions. [2019-12-19 01:24:15,420 INFO L78 Accepts]: Start accepts. Automaton has 5007 states and 11134 transitions. Word has length 96 [2019-12-19 01:24:15,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:24:15,420 INFO L462 AbstractCegarLoop]: Abstraction has 5007 states and 11134 transitions. [2019-12-19 01:24:15,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 01:24:15,421 INFO L276 IsEmpty]: Start isEmpty. Operand 5007 states and 11134 transitions. [2019-12-19 01:24:15,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 01:24:15,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:24:15,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:24:15,425 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:24:15,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:24:15,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1620745262, now seen corresponding path program 1 times [2019-12-19 01:24:15,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:24:15,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214357011] [2019-12-19 01:24:15,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:24:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 01:24:15,561 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 01:24:15,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214357011] [2019-12-19 01:24:15,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 01:24:15,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-19 01:24:15,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280937134] [2019-12-19 01:24:15,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-19 01:24:15,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 01:24:15,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-19 01:24:15,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-19 01:24:15,563 INFO L87 Difference]: Start difference. First operand 5007 states and 11134 transitions. Second operand 10 states. [2019-12-19 01:24:16,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 01:24:16,160 INFO L93 Difference]: Finished difference Result 14575 states and 32877 transitions. [2019-12-19 01:24:16,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-19 01:24:16,160 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-19 01:24:16,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 01:24:16,174 INFO L225 Difference]: With dead ends: 14575 [2019-12-19 01:24:16,174 INFO L226 Difference]: Without dead ends: 9899 [2019-12-19 01:24:16,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-19 01:24:16,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9899 states. [2019-12-19 01:24:16,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9899 to 5000. [2019-12-19 01:24:16,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5000 states. [2019-12-19 01:24:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5000 states to 5000 states and 11030 transitions. [2019-12-19 01:24:16,272 INFO L78 Accepts]: Start accepts. Automaton has 5000 states and 11030 transitions. Word has length 96 [2019-12-19 01:24:16,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 01:24:16,272 INFO L462 AbstractCegarLoop]: Abstraction has 5000 states and 11030 transitions. [2019-12-19 01:24:16,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-19 01:24:16,273 INFO L276 IsEmpty]: Start isEmpty. Operand 5000 states and 11030 transitions. [2019-12-19 01:24:16,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 01:24:16,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 01:24:16,277 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 01:24:16,277 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 01:24:16,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 01:24:16,277 INFO L82 PathProgramCache]: Analyzing trace with hash -393959572, now seen corresponding path program 2 times [2019-12-19 01:24:16,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 01:24:16,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740530654] [2019-12-19 01:24:16,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 01:24:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 01:24:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 01:24:16,428 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 01:24:16,428 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 01:24:16,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 01:24:16 BasicIcfg [2019-12-19 01:24:16,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 01:24:16,623 INFO L168 Benchmark]: Toolchain (without parser) took 50027.70 ms. Allocated memory was 145.8 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 102.1 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-19 01:24:16,626 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-19 01:24:16,629 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.35 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.7 MB in the beginning and 157.4 MB in the end (delta: -55.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-19 01:24:16,629 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.57 ms. Allocated memory is still 203.4 MB. Free memory was 157.4 MB in the beginning and 154.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-19 01:24:16,630 INFO L168 Benchmark]: Boogie Preprocessor took 57.84 ms. Allocated memory is still 203.4 MB. Free memory was 154.8 MB in the beginning and 152.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-19 01:24:16,630 INFO L168 Benchmark]: RCFGBuilder took 798.72 ms. Allocated memory is still 203.4 MB. Free memory was 152.8 MB in the beginning and 108.6 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-19 01:24:16,630 INFO L168 Benchmark]: TraceAbstraction took 48311.57 ms. Allocated memory was 203.4 MB in the beginning and 2.5 GB in the end (delta: 2.2 GB). Free memory was 108.0 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-19 01:24:16,634 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.49 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 779.35 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.7 MB in the beginning and 157.4 MB in the end (delta: -55.7 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.57 ms. Allocated memory is still 203.4 MB. Free memory was 157.4 MB in the beginning and 154.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.84 ms. Allocated memory is still 203.4 MB. Free memory was 154.8 MB in the beginning and 152.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 798.72 ms. Allocated memory is still 203.4 MB. Free memory was 152.8 MB in the beginning and 108.6 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 48311.57 ms. Allocated memory was 203.4 MB in the beginning and 2.5 GB in the end (delta: 2.2 GB). Free memory was 108.0 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L704] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L705] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L706] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L707] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L708] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L709] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L710] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L711] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L712] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L713] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L714] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L715] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L716] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L717] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L718] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 pthread_t t589; VAL [__unbuffered_cnt=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] FCALL, FORK 0 pthread_create(&t589, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd1 = (_Bool)1 [L735] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 pthread_t t590; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L799] FCALL, FORK 0 pthread_create(&t590, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L768] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y = y$flush_delayed ? y$mem_tmp : y [L771] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L774] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L806] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L808] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L809] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L812] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 47.9s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 19.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8488 SDtfs, 8652 SDslu, 17632 SDs, 0 SdLazy, 6588 SolverSat, 432 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 277 GetRequests, 78 SyntacticMatches, 20 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71012occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 22.7s AutomataMinimizationTime, 30 MinimizatonAttempts, 78901 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2137 NumberOfCodeBlocks, 2137 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2011 ConstructedInterpolants, 0 QuantifiedInterpolants, 364823 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...