/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/mix031_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 01:59:59,231 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 01:59:59,234 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 01:59:59,253 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 01:59:59,253 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 01:59:59,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 01:59:59,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 01:59:59,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 01:59:59,272 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 01:59:59,273 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 01:59:59,277 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 01:59:59,279 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 01:59:59,279 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 01:59:59,283 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 01:59:59,286 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 01:59:59,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 01:59:59,290 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 01:59:59,292 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 01:59:59,294 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 01:59:59,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 01:59:59,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 01:59:59,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 01:59:59,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 01:59:59,307 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 01:59:59,309 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 01:59:59,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 01:59:59,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 01:59:59,312 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 01:59:59,314 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 01:59:59,315 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 01:59:59,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 01:59:59,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 01:59:59,318 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 01:59:59,319 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 01:59:59,321 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 01:59:59,321 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 01:59:59,322 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 01:59:59,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 01:59:59,322 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 01:59:59,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 01:59:59,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 01:59:59,329 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-19 01:59:59,347 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 01:59:59,347 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 01:59:59,349 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 01:59:59,349 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 01:59:59,349 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 01:59:59,349 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 01:59:59,350 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 01:59:59,350 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 01:59:59,350 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 01:59:59,350 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 01:59:59,350 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 01:59:59,351 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 01:59:59,351 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 01:59:59,351 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 01:59:59,351 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 01:59:59,352 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 01:59:59,352 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 01:59:59,352 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 01:59:59,352 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 01:59:59,352 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 01:59:59,353 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 01:59:59,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 01:59:59,353 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 01:59:59,353 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 01:59:59,353 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 01:59:59,354 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 01:59:59,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 01:59:59,354 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 01:59:59,354 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 01:59:59,354 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 01:59:59,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 01:59:59,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 01:59:59,646 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 01:59:59,648 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 01:59:59,648 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 01:59:59,649 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_pso.oepc.i [2019-12-19 01:59:59,712 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64acb2a9e/218a6fac14864964b3b3f0426912d616/FLAG20e682930 [2019-12-19 02:00:00,285 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 02:00:00,286 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_pso.oepc.i [2019-12-19 02:00:00,302 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64acb2a9e/218a6fac14864964b3b3f0426912d616/FLAG20e682930 [2019-12-19 02:00:00,554 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64acb2a9e/218a6fac14864964b3b3f0426912d616 [2019-12-19 02:00:00,563 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 02:00:00,564 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 02:00:00,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 02:00:00,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 02:00:00,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 02:00:00,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:00:00" (1/1) ... [2019-12-19 02:00:00,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f57d0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:00, skipping insertion in model container [2019-12-19 02:00:00,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:00:00" (1/1) ... [2019-12-19 02:00:00,582 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 02:00:00,651 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 02:00:01,228 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 02:00:01,241 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 02:00:01,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 02:00:01,381 INFO L208 MainTranslator]: Completed translation [2019-12-19 02:00:01,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:01 WrapperNode [2019-12-19 02:00:01,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 02:00:01,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 02:00:01,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 02:00:01,383 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 02:00:01,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:01" (1/1) ... [2019-12-19 02:00:01,413 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:01" (1/1) ... [2019-12-19 02:00:01,447 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 02:00:01,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 02:00:01,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 02:00:01,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 02:00:01,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:01" (1/1) ... [2019-12-19 02:00:01,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:01" (1/1) ... [2019-12-19 02:00:01,462 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:01" (1/1) ... [2019-12-19 02:00:01,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:01" (1/1) ... [2019-12-19 02:00:01,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:01" (1/1) ... [2019-12-19 02:00:01,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:01" (1/1) ... [2019-12-19 02:00:01,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:01" (1/1) ... [2019-12-19 02:00:01,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 02:00:01,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 02:00:01,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 02:00:01,491 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 02:00:01,492 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:01" (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 02:00:01,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 02:00:01,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 02:00:01,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 02:00:01,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 02:00:01,555 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 02:00:01,556 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 02:00:01,556 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 02:00:01,556 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 02:00:01,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 02:00:01,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 02:00:01,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 02:00:01,558 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 02:00:02,267 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 02:00:02,267 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 02:00:02,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:00:02 BoogieIcfgContainer [2019-12-19 02:00:02,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 02:00:02,270 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 02:00:02,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 02:00:02,274 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 02:00:02,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 02:00:00" (1/3) ... [2019-12-19 02:00:02,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277e25e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:00:02, skipping insertion in model container [2019-12-19 02:00:02,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:00:01" (2/3) ... [2019-12-19 02:00:02,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277e25e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:00:02, skipping insertion in model container [2019-12-19 02:00:02,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:00:02" (3/3) ... [2019-12-19 02:00:02,278 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_pso.oepc.i [2019-12-19 02:00:02,289 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 02:00:02,289 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 02:00:02,298 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 02:00:02,299 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 02:00:02,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,340 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,341 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,341 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,342 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,342 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,342 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,343 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,344 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,345 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,352 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,352 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,403 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,403 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,403 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,413 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,416 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:00:02,433 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 02:00:02,456 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 02:00:02,456 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 02:00:02,456 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 02:00:02,456 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 02:00:02,457 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 02:00:02,457 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 02:00:02,457 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 02:00:02,457 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 02:00:02,479 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 151 places, 185 transitions [2019-12-19 02:00:04,727 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32595 states. [2019-12-19 02:00:04,729 INFO L276 IsEmpty]: Start isEmpty. Operand 32595 states. [2019-12-19 02:00:04,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-19 02:00:04,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:04,739 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] [2019-12-19 02:00:04,740 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:04,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:04,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1631155360, now seen corresponding path program 1 times [2019-12-19 02:00:04,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:04,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956104703] [2019-12-19 02:00:04,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:05,068 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 02:00:05,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956104703] [2019-12-19 02:00:05,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:05,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:00:05,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794868442] [2019-12-19 02:00:05,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:00:05,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:05,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:00:05,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:00:05,096 INFO L87 Difference]: Start difference. First operand 32595 states. Second operand 4 states. [2019-12-19 02:00:05,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:05,863 INFO L93 Difference]: Finished difference Result 33595 states and 129572 transitions. [2019-12-19 02:00:05,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:00:05,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-12-19 02:00:05,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:06,141 INFO L225 Difference]: With dead ends: 33595 [2019-12-19 02:00:06,142 INFO L226 Difference]: Without dead ends: 25707 [2019-12-19 02:00:06,143 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 02:00:06,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25707 states. [2019-12-19 02:00:08,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25707 to 25707. [2019-12-19 02:00:08,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25707 states. [2019-12-19 02:00:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25707 states to 25707 states and 99588 transitions. [2019-12-19 02:00:08,737 INFO L78 Accepts]: Start accepts. Automaton has 25707 states and 99588 transitions. Word has length 38 [2019-12-19 02:00:08,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:08,738 INFO L462 AbstractCegarLoop]: Abstraction has 25707 states and 99588 transitions. [2019-12-19 02:00:08,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:00:08,738 INFO L276 IsEmpty]: Start isEmpty. Operand 25707 states and 99588 transitions. [2019-12-19 02:00:08,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-19 02:00:08,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:08,757 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:08,758 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:08,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:08,758 INFO L82 PathProgramCache]: Analyzing trace with hash 475633161, now seen corresponding path program 1 times [2019-12-19 02:00:08,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:08,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213465628] [2019-12-19 02:00:08,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:08,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:00:08,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213465628] [2019-12-19 02:00:08,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:08,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:00:08,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579231654] [2019-12-19 02:00:08,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:00:08,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:08,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:00:08,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:00:08,968 INFO L87 Difference]: Start difference. First operand 25707 states and 99588 transitions. Second operand 5 states. [2019-12-19 02:00:11,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:11,460 INFO L93 Difference]: Finished difference Result 41085 states and 150435 transitions. [2019-12-19 02:00:11,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:00:11,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-12-19 02:00:11,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:11,668 INFO L225 Difference]: With dead ends: 41085 [2019-12-19 02:00:11,669 INFO L226 Difference]: Without dead ends: 40549 [2019-12-19 02:00:11,670 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 02:00:11,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40549 states. [2019-12-19 02:00:12,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40549 to 38929. [2019-12-19 02:00:12,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38929 states. [2019-12-19 02:00:13,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38929 states to 38929 states and 143585 transitions. [2019-12-19 02:00:13,197 INFO L78 Accepts]: Start accepts. Automaton has 38929 states and 143585 transitions. Word has length 50 [2019-12-19 02:00:13,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:13,200 INFO L462 AbstractCegarLoop]: Abstraction has 38929 states and 143585 transitions. [2019-12-19 02:00:13,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:00:13,201 INFO L276 IsEmpty]: Start isEmpty. Operand 38929 states and 143585 transitions. [2019-12-19 02:00:13,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-19 02:00:13,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:13,214 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:13,215 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:13,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:13,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1647317549, now seen corresponding path program 1 times [2019-12-19 02:00:13,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:13,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920908420] [2019-12-19 02:00:13,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:13,387 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 02:00:13,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920908420] [2019-12-19 02:00:13,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:13,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:00:13,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102602637] [2019-12-19 02:00:13,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:00:13,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:13,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:00:13,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:00:13,391 INFO L87 Difference]: Start difference. First operand 38929 states and 143585 transitions. Second operand 5 states. [2019-12-19 02:00:14,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:14,311 INFO L93 Difference]: Finished difference Result 49782 states and 180637 transitions. [2019-12-19 02:00:14,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:00:14,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-19 02:00:14,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:14,544 INFO L225 Difference]: With dead ends: 49782 [2019-12-19 02:00:14,544 INFO L226 Difference]: Without dead ends: 49278 [2019-12-19 02:00:14,545 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 02:00:14,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49278 states. [2019-12-19 02:00:17,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49278 to 42681. [2019-12-19 02:00:17,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42681 states. [2019-12-19 02:00:17,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42681 states to 42681 states and 156596 transitions. [2019-12-19 02:00:17,457 INFO L78 Accepts]: Start accepts. Automaton has 42681 states and 156596 transitions. Word has length 51 [2019-12-19 02:00:17,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:17,458 INFO L462 AbstractCegarLoop]: Abstraction has 42681 states and 156596 transitions. [2019-12-19 02:00:17,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:00:17,458 INFO L276 IsEmpty]: Start isEmpty. Operand 42681 states and 156596 transitions. [2019-12-19 02:00:17,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-19 02:00:17,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:17,469 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 02:00:17,469 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:17,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:17,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1552968967, now seen corresponding path program 1 times [2019-12-19 02:00:17,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:17,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085773254] [2019-12-19 02:00:17,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:17,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:00:17,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085773254] [2019-12-19 02:00:17,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:17,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:00:17,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320845139] [2019-12-19 02:00:17,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:00:17,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:17,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:00:17,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:00:17,525 INFO L87 Difference]: Start difference. First operand 42681 states and 156596 transitions. Second operand 3 states. [2019-12-19 02:00:18,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:18,142 INFO L93 Difference]: Finished difference Result 61091 states and 221434 transitions. [2019-12-19 02:00:18,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:00:18,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-19 02:00:18,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:18,344 INFO L225 Difference]: With dead ends: 61091 [2019-12-19 02:00:18,345 INFO L226 Difference]: Without dead ends: 61091 [2019-12-19 02:00:18,345 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 02:00:18,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61091 states. [2019-12-19 02:00:21,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61091 to 48020. [2019-12-19 02:00:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48020 states. [2019-12-19 02:00:21,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48020 states to 48020 states and 174183 transitions. [2019-12-19 02:00:21,324 INFO L78 Accepts]: Start accepts. Automaton has 48020 states and 174183 transitions. Word has length 53 [2019-12-19 02:00:21,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:21,325 INFO L462 AbstractCegarLoop]: Abstraction has 48020 states and 174183 transitions. [2019-12-19 02:00:21,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:00:21,325 INFO L276 IsEmpty]: Start isEmpty. Operand 48020 states and 174183 transitions. [2019-12-19 02:00:21,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-19 02:00:21,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:21,341 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:21,341 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:21,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:21,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1347337287, now seen corresponding path program 1 times [2019-12-19 02:00:21,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:21,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295384750] [2019-12-19 02:00:21,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:21,492 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 02:00:21,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295384750] [2019-12-19 02:00:21,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:21,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:00:21,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16910632] [2019-12-19 02:00:21,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:00:21,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:21,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:00:21,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:00:21,495 INFO L87 Difference]: Start difference. First operand 48020 states and 174183 transitions. Second operand 6 states. [2019-12-19 02:00:22,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:22,810 INFO L93 Difference]: Finished difference Result 63760 states and 229383 transitions. [2019-12-19 02:00:22,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:00:22,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-19 02:00:22,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:23,009 INFO L225 Difference]: With dead ends: 63760 [2019-12-19 02:00:23,009 INFO L226 Difference]: Without dead ends: 63760 [2019-12-19 02:00:23,009 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 02:00:23,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63760 states. [2019-12-19 02:00:26,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63760 to 59953. [2019-12-19 02:00:26,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59953 states. [2019-12-19 02:00:26,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59953 states to 59953 states and 215676 transitions. [2019-12-19 02:00:26,180 INFO L78 Accepts]: Start accepts. Automaton has 59953 states and 215676 transitions. Word has length 57 [2019-12-19 02:00:26,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:26,180 INFO L462 AbstractCegarLoop]: Abstraction has 59953 states and 215676 transitions. [2019-12-19 02:00:26,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:00:26,180 INFO L276 IsEmpty]: Start isEmpty. Operand 59953 states and 215676 transitions. [2019-12-19 02:00:26,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-19 02:00:26,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:26,199 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:26,199 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:26,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:26,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1150678650, now seen corresponding path program 1 times [2019-12-19 02:00:26,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:26,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438346855] [2019-12-19 02:00:26,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:26,311 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 02:00:26,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438346855] [2019-12-19 02:00:26,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:26,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:00:26,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756055945] [2019-12-19 02:00:26,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:00:26,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:26,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:00:26,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:00:26,315 INFO L87 Difference]: Start difference. First operand 59953 states and 215676 transitions. Second operand 7 states. [2019-12-19 02:00:27,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:27,651 INFO L93 Difference]: Finished difference Result 83689 states and 290101 transitions. [2019-12-19 02:00:27,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 02:00:27,652 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-19 02:00:27,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:28,372 INFO L225 Difference]: With dead ends: 83689 [2019-12-19 02:00:28,372 INFO L226 Difference]: Without dead ends: 83689 [2019-12-19 02:00:28,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 02:00:28,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83689 states. [2019-12-19 02:00:32,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83689 to 71016. [2019-12-19 02:00:32,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71016 states. [2019-12-19 02:00:32,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71016 states to 71016 states and 249890 transitions. [2019-12-19 02:00:32,395 INFO L78 Accepts]: Start accepts. Automaton has 71016 states and 249890 transitions. Word has length 57 [2019-12-19 02:00:32,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:32,396 INFO L462 AbstractCegarLoop]: Abstraction has 71016 states and 249890 transitions. [2019-12-19 02:00:32,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:00:32,396 INFO L276 IsEmpty]: Start isEmpty. Operand 71016 states and 249890 transitions. [2019-12-19 02:00:32,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-19 02:00:32,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:32,411 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:32,411 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:32,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:32,411 INFO L82 PathProgramCache]: Analyzing trace with hash 2038182331, now seen corresponding path program 1 times [2019-12-19 02:00:32,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:32,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237013476] [2019-12-19 02:00:32,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:32,462 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 02:00:32,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237013476] [2019-12-19 02:00:32,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:32,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:00:32,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291378250] [2019-12-19 02:00:32,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:00:32,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:32,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:00:32,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:00:32,465 INFO L87 Difference]: Start difference. First operand 71016 states and 249890 transitions. Second operand 3 states. [2019-12-19 02:00:32,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:32,835 INFO L93 Difference]: Finished difference Result 54025 states and 188922 transitions. [2019-12-19 02:00:32,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:00:32,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-19 02:00:32,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:33,017 INFO L225 Difference]: With dead ends: 54025 [2019-12-19 02:00:33,017 INFO L226 Difference]: Without dead ends: 54025 [2019-12-19 02:00:33,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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 02:00:33,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54025 states. [2019-12-19 02:00:34,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54025 to 53410. [2019-12-19 02:00:34,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53410 states. [2019-12-19 02:00:34,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53410 states to 53410 states and 187041 transitions. [2019-12-19 02:00:34,478 INFO L78 Accepts]: Start accepts. Automaton has 53410 states and 187041 transitions. Word has length 57 [2019-12-19 02:00:34,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:34,479 INFO L462 AbstractCegarLoop]: Abstraction has 53410 states and 187041 transitions. [2019-12-19 02:00:34,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:00:34,479 INFO L276 IsEmpty]: Start isEmpty. Operand 53410 states and 187041 transitions. [2019-12-19 02:00:34,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-19 02:00:34,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:34,488 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:34,489 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:34,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:34,489 INFO L82 PathProgramCache]: Analyzing trace with hash -565356220, now seen corresponding path program 1 times [2019-12-19 02:00:34,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:34,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929838621] [2019-12-19 02:00:34,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:34,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:00:34,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929838621] [2019-12-19 02:00:34,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:34,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:00:34,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608135470] [2019-12-19 02:00:34,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:00:34,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:34,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:00:34,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:00:34,568 INFO L87 Difference]: Start difference. First operand 53410 states and 187041 transitions. Second operand 6 states. [2019-12-19 02:00:35,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:35,354 INFO L93 Difference]: Finished difference Result 68650 states and 237305 transitions. [2019-12-19 02:00:35,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 02:00:35,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-19 02:00:35,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:35,524 INFO L225 Difference]: With dead ends: 68650 [2019-12-19 02:00:35,525 INFO L226 Difference]: Without dead ends: 68082 [2019-12-19 02:00:35,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-19 02:00:35,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68082 states. [2019-12-19 02:00:37,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68082 to 53494. [2019-12-19 02:00:37,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53494 states. [2019-12-19 02:00:37,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53494 states to 53494 states and 187738 transitions. [2019-12-19 02:00:37,292 INFO L78 Accepts]: Start accepts. Automaton has 53494 states and 187738 transitions. Word has length 57 [2019-12-19 02:00:37,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:37,292 INFO L462 AbstractCegarLoop]: Abstraction has 53494 states and 187738 transitions. [2019-12-19 02:00:37,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:00:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 53494 states and 187738 transitions. [2019-12-19 02:00:37,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-19 02:00:37,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:37,302 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] [2019-12-19 02:00:37,303 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:37,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:37,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1699947683, now seen corresponding path program 1 times [2019-12-19 02:00:37,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:37,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004336727] [2019-12-19 02:00:37,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:37,403 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 02:00:37,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004336727] [2019-12-19 02:00:37,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:37,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:00:37,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762125729] [2019-12-19 02:00:37,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:00:37,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:37,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:00:37,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:00:37,405 INFO L87 Difference]: Start difference. First operand 53494 states and 187738 transitions. Second operand 6 states. [2019-12-19 02:00:38,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:38,307 INFO L93 Difference]: Finished difference Result 67853 states and 231364 transitions. [2019-12-19 02:00:38,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:00:38,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-19 02:00:38,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:38,439 INFO L225 Difference]: With dead ends: 67853 [2019-12-19 02:00:38,439 INFO L226 Difference]: Without dead ends: 67853 [2019-12-19 02:00:38,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:00:41,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67853 states. [2019-12-19 02:00:41,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67853 to 59085. [2019-12-19 02:00:41,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59085 states. [2019-12-19 02:00:41,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59085 states to 59085 states and 204134 transitions. [2019-12-19 02:00:41,957 INFO L78 Accepts]: Start accepts. Automaton has 59085 states and 204134 transitions. Word has length 58 [2019-12-19 02:00:41,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:41,957 INFO L462 AbstractCegarLoop]: Abstraction has 59085 states and 204134 transitions. [2019-12-19 02:00:41,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:00:41,957 INFO L276 IsEmpty]: Start isEmpty. Operand 59085 states and 204134 transitions. [2019-12-19 02:00:41,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-19 02:00:41,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:41,967 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] [2019-12-19 02:00:41,967 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:41,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:41,967 INFO L82 PathProgramCache]: Analyzing trace with hash -812444002, now seen corresponding path program 1 times [2019-12-19 02:00:41,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:41,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177447931] [2019-12-19 02:00:41,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:42,060 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 02:00:42,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177447931] [2019-12-19 02:00:42,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:42,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:00:42,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661044599] [2019-12-19 02:00:42,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:00:42,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:42,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:00:42,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:00:42,063 INFO L87 Difference]: Start difference. First operand 59085 states and 204134 transitions. Second operand 4 states. [2019-12-19 02:00:42,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:42,117 INFO L93 Difference]: Finished difference Result 10216 states and 31250 transitions. [2019-12-19 02:00:42,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:00:42,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-19 02:00:42,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:42,129 INFO L225 Difference]: With dead ends: 10216 [2019-12-19 02:00:42,129 INFO L226 Difference]: Without dead ends: 8511 [2019-12-19 02:00:42,129 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 02:00:42,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8511 states. [2019-12-19 02:00:42,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8511 to 8463. [2019-12-19 02:00:42,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8463 states. [2019-12-19 02:00:42,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8463 states to 8463 states and 25329 transitions. [2019-12-19 02:00:42,228 INFO L78 Accepts]: Start accepts. Automaton has 8463 states and 25329 transitions. Word has length 58 [2019-12-19 02:00:42,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:42,229 INFO L462 AbstractCegarLoop]: Abstraction has 8463 states and 25329 transitions. [2019-12-19 02:00:42,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:00:42,229 INFO L276 IsEmpty]: Start isEmpty. Operand 8463 states and 25329 transitions. [2019-12-19 02:00:42,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 02:00:42,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:42,238 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 02:00:42,238 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:42,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:42,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1292079072, now seen corresponding path program 1 times [2019-12-19 02:00:42,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:42,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057899530] [2019-12-19 02:00:42,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:42,316 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 02:00:42,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057899530] [2019-12-19 02:00:42,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:42,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:00:42,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997052846] [2019-12-19 02:00:42,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:00:42,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:42,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:00:42,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:00:42,318 INFO L87 Difference]: Start difference. First operand 8463 states and 25329 transitions. Second operand 4 states. [2019-12-19 02:00:42,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:42,432 INFO L93 Difference]: Finished difference Result 9710 states and 29108 transitions. [2019-12-19 02:00:42,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:00:42,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-19 02:00:42,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:42,445 INFO L225 Difference]: With dead ends: 9710 [2019-12-19 02:00:42,445 INFO L226 Difference]: Without dead ends: 9710 [2019-12-19 02:00:42,446 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 02:00:42,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9710 states. [2019-12-19 02:00:42,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9710 to 8883. [2019-12-19 02:00:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8883 states. [2019-12-19 02:00:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8883 states to 8883 states and 26592 transitions. [2019-12-19 02:00:42,977 INFO L78 Accepts]: Start accepts. Automaton has 8883 states and 26592 transitions. Word has length 65 [2019-12-19 02:00:42,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:42,977 INFO L462 AbstractCegarLoop]: Abstraction has 8883 states and 26592 transitions. [2019-12-19 02:00:42,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:00:42,978 INFO L276 IsEmpty]: Start isEmpty. Operand 8883 states and 26592 transitions. [2019-12-19 02:00:42,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 02:00:42,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:42,981 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 02:00:42,981 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:42,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:42,981 INFO L82 PathProgramCache]: Analyzing trace with hash 450731263, now seen corresponding path program 1 times [2019-12-19 02:00:42,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:42,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240966369] [2019-12-19 02:00:42,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:43,046 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 02:00:43,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240966369] [2019-12-19 02:00:43,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:43,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:00:43,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150114581] [2019-12-19 02:00:43,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:00:43,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:43,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:00:43,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:00:43,048 INFO L87 Difference]: Start difference. First operand 8883 states and 26592 transitions. Second operand 6 states. [2019-12-19 02:00:43,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:43,470 INFO L93 Difference]: Finished difference Result 11199 states and 33079 transitions. [2019-12-19 02:00:43,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 02:00:43,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-19 02:00:43,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:43,491 INFO L225 Difference]: With dead ends: 11199 [2019-12-19 02:00:43,491 INFO L226 Difference]: Without dead ends: 11138 [2019-12-19 02:00:43,492 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 02:00:43,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11138 states. [2019-12-19 02:00:43,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11138 to 10414. [2019-12-19 02:00:43,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10414 states. [2019-12-19 02:00:43,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10414 states to 10414 states and 30946 transitions. [2019-12-19 02:00:43,645 INFO L78 Accepts]: Start accepts. Automaton has 10414 states and 30946 transitions. Word has length 65 [2019-12-19 02:00:43,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:43,645 INFO L462 AbstractCegarLoop]: Abstraction has 10414 states and 30946 transitions. [2019-12-19 02:00:43,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:00:43,645 INFO L276 IsEmpty]: Start isEmpty. Operand 10414 states and 30946 transitions. [2019-12-19 02:00:43,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:00:43,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:43,650 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:43,650 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:43,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:43,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1715256149, now seen corresponding path program 1 times [2019-12-19 02:00:43,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:43,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551159149] [2019-12-19 02:00:43,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:43,701 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 02:00:43,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551159149] [2019-12-19 02:00:43,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:43,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:00:43,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053976933] [2019-12-19 02:00:43,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:00:43,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:43,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:00:43,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:00:43,703 INFO L87 Difference]: Start difference. First operand 10414 states and 30946 transitions. Second operand 4 states. [2019-12-19 02:00:43,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:43,988 INFO L93 Difference]: Finished difference Result 13387 states and 39337 transitions. [2019-12-19 02:00:43,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:00:43,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-19 02:00:43,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:44,015 INFO L225 Difference]: With dead ends: 13387 [2019-12-19 02:00:44,015 INFO L226 Difference]: Without dead ends: 13387 [2019-12-19 02:00:44,016 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 02:00:44,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13387 states. [2019-12-19 02:00:44,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13387 to 11728. [2019-12-19 02:00:44,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11728 states. [2019-12-19 02:00:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11728 states to 11728 states and 34581 transitions. [2019-12-19 02:00:44,186 INFO L78 Accepts]: Start accepts. Automaton has 11728 states and 34581 transitions. Word has length 71 [2019-12-19 02:00:44,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:44,187 INFO L462 AbstractCegarLoop]: Abstraction has 11728 states and 34581 transitions. [2019-12-19 02:00:44,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:00:44,187 INFO L276 IsEmpty]: Start isEmpty. Operand 11728 states and 34581 transitions. [2019-12-19 02:00:44,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:00:44,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:44,196 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:44,196 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:44,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:44,196 INFO L82 PathProgramCache]: Analyzing trace with hash -470491668, now seen corresponding path program 1 times [2019-12-19 02:00:44,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:44,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775868835] [2019-12-19 02:00:44,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:44,306 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 02:00:44,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775868835] [2019-12-19 02:00:44,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:44,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:00:44,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663323005] [2019-12-19 02:00:44,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:00:44,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:44,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:00:44,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:00:44,309 INFO L87 Difference]: Start difference. First operand 11728 states and 34581 transitions. Second operand 6 states. [2019-12-19 02:00:44,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:44,850 INFO L93 Difference]: Finished difference Result 12877 states and 37338 transitions. [2019-12-19 02:00:44,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:00:44,850 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-19 02:00:44,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:44,866 INFO L225 Difference]: With dead ends: 12877 [2019-12-19 02:00:44,867 INFO L226 Difference]: Without dead ends: 12877 [2019-12-19 02:00:44,867 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 02:00:44,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12877 states. [2019-12-19 02:00:44,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12877 to 12577. [2019-12-19 02:00:44,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12577 states. [2019-12-19 02:00:45,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12577 states to 12577 states and 36580 transitions. [2019-12-19 02:00:45,014 INFO L78 Accepts]: Start accepts. Automaton has 12577 states and 36580 transitions. Word has length 71 [2019-12-19 02:00:45,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:45,015 INFO L462 AbstractCegarLoop]: Abstraction has 12577 states and 36580 transitions. [2019-12-19 02:00:45,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:00:45,015 INFO L276 IsEmpty]: Start isEmpty. Operand 12577 states and 36580 transitions. [2019-12-19 02:00:45,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:00:45,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:45,022 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:45,022 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:45,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:45,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1747266285, now seen corresponding path program 1 times [2019-12-19 02:00:45,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:45,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232936168] [2019-12-19 02:00:45,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:45,122 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 02:00:45,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232936168] [2019-12-19 02:00:45,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:45,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:00:45,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019312623] [2019-12-19 02:00:45,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:00:45,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:45,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:00:45,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:00:45,124 INFO L87 Difference]: Start difference. First operand 12577 states and 36580 transitions. Second operand 6 states. [2019-12-19 02:00:45,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:45,589 INFO L93 Difference]: Finished difference Result 14466 states and 40828 transitions. [2019-12-19 02:00:45,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:00:45,594 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-19 02:00:45,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:45,612 INFO L225 Difference]: With dead ends: 14466 [2019-12-19 02:00:45,612 INFO L226 Difference]: Without dead ends: 14466 [2019-12-19 02:00:45,613 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 02:00:45,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14466 states. [2019-12-19 02:00:45,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14466 to 13140. [2019-12-19 02:00:45,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13140 states. [2019-12-19 02:00:45,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13140 states to 13140 states and 37549 transitions. [2019-12-19 02:00:45,774 INFO L78 Accepts]: Start accepts. Automaton has 13140 states and 37549 transitions. Word has length 71 [2019-12-19 02:00:45,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:45,775 INFO L462 AbstractCegarLoop]: Abstraction has 13140 states and 37549 transitions. [2019-12-19 02:00:45,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:00:45,775 INFO L276 IsEmpty]: Start isEmpty. Operand 13140 states and 37549 transitions. [2019-12-19 02:00:45,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:00:45,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:45,783 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:45,783 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:45,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:45,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1958617198, now seen corresponding path program 1 times [2019-12-19 02:00:45,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:45,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826369891] [2019-12-19 02:00:45,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:45,854 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 02:00:45,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826369891] [2019-12-19 02:00:45,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:45,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:00:45,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205343867] [2019-12-19 02:00:45,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:00:45,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:45,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:00:45,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:00:45,856 INFO L87 Difference]: Start difference. First operand 13140 states and 37549 transitions. Second operand 5 states. [2019-12-19 02:00:46,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:46,625 INFO L93 Difference]: Finished difference Result 16966 states and 48261 transitions. [2019-12-19 02:00:46,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:00:46,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-19 02:00:46,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:46,646 INFO L225 Difference]: With dead ends: 16966 [2019-12-19 02:00:46,647 INFO L226 Difference]: Without dead ends: 16966 [2019-12-19 02:00:46,647 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 02:00:46,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16966 states. [2019-12-19 02:00:46,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16966 to 15670. [2019-12-19 02:00:46,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15670 states. [2019-12-19 02:00:46,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15670 states to 15670 states and 44446 transitions. [2019-12-19 02:00:46,835 INFO L78 Accepts]: Start accepts. Automaton has 15670 states and 44446 transitions. Word has length 71 [2019-12-19 02:00:46,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:46,835 INFO L462 AbstractCegarLoop]: Abstraction has 15670 states and 44446 transitions. [2019-12-19 02:00:46,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:00:46,836 INFO L276 IsEmpty]: Start isEmpty. Operand 15670 states and 44446 transitions. [2019-12-19 02:00:46,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:00:46,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:46,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:46,844 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:46,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:46,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1448083021, now seen corresponding path program 1 times [2019-12-19 02:00:46,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:46,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792529875] [2019-12-19 02:00:46,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:46,925 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 02:00:46,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792529875] [2019-12-19 02:00:46,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:46,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:00:46,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447196651] [2019-12-19 02:00:46,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:00:46,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:46,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:00:46,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:00:46,928 INFO L87 Difference]: Start difference. First operand 15670 states and 44446 transitions. Second operand 5 states. [2019-12-19 02:00:46,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:46,983 INFO L93 Difference]: Finished difference Result 5950 states and 14074 transitions. [2019-12-19 02:00:46,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:00:46,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-19 02:00:46,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:46,990 INFO L225 Difference]: With dead ends: 5950 [2019-12-19 02:00:46,991 INFO L226 Difference]: Without dead ends: 5104 [2019-12-19 02:00:46,991 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 02:00:47,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5104 states. [2019-12-19 02:00:47,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5104 to 4679. [2019-12-19 02:00:47,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4679 states. [2019-12-19 02:00:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4679 states to 4679 states and 10722 transitions. [2019-12-19 02:00:47,059 INFO L78 Accepts]: Start accepts. Automaton has 4679 states and 10722 transitions. Word has length 71 [2019-12-19 02:00:47,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:47,060 INFO L462 AbstractCegarLoop]: Abstraction has 4679 states and 10722 transitions. [2019-12-19 02:00:47,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:00:47,060 INFO L276 IsEmpty]: Start isEmpty. Operand 4679 states and 10722 transitions. [2019-12-19 02:00:47,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-19 02:00:47,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:47,066 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:47,066 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:47,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:47,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1679970640, now seen corresponding path program 1 times [2019-12-19 02:00:47,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:47,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231890607] [2019-12-19 02:00:47,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:47,107 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 02:00:47,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231890607] [2019-12-19 02:00:47,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:47,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:00:47,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381850662] [2019-12-19 02:00:47,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:00:47,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:47,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:00:47,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:00:47,109 INFO L87 Difference]: Start difference. First operand 4679 states and 10722 transitions. Second operand 3 states. [2019-12-19 02:00:47,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:47,144 INFO L93 Difference]: Finished difference Result 5750 states and 12968 transitions. [2019-12-19 02:00:47,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:00:47,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-19 02:00:47,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:47,150 INFO L225 Difference]: With dead ends: 5750 [2019-12-19 02:00:47,150 INFO L226 Difference]: Without dead ends: 5750 [2019-12-19 02:00:47,150 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 02:00:47,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5750 states. [2019-12-19 02:00:47,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5750 to 4614. [2019-12-19 02:00:47,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4614 states. [2019-12-19 02:00:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4614 states to 4614 states and 10284 transitions. [2019-12-19 02:00:47,197 INFO L78 Accepts]: Start accepts. Automaton has 4614 states and 10284 transitions. Word has length 71 [2019-12-19 02:00:47,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:47,198 INFO L462 AbstractCegarLoop]: Abstraction has 4614 states and 10284 transitions. [2019-12-19 02:00:47,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:00:47,198 INFO L276 IsEmpty]: Start isEmpty. Operand 4614 states and 10284 transitions. [2019-12-19 02:00:47,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-19 02:00:47,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:47,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:47,202 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:47,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:47,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1543631293, now seen corresponding path program 1 times [2019-12-19 02:00:47,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:47,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111162234] [2019-12-19 02:00:47,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:47,286 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 02:00:47,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111162234] [2019-12-19 02:00:47,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:47,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:00:47,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166932309] [2019-12-19 02:00:47,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:00:47,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:47,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:00:47,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:00:47,289 INFO L87 Difference]: Start difference. First operand 4614 states and 10284 transitions. Second operand 5 states. [2019-12-19 02:00:47,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:47,482 INFO L93 Difference]: Finished difference Result 5685 states and 12732 transitions. [2019-12-19 02:00:47,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:00:47,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-12-19 02:00:47,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:47,490 INFO L225 Difference]: With dead ends: 5685 [2019-12-19 02:00:47,490 INFO L226 Difference]: Without dead ends: 5685 [2019-12-19 02:00:47,490 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 02:00:47,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5685 states. [2019-12-19 02:00:47,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5685 to 5034. [2019-12-19 02:00:47,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5034 states. [2019-12-19 02:00:47,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5034 states to 5034 states and 11242 transitions. [2019-12-19 02:00:47,549 INFO L78 Accepts]: Start accepts. Automaton has 5034 states and 11242 transitions. Word has length 77 [2019-12-19 02:00:47,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:47,549 INFO L462 AbstractCegarLoop]: Abstraction has 5034 states and 11242 transitions. [2019-12-19 02:00:47,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:00:47,550 INFO L276 IsEmpty]: Start isEmpty. Operand 5034 states and 11242 transitions. [2019-12-19 02:00:47,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-19 02:00:47,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:47,554 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] [2019-12-19 02:00:47,555 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:47,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:47,555 INFO L82 PathProgramCache]: Analyzing trace with hash 199179042, now seen corresponding path program 1 times [2019-12-19 02:00:47,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:47,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524452553] [2019-12-19 02:00:47,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:47,619 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 02:00:47,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524452553] [2019-12-19 02:00:47,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:47,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:00:47,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024999846] [2019-12-19 02:00:47,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:00:47,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:47,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:00:47,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:00:47,621 INFO L87 Difference]: Start difference. First operand 5034 states and 11242 transitions. Second operand 7 states. [2019-12-19 02:00:48,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:48,129 INFO L93 Difference]: Finished difference Result 5920 states and 13093 transitions. [2019-12-19 02:00:48,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 02:00:48,130 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2019-12-19 02:00:48,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:48,137 INFO L225 Difference]: With dead ends: 5920 [2019-12-19 02:00:48,137 INFO L226 Difference]: Without dead ends: 5867 [2019-12-19 02:00:48,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-19 02:00:48,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5867 states. [2019-12-19 02:00:48,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5867 to 5121. [2019-12-19 02:00:48,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5121 states. [2019-12-19 02:00:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5121 states to 5121 states and 11331 transitions. [2019-12-19 02:00:48,190 INFO L78 Accepts]: Start accepts. Automaton has 5121 states and 11331 transitions. Word has length 77 [2019-12-19 02:00:48,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:48,190 INFO L462 AbstractCegarLoop]: Abstraction has 5121 states and 11331 transitions. [2019-12-19 02:00:48,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:00:48,190 INFO L276 IsEmpty]: Start isEmpty. Operand 5121 states and 11331 transitions. [2019-12-19 02:00:48,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:00:48,195 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:48,196 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:48,196 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:48,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:48,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1136101040, now seen corresponding path program 1 times [2019-12-19 02:00:48,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:48,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631076076] [2019-12-19 02:00:48,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:48,259 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 02:00:48,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631076076] [2019-12-19 02:00:48,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:48,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:00:48,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881386166] [2019-12-19 02:00:48,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:00:48,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:48,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:00:48,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:00:48,261 INFO L87 Difference]: Start difference. First operand 5121 states and 11331 transitions. Second operand 5 states. [2019-12-19 02:00:48,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:48,620 INFO L93 Difference]: Finished difference Result 6102 states and 13436 transitions. [2019-12-19 02:00:48,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:00:48,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-12-19 02:00:48,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:48,628 INFO L225 Difference]: With dead ends: 6102 [2019-12-19 02:00:48,628 INFO L226 Difference]: Without dead ends: 6102 [2019-12-19 02:00:48,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:00:48,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6102 states. [2019-12-19 02:00:48,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6102 to 5243. [2019-12-19 02:00:48,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5243 states. [2019-12-19 02:00:48,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5243 states to 5243 states and 11597 transitions. [2019-12-19 02:00:48,681 INFO L78 Accepts]: Start accepts. Automaton has 5243 states and 11597 transitions. Word has length 98 [2019-12-19 02:00:48,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:48,681 INFO L462 AbstractCegarLoop]: Abstraction has 5243 states and 11597 transitions. [2019-12-19 02:00:48,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:00:48,681 INFO L276 IsEmpty]: Start isEmpty. Operand 5243 states and 11597 transitions. [2019-12-19 02:00:48,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:00:48,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:48,686 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:00:48,686 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:48,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:48,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1786986948, now seen corresponding path program 2 times [2019-12-19 02:00:48,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:48,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38995604] [2019-12-19 02:00:48,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:48,808 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 02:00:48,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38995604] [2019-12-19 02:00:48,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:48,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:00:48,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762011373] [2019-12-19 02:00:48,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:00:48,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:48,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:00:48,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:00:48,810 INFO L87 Difference]: Start difference. First operand 5243 states and 11597 transitions. Second operand 7 states. [2019-12-19 02:00:49,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:49,788 INFO L93 Difference]: Finished difference Result 9713 states and 21100 transitions. [2019-12-19 02:00:49,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-19 02:00:49,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-12-19 02:00:49,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:49,799 INFO L225 Difference]: With dead ends: 9713 [2019-12-19 02:00:49,800 INFO L226 Difference]: Without dead ends: 9650 [2019-12-19 02:00:49,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-12-19 02:00:49,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9650 states. [2019-12-19 02:00:49,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9650 to 7743. [2019-12-19 02:00:49,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7743 states. [2019-12-19 02:00:49,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7743 states to 7743 states and 16889 transitions. [2019-12-19 02:00:49,878 INFO L78 Accepts]: Start accepts. Automaton has 7743 states and 16889 transitions. Word has length 98 [2019-12-19 02:00:49,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:49,878 INFO L462 AbstractCegarLoop]: Abstraction has 7743 states and 16889 transitions. [2019-12-19 02:00:49,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:00:49,878 INFO L276 IsEmpty]: Start isEmpty. Operand 7743 states and 16889 transitions. [2019-12-19 02:00:49,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:00:49,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:49,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, 1, 1, 1, 1, 1, 1, 1, 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 02:00:49,885 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:49,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:49,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1755967141, now seen corresponding path program 1 times [2019-12-19 02:00:49,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:49,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946999581] [2019-12-19 02:00:49,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:49,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:00:49,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946999581] [2019-12-19 02:00:49,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:49,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:00:49,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903774496] [2019-12-19 02:00:49,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:00:49,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:49,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:00:49,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:00:49,979 INFO L87 Difference]: Start difference. First operand 7743 states and 16889 transitions. Second operand 7 states. [2019-12-19 02:00:50,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:50,991 INFO L93 Difference]: Finished difference Result 10868 states and 23491 transitions. [2019-12-19 02:00:50,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-19 02:00:50,992 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-12-19 02:00:50,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:51,005 INFO L225 Difference]: With dead ends: 10868 [2019-12-19 02:00:51,005 INFO L226 Difference]: Without dead ends: 10868 [2019-12-19 02:00:51,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-19 02:00:51,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10868 states. [2019-12-19 02:00:51,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10868 to 8506. [2019-12-19 02:00:51,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8506 states. [2019-12-19 02:00:51,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8506 states to 8506 states and 18560 transitions. [2019-12-19 02:00:51,106 INFO L78 Accepts]: Start accepts. Automaton has 8506 states and 18560 transitions. Word has length 98 [2019-12-19 02:00:51,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:51,106 INFO L462 AbstractCegarLoop]: Abstraction has 8506 states and 18560 transitions. [2019-12-19 02:00:51,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:00:51,106 INFO L276 IsEmpty]: Start isEmpty. Operand 8506 states and 18560 transitions. [2019-12-19 02:00:51,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:00:51,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:51,116 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:51,116 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:51,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:51,116 INFO L82 PathProgramCache]: Analyzing trace with hash 500943866, now seen corresponding path program 1 times [2019-12-19 02:00:51,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:51,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161130339] [2019-12-19 02:00:51,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:51,191 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 02:00:51,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161130339] [2019-12-19 02:00:51,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:51,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:00:51,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439853459] [2019-12-19 02:00:51,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:00:51,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:51,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:00:51,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:00:51,193 INFO L87 Difference]: Start difference. First operand 8506 states and 18560 transitions. Second operand 4 states. [2019-12-19 02:00:51,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:51,298 INFO L93 Difference]: Finished difference Result 9006 states and 19535 transitions. [2019-12-19 02:00:51,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:00:51,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-19 02:00:51,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:51,308 INFO L225 Difference]: With dead ends: 9006 [2019-12-19 02:00:51,308 INFO L226 Difference]: Without dead ends: 8910 [2019-12-19 02:00:51,308 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 02:00:51,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8910 states. [2019-12-19 02:00:51,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8910 to 7584. [2019-12-19 02:00:51,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7584 states. [2019-12-19 02:00:51,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7584 states to 7584 states and 16586 transitions. [2019-12-19 02:00:51,387 INFO L78 Accepts]: Start accepts. Automaton has 7584 states and 16586 transitions. Word has length 98 [2019-12-19 02:00:51,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:51,388 INFO L462 AbstractCegarLoop]: Abstraction has 7584 states and 16586 transitions. [2019-12-19 02:00:51,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:00:51,388 INFO L276 IsEmpty]: Start isEmpty. Operand 7584 states and 16586 transitions. [2019-12-19 02:00:51,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:00:51,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:51,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:51,397 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:51,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:51,397 INFO L82 PathProgramCache]: Analyzing trace with hash 2083690408, now seen corresponding path program 1 times [2019-12-19 02:00:51,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:51,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886084144] [2019-12-19 02:00:51,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:51,534 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 02:00:51,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886084144] [2019-12-19 02:00:51,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:51,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:00:51,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812323245] [2019-12-19 02:00:51,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:00:51,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:51,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:00:51,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:00:51,536 INFO L87 Difference]: Start difference. First operand 7584 states and 16586 transitions. Second operand 6 states. [2019-12-19 02:00:51,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:51,835 INFO L93 Difference]: Finished difference Result 8440 states and 18425 transitions. [2019-12-19 02:00:51,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 02:00:51,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-12-19 02:00:51,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:51,845 INFO L225 Difference]: With dead ends: 8440 [2019-12-19 02:00:51,845 INFO L226 Difference]: Without dead ends: 8440 [2019-12-19 02:00:51,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 02:00:51,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8440 states. [2019-12-19 02:00:51,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8440 to 7830. [2019-12-19 02:00:51,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7830 states. [2019-12-19 02:00:51,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7830 states to 7830 states and 17119 transitions. [2019-12-19 02:00:51,922 INFO L78 Accepts]: Start accepts. Automaton has 7830 states and 17119 transitions. Word has length 100 [2019-12-19 02:00:51,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:51,923 INFO L462 AbstractCegarLoop]: Abstraction has 7830 states and 17119 transitions. [2019-12-19 02:00:51,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:00:51,923 INFO L276 IsEmpty]: Start isEmpty. Operand 7830 states and 17119 transitions. [2019-12-19 02:00:51,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:00:51,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:51,930 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:51,930 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:51,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:51,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1573156231, now seen corresponding path program 1 times [2019-12-19 02:00:51,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:51,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295877052] [2019-12-19 02:00:51,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:52,031 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 02:00:52,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295877052] [2019-12-19 02:00:52,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:52,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:00:52,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416490793] [2019-12-19 02:00:52,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:00:52,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:52,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:00:52,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:00:52,033 INFO L87 Difference]: Start difference. First operand 7830 states and 17119 transitions. Second operand 6 states. [2019-12-19 02:00:52,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:52,430 INFO L93 Difference]: Finished difference Result 8475 states and 18437 transitions. [2019-12-19 02:00:52,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:00:52,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-12-19 02:00:52,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:52,445 INFO L225 Difference]: With dead ends: 8475 [2019-12-19 02:00:52,446 INFO L226 Difference]: Without dead ends: 8475 [2019-12-19 02:00:52,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:00:52,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8475 states. [2019-12-19 02:00:52,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8475 to 7702. [2019-12-19 02:00:52,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7702 states. [2019-12-19 02:00:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7702 states to 7702 states and 16888 transitions. [2019-12-19 02:00:52,603 INFO L78 Accepts]: Start accepts. Automaton has 7702 states and 16888 transitions. Word has length 100 [2019-12-19 02:00:52,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:52,604 INFO L462 AbstractCegarLoop]: Abstraction has 7702 states and 16888 transitions. [2019-12-19 02:00:52,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:00:52,604 INFO L276 IsEmpty]: Start isEmpty. Operand 7702 states and 16888 transitions. [2019-12-19 02:00:52,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:00:52,616 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:52,617 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:52,617 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:52,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:52,618 INFO L82 PathProgramCache]: Analyzing trace with hash 326804494, now seen corresponding path program 1 times [2019-12-19 02:00:52,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:52,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988667505] [2019-12-19 02:00:52,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:52,748 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 02:00:52,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988667505] [2019-12-19 02:00:52,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:52,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:00:52,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698490105] [2019-12-19 02:00:52,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:00:52,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:52,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:00:52,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:00:52,751 INFO L87 Difference]: Start difference. First operand 7702 states and 16888 transitions. Second operand 5 states. [2019-12-19 02:00:52,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:52,914 INFO L93 Difference]: Finished difference Result 8501 states and 18629 transitions. [2019-12-19 02:00:52,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:00:52,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-12-19 02:00:52,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:52,929 INFO L225 Difference]: With dead ends: 8501 [2019-12-19 02:00:52,929 INFO L226 Difference]: Without dead ends: 8501 [2019-12-19 02:00:52,930 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 02:00:52,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8501 states. [2019-12-19 02:00:53,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8501 to 6688. [2019-12-19 02:00:53,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6688 states. [2019-12-19 02:00:53,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6688 states to 6688 states and 14659 transitions. [2019-12-19 02:00:53,081 INFO L78 Accepts]: Start accepts. Automaton has 6688 states and 14659 transitions. Word has length 100 [2019-12-19 02:00:53,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:53,082 INFO L462 AbstractCegarLoop]: Abstraction has 6688 states and 14659 transitions. [2019-12-19 02:00:53,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:00:53,082 INFO L276 IsEmpty]: Start isEmpty. Operand 6688 states and 14659 transitions. [2019-12-19 02:00:53,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:00:53,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:53,093 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:53,093 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:53,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:53,095 INFO L82 PathProgramCache]: Analyzing trace with hash 677604431, now seen corresponding path program 1 times [2019-12-19 02:00:53,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:53,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499112874] [2019-12-19 02:00:53,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:53,185 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 02:00:53,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499112874] [2019-12-19 02:00:53,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:53,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:00:53,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559697032] [2019-12-19 02:00:53,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:00:53,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:53,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:00:53,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:00:53,188 INFO L87 Difference]: Start difference. First operand 6688 states and 14659 transitions. Second operand 4 states. [2019-12-19 02:00:53,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:53,536 INFO L93 Difference]: Finished difference Result 7897 states and 17234 transitions. [2019-12-19 02:00:53,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:00:53,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-19 02:00:53,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:53,549 INFO L225 Difference]: With dead ends: 7897 [2019-12-19 02:00:53,549 INFO L226 Difference]: Without dead ends: 7845 [2019-12-19 02:00:53,549 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 02:00:53,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7845 states. [2019-12-19 02:00:53,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7845 to 7207. [2019-12-19 02:00:53,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7207 states. [2019-12-19 02:00:53,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7207 states to 7207 states and 15791 transitions. [2019-12-19 02:00:53,664 INFO L78 Accepts]: Start accepts. Automaton has 7207 states and 15791 transitions. Word has length 100 [2019-12-19 02:00:53,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:53,664 INFO L462 AbstractCegarLoop]: Abstraction has 7207 states and 15791 transitions. [2019-12-19 02:00:53,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:00:53,664 INFO L276 IsEmpty]: Start isEmpty. Operand 7207 states and 15791 transitions. [2019-12-19 02:00:53,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:00:53,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:53,675 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:53,675 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:53,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:53,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1219158415, now seen corresponding path program 1 times [2019-12-19 02:00:53,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:53,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590210225] [2019-12-19 02:00:53,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:53,816 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 02:00:53,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590210225] [2019-12-19 02:00:53,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:53,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:00:53,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559764188] [2019-12-19 02:00:53,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:00:53,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:53,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:00:53,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:00:53,819 INFO L87 Difference]: Start difference. First operand 7207 states and 15791 transitions. Second operand 7 states. [2019-12-19 02:00:54,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:54,362 INFO L93 Difference]: Finished difference Result 9044 states and 19806 transitions. [2019-12-19 02:00:54,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-19 02:00:54,363 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-12-19 02:00:54,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:54,375 INFO L225 Difference]: With dead ends: 9044 [2019-12-19 02:00:54,375 INFO L226 Difference]: Without dead ends: 9044 [2019-12-19 02:00:54,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-19 02:00:54,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9044 states. [2019-12-19 02:00:54,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9044 to 7760. [2019-12-19 02:00:54,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7760 states. [2019-12-19 02:00:54,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7760 states to 7760 states and 17119 transitions. [2019-12-19 02:00:54,493 INFO L78 Accepts]: Start accepts. Automaton has 7760 states and 17119 transitions. Word has length 100 [2019-12-19 02:00:54,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:54,494 INFO L462 AbstractCegarLoop]: Abstraction has 7760 states and 17119 transitions. [2019-12-19 02:00:54,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:00:54,494 INFO L276 IsEmpty]: Start isEmpty. Operand 7760 states and 17119 transitions. [2019-12-19 02:00:54,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:00:54,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:54,503 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:54,503 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:54,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:54,503 INFO L82 PathProgramCache]: Analyzing trace with hash 708624238, now seen corresponding path program 1 times [2019-12-19 02:00:54,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:54,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983090849] [2019-12-19 02:00:54,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:54,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 02:00:54,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983090849] [2019-12-19 02:00:54,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:54,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:00:54,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136719652] [2019-12-19 02:00:54,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:00:54,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:54,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:00:54,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:00:54,563 INFO L87 Difference]: Start difference. First operand 7760 states and 17119 transitions. Second operand 4 states. [2019-12-19 02:00:54,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:54,753 INFO L93 Difference]: Finished difference Result 7841 states and 17308 transitions. [2019-12-19 02:00:54,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:00:54,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-19 02:00:54,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:54,766 INFO L225 Difference]: With dead ends: 7841 [2019-12-19 02:00:54,767 INFO L226 Difference]: Without dead ends: 7823 [2019-12-19 02:00:54,770 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 02:00:54,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7823 states. [2019-12-19 02:00:54,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7823 to 7805. [2019-12-19 02:00:54,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7805 states. [2019-12-19 02:00:54,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7805 states to 7805 states and 17224 transitions. [2019-12-19 02:00:54,905 INFO L78 Accepts]: Start accepts. Automaton has 7805 states and 17224 transitions. Word has length 100 [2019-12-19 02:00:54,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:54,906 INFO L462 AbstractCegarLoop]: Abstraction has 7805 states and 17224 transitions. [2019-12-19 02:00:54,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:00:54,906 INFO L276 IsEmpty]: Start isEmpty. Operand 7805 states and 17224 transitions. [2019-12-19 02:00:54,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:00:54,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:54,917 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:54,918 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:54,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:54,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1088327121, now seen corresponding path program 1 times [2019-12-19 02:00:54,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:54,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926313546] [2019-12-19 02:00:54,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:55,182 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 02:00:55,182 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926313546] [2019-12-19 02:00:55,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:55,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-19 02:00:55,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349672454] [2019-12-19 02:00:55,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-19 02:00:55,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:55,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-19 02:00:55,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-12-19 02:00:55,184 INFO L87 Difference]: Start difference. First operand 7805 states and 17224 transitions. Second operand 13 states. [2019-12-19 02:00:56,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:56,690 INFO L93 Difference]: Finished difference Result 10931 states and 23758 transitions. [2019-12-19 02:00:56,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-19 02:00:56,690 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 100 [2019-12-19 02:00:56,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:56,701 INFO L225 Difference]: With dead ends: 10931 [2019-12-19 02:00:56,702 INFO L226 Difference]: Without dead ends: 10931 [2019-12-19 02:00:56,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2019-12-19 02:00:56,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10931 states. [2019-12-19 02:00:56,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10931 to 8634. [2019-12-19 02:00:56,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8634 states. [2019-12-19 02:00:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8634 states to 8634 states and 19058 transitions. [2019-12-19 02:00:56,799 INFO L78 Accepts]: Start accepts. Automaton has 8634 states and 19058 transitions. Word has length 100 [2019-12-19 02:00:56,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:56,799 INFO L462 AbstractCegarLoop]: Abstraction has 8634 states and 19058 transitions. [2019-12-19 02:00:56,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-19 02:00:56,799 INFO L276 IsEmpty]: Start isEmpty. Operand 8634 states and 19058 transitions. [2019-12-19 02:00:56,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:00:56,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:56,806 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:56,807 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:56,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:56,807 INFO L82 PathProgramCache]: Analyzing trace with hash 2056087567, now seen corresponding path program 1 times [2019-12-19 02:00:56,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:56,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849277431] [2019-12-19 02:00:56,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:56,973 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 02:00:56,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849277431] [2019-12-19 02:00:56,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:56,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-19 02:00:56,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144818667] [2019-12-19 02:00:56,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-19 02:00:56,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:56,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-19 02:00:56,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-19 02:00:56,975 INFO L87 Difference]: Start difference. First operand 8634 states and 19058 transitions. Second operand 10 states. [2019-12-19 02:00:57,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:57,536 INFO L93 Difference]: Finished difference Result 26237 states and 58369 transitions. [2019-12-19 02:00:57,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 02:00:57,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 100 [2019-12-19 02:00:57,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:57,557 INFO L225 Difference]: With dead ends: 26237 [2019-12-19 02:00:57,557 INFO L226 Difference]: Without dead ends: 17139 [2019-12-19 02:00:57,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2019-12-19 02:00:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17139 states. [2019-12-19 02:00:57,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17139 to 8491. [2019-12-19 02:00:57,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8491 states. [2019-12-19 02:00:57,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8491 states to 8491 states and 18650 transitions. [2019-12-19 02:00:57,687 INFO L78 Accepts]: Start accepts. Automaton has 8491 states and 18650 transitions. Word has length 100 [2019-12-19 02:00:57,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:57,687 INFO L462 AbstractCegarLoop]: Abstraction has 8491 states and 18650 transitions. [2019-12-19 02:00:57,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-19 02:00:57,688 INFO L276 IsEmpty]: Start isEmpty. Operand 8491 states and 18650 transitions. [2019-12-19 02:00:57,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:00:57,695 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:57,695 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:57,695 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:57,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:57,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1334263253, now seen corresponding path program 1 times [2019-12-19 02:00:57,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:57,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135260077] [2019-12-19 02:00:57,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:57,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:00:57,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135260077] [2019-12-19 02:00:57,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:57,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:00:57,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305503035] [2019-12-19 02:00:57,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:00:57,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:57,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:00:57,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:00:57,835 INFO L87 Difference]: Start difference. First operand 8491 states and 18650 transitions. Second operand 6 states. [2019-12-19 02:00:58,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:58,062 INFO L93 Difference]: Finished difference Result 9239 states and 20140 transitions. [2019-12-19 02:00:58,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:00:58,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-12-19 02:00:58,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:58,074 INFO L225 Difference]: With dead ends: 9239 [2019-12-19 02:00:58,074 INFO L226 Difference]: Without dead ends: 9183 [2019-12-19 02:00:58,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:00:58,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9183 states. [2019-12-19 02:00:58,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9183 to 8450. [2019-12-19 02:00:58,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8450 states. [2019-12-19 02:00:58,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8450 states to 8450 states and 18447 transitions. [2019-12-19 02:00:58,202 INFO L78 Accepts]: Start accepts. Automaton has 8450 states and 18447 transitions. Word has length 100 [2019-12-19 02:00:58,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:58,202 INFO L462 AbstractCegarLoop]: Abstraction has 8450 states and 18447 transitions. [2019-12-19 02:00:58,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:00:58,203 INFO L276 IsEmpty]: Start isEmpty. Operand 8450 states and 18447 transitions. [2019-12-19 02:00:58,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:00:58,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:58,213 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:58,213 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:58,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:58,214 INFO L82 PathProgramCache]: Analyzing trace with hash 137251968, now seen corresponding path program 1 times [2019-12-19 02:00:58,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:58,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363033211] [2019-12-19 02:00:58,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:58,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:00:58,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363033211] [2019-12-19 02:00:58,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:58,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:00:58,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365271191] [2019-12-19 02:00:58,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:00:58,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:58,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:00:58,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:00:58,278 INFO L87 Difference]: Start difference. First operand 8450 states and 18447 transitions. Second operand 5 states. [2019-12-19 02:00:58,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:58,511 INFO L93 Difference]: Finished difference Result 10110 states and 21900 transitions. [2019-12-19 02:00:58,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:00:58,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-12-19 02:00:58,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:58,522 INFO L225 Difference]: With dead ends: 10110 [2019-12-19 02:00:58,522 INFO L226 Difference]: Without dead ends: 10012 [2019-12-19 02:00:58,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:00:58,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10012 states. [2019-12-19 02:00:58,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10012 to 8382. [2019-12-19 02:00:58,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8382 states. [2019-12-19 02:00:58,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8382 states to 8382 states and 18317 transitions. [2019-12-19 02:00:58,611 INFO L78 Accepts]: Start accepts. Automaton has 8382 states and 18317 transitions. Word has length 100 [2019-12-19 02:00:58,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:58,611 INFO L462 AbstractCegarLoop]: Abstraction has 8382 states and 18317 transitions. [2019-12-19 02:00:58,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:00:58,611 INFO L276 IsEmpty]: Start isEmpty. Operand 8382 states and 18317 transitions. [2019-12-19 02:00:58,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:00:58,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:58,618 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:58,619 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:58,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:58,619 INFO L82 PathProgramCache]: Analyzing trace with hash -92248222, now seen corresponding path program 1 times [2019-12-19 02:00:58,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:58,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003098382] [2019-12-19 02:00:58,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:58,813 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 02:00:58,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003098382] [2019-12-19 02:00:58,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:58,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 02:00:58,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886557911] [2019-12-19 02:00:58,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 02:00:58,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:58,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 02:00:58,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:00:58,822 INFO L87 Difference]: Start difference. First operand 8382 states and 18317 transitions. Second operand 9 states. [2019-12-19 02:00:59,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:00:59,544 INFO L93 Difference]: Finished difference Result 9378 states and 20392 transitions. [2019-12-19 02:00:59,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 02:00:59,545 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-12-19 02:00:59,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:00:59,556 INFO L225 Difference]: With dead ends: 9378 [2019-12-19 02:00:59,556 INFO L226 Difference]: Without dead ends: 9372 [2019-12-19 02:00:59,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-19 02:00:59,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9372 states. [2019-12-19 02:00:59,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9372 to 8515. [2019-12-19 02:00:59,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8515 states. [2019-12-19 02:00:59,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8515 states to 8515 states and 18626 transitions. [2019-12-19 02:00:59,676 INFO L78 Accepts]: Start accepts. Automaton has 8515 states and 18626 transitions. Word has length 100 [2019-12-19 02:00:59,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:00:59,677 INFO L462 AbstractCegarLoop]: Abstraction has 8515 states and 18626 transitions. [2019-12-19 02:00:59,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 02:00:59,677 INFO L276 IsEmpty]: Start isEmpty. Operand 8515 states and 18626 transitions. [2019-12-19 02:00:59,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:00:59,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:00:59,684 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:00:59,684 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:00:59,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:00:59,684 INFO L82 PathProgramCache]: Analyzing trace with hash -2130304511, now seen corresponding path program 1 times [2019-12-19 02:00:59,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:00:59,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74825626] [2019-12-19 02:00:59,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:00:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:00:59,827 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 02:00:59,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74825626] [2019-12-19 02:00:59,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:00:59,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 02:00:59,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927385191] [2019-12-19 02:00:59,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 02:00:59,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:00:59,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 02:00:59,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:00:59,829 INFO L87 Difference]: Start difference. First operand 8515 states and 18626 transitions. Second operand 8 states. [2019-12-19 02:01:00,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:00,209 INFO L93 Difference]: Finished difference Result 9790 states and 21222 transitions. [2019-12-19 02:01:00,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-19 02:01:00,210 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2019-12-19 02:01:00,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:00,220 INFO L225 Difference]: With dead ends: 9790 [2019-12-19 02:01:00,220 INFO L226 Difference]: Without dead ends: 9790 [2019-12-19 02:01:00,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-12-19 02:01:00,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9790 states. [2019-12-19 02:01:00,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9790 to 7208. [2019-12-19 02:01:00,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7208 states. [2019-12-19 02:01:00,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7208 states to 7208 states and 15727 transitions. [2019-12-19 02:01:00,297 INFO L78 Accepts]: Start accepts. Automaton has 7208 states and 15727 transitions. Word has length 100 [2019-12-19 02:01:00,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:00,298 INFO L462 AbstractCegarLoop]: Abstraction has 7208 states and 15727 transitions. [2019-12-19 02:01:00,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 02:01:00,298 INFO L276 IsEmpty]: Start isEmpty. Operand 7208 states and 15727 transitions. [2019-12-19 02:01:00,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:01:00,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:00,304 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:01:00,304 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:00,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:00,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1242800830, now seen corresponding path program 1 times [2019-12-19 02:01:00,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:00,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198271818] [2019-12-19 02:01:00,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:00,393 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 02:01:00,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198271818] [2019-12-19 02:01:00,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:00,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:01:00,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107118030] [2019-12-19 02:01:00,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:01:00,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:00,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:01:00,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:01:00,395 INFO L87 Difference]: Start difference. First operand 7208 states and 15727 transitions. Second operand 7 states. [2019-12-19 02:01:00,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:00,726 INFO L93 Difference]: Finished difference Result 8614 states and 18627 transitions. [2019-12-19 02:01:00,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 02:01:00,727 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-12-19 02:01:00,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:00,736 INFO L225 Difference]: With dead ends: 8614 [2019-12-19 02:01:00,736 INFO L226 Difference]: Without dead ends: 8614 [2019-12-19 02:01:00,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-19 02:01:00,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8614 states. [2019-12-19 02:01:00,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8614 to 7288. [2019-12-19 02:01:00,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7288 states. [2019-12-19 02:01:00,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7288 states to 7288 states and 15899 transitions. [2019-12-19 02:01:00,804 INFO L78 Accepts]: Start accepts. Automaton has 7288 states and 15899 transitions. Word has length 100 [2019-12-19 02:01:00,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:00,805 INFO L462 AbstractCegarLoop]: Abstraction has 7288 states and 15899 transitions. [2019-12-19 02:01:00,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:01:00,805 INFO L276 IsEmpty]: Start isEmpty. Operand 7288 states and 15899 transitions. [2019-12-19 02:01:00,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:01:00,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:00,810 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:01:00,811 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:00,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:00,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1369443155, now seen corresponding path program 1 times [2019-12-19 02:01:00,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:00,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712191257] [2019-12-19 02:01:00,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:00,959 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 02:01:00,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712191257] [2019-12-19 02:01:00,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:00,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:01:00,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401068286] [2019-12-19 02:01:00,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:01:00,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:00,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:01:00,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:01:00,961 INFO L87 Difference]: Start difference. First operand 7288 states and 15899 transitions. Second operand 7 states. [2019-12-19 02:01:01,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:01,462 INFO L93 Difference]: Finished difference Result 8064 states and 17435 transitions. [2019-12-19 02:01:01,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:01:01,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-12-19 02:01:01,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:01,472 INFO L225 Difference]: With dead ends: 8064 [2019-12-19 02:01:01,472 INFO L226 Difference]: Without dead ends: 8064 [2019-12-19 02:01:01,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:01:01,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8064 states. [2019-12-19 02:01:01,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8064 to 7309. [2019-12-19 02:01:01,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7309 states. [2019-12-19 02:01:01,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7309 states to 7309 states and 15944 transitions. [2019-12-19 02:01:01,558 INFO L78 Accepts]: Start accepts. Automaton has 7309 states and 15944 transitions. Word has length 100 [2019-12-19 02:01:01,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:01,558 INFO L462 AbstractCegarLoop]: Abstraction has 7309 states and 15944 transitions. [2019-12-19 02:01:01,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:01:01,559 INFO L276 IsEmpty]: Start isEmpty. Operand 7309 states and 15944 transitions. [2019-12-19 02:01:01,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:01:01,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:01,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:01:01,567 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:01,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:01,568 INFO L82 PathProgramCache]: Analyzing trace with hash 887467852, now seen corresponding path program 1 times [2019-12-19 02:01:01,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:01,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891863013] [2019-12-19 02:01:01,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:01,682 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 02:01:01,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891863013] [2019-12-19 02:01:01,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:01,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:01:01,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325715532] [2019-12-19 02:01:01,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:01:01,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:01,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:01:01,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:01:01,684 INFO L87 Difference]: Start difference. First operand 7309 states and 15944 transitions. Second operand 7 states. [2019-12-19 02:01:02,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:02,056 INFO L93 Difference]: Finished difference Result 7442 states and 16135 transitions. [2019-12-19 02:01:02,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-19 02:01:02,057 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-12-19 02:01:02,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:02,065 INFO L225 Difference]: With dead ends: 7442 [2019-12-19 02:01:02,065 INFO L226 Difference]: Without dead ends: 7442 [2019-12-19 02:01:02,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-19 02:01:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7442 states. [2019-12-19 02:01:02,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7442 to 6997. [2019-12-19 02:01:02,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6997 states. [2019-12-19 02:01:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6997 states to 6997 states and 15219 transitions. [2019-12-19 02:01:02,133 INFO L78 Accepts]: Start accepts. Automaton has 6997 states and 15219 transitions. Word has length 100 [2019-12-19 02:01:02,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:02,133 INFO L462 AbstractCegarLoop]: Abstraction has 6997 states and 15219 transitions. [2019-12-19 02:01:02,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:01:02,133 INFO L276 IsEmpty]: Start isEmpty. Operand 6997 states and 15219 transitions. [2019-12-19 02:01:02,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:01:02,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:02,139 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:01:02,140 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:02,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:02,140 INFO L82 PathProgramCache]: Analyzing trace with hash 2002922254, now seen corresponding path program 1 times [2019-12-19 02:01:02,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:02,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372889550] [2019-12-19 02:01:02,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:02,279 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 02:01:02,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372889550] [2019-12-19 02:01:02,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:02,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:01:02,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941835013] [2019-12-19 02:01:02,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:01:02,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:02,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:01:02,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:01:02,283 INFO L87 Difference]: Start difference. First operand 6997 states and 15219 transitions. Second operand 7 states. [2019-12-19 02:01:02,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:02,960 INFO L93 Difference]: Finished difference Result 9416 states and 20148 transitions. [2019-12-19 02:01:02,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-19 02:01:02,961 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2019-12-19 02:01:02,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:02,972 INFO L225 Difference]: With dead ends: 9416 [2019-12-19 02:01:02,972 INFO L226 Difference]: Without dead ends: 9416 [2019-12-19 02:01:02,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-12-19 02:01:02,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9416 states. [2019-12-19 02:01:03,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9416 to 7823. [2019-12-19 02:01:03,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7823 states. [2019-12-19 02:01:03,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7823 states to 7823 states and 17042 transitions. [2019-12-19 02:01:03,061 INFO L78 Accepts]: Start accepts. Automaton has 7823 states and 17042 transitions. Word has length 100 [2019-12-19 02:01:03,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:03,061 INFO L462 AbstractCegarLoop]: Abstraction has 7823 states and 17042 transitions. [2019-12-19 02:01:03,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:01:03,061 INFO L276 IsEmpty]: Start isEmpty. Operand 7823 states and 17042 transitions. [2019-12-19 02:01:03,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:01:03,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:03,068 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:01:03,068 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:03,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:03,068 INFO L82 PathProgramCache]: Analyzing trace with hash -35134035, now seen corresponding path program 2 times [2019-12-19 02:01:03,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:03,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720646521] [2019-12-19 02:01:03,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:01:03,222 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 02:01:03,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720646521] [2019-12-19 02:01:03,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:01:03,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 02:01:03,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891343477] [2019-12-19 02:01:03,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 02:01:03,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:01:03,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 02:01:03,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:01:03,224 INFO L87 Difference]: Start difference. First operand 7823 states and 17042 transitions. Second operand 8 states. [2019-12-19 02:01:03,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:01:03,348 INFO L93 Difference]: Finished difference Result 12326 states and 26895 transitions. [2019-12-19 02:01:03,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:01:03,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2019-12-19 02:01:03,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:01:03,355 INFO L225 Difference]: With dead ends: 12326 [2019-12-19 02:01:03,355 INFO L226 Difference]: Without dead ends: 4726 [2019-12-19 02:01:03,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-19 02:01:03,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4726 states. [2019-12-19 02:01:03,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4726 to 4726. [2019-12-19 02:01:03,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4726 states. [2019-12-19 02:01:03,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4726 states to 4726 states and 10272 transitions. [2019-12-19 02:01:03,401 INFO L78 Accepts]: Start accepts. Automaton has 4726 states and 10272 transitions. Word has length 100 [2019-12-19 02:01:03,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:01:03,402 INFO L462 AbstractCegarLoop]: Abstraction has 4726 states and 10272 transitions. [2019-12-19 02:01:03,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 02:01:03,402 INFO L276 IsEmpty]: Start isEmpty. Operand 4726 states and 10272 transitions. [2019-12-19 02:01:03,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-19 02:01:03,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:01:03,406 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:01:03,406 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:01:03,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:01:03,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1451347705, now seen corresponding path program 3 times [2019-12-19 02:01:03,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:01:03,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957812671] [2019-12-19 02:01:03,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:01:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 02:01:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 02:01:03,498 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 02:01:03,498 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 02:01:03,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 02:01:03 BasicIcfg [2019-12-19 02:01:03,728 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 02:01:03,733 INFO L168 Benchmark]: Toolchain (without parser) took 63166.26 ms. Allocated memory was 140.0 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 103.1 MB in the beginning and 795.5 MB in the end (delta: -692.3 MB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-19 02:01:03,734 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-19 02:01:03,735 INFO L168 Benchmark]: CACSL2BoogieTranslator took 816.99 ms. Allocated memory was 140.0 MB in the beginning and 206.0 MB in the end (delta: 66.1 MB). Free memory was 102.9 MB in the beginning and 160.6 MB in the end (delta: -57.7 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. [2019-12-19 02:01:03,735 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.78 ms. Allocated memory is still 206.0 MB. Free memory was 160.6 MB in the beginning and 157.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-19 02:01:03,736 INFO L168 Benchmark]: Boogie Preprocessor took 42.24 ms. Allocated memory is still 206.0 MB. Free memory was 157.4 MB in the beginning and 155.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-19 02:01:03,737 INFO L168 Benchmark]: RCFGBuilder took 778.58 ms. Allocated memory is still 206.0 MB. Free memory was 155.4 MB in the beginning and 110.3 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. [2019-12-19 02:01:03,737 INFO L168 Benchmark]: TraceAbstraction took 61458.40 ms. Allocated memory was 206.0 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 109.7 MB in the beginning and 795.5 MB in the end (delta: -685.8 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-19 02:01:03,740 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.22 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 816.99 ms. Allocated memory was 140.0 MB in the beginning and 206.0 MB in the end (delta: 66.1 MB). Free memory was 102.9 MB in the beginning and 160.6 MB in the end (delta: -57.7 MB). Peak memory consumption was 25.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.78 ms. Allocated memory is still 206.0 MB. Free memory was 160.6 MB in the beginning and 157.4 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.24 ms. Allocated memory is still 206.0 MB. Free memory was 157.4 MB in the beginning and 155.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 778.58 ms. Allocated memory is still 206.0 MB. Free memory was 155.4 MB in the beginning and 110.3 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 61458.40 ms. Allocated memory was 206.0 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 109.7 MB in the beginning and 795.5 MB in the end (delta: -685.8 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L700] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L702] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L704] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L705] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0] [L706] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L707] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L708] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L709] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L710] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0] [L711] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L712] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L713] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0] [L714] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L715] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L716] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L717] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L718] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L727] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L728] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L813] 0 pthread_t t837; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t837, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L815] 0 pthread_t t838; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L732] 1 a$w_buff1 = a$w_buff0 [L733] 1 a$w_buff0 = 1 [L734] 1 a$w_buff1_used = a$w_buff0_used [L735] 1 a$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t838, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L738] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L739] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L740] 1 a$r_buff0_thd1 = (_Bool)1 [L743] 1 x = 1 [L746] 1 __unbuffered_p0_EAX = x [L749] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 2 y = 1 [L769] 2 z = 1 [L772] 2 __unbuffered_p1_EAX = z [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 a$flush_delayed = weak$$choice2 [L778] 2 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] EXPR 2 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L779] 2 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L780] EXPR 2 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L780] 2 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L781] EXPR 2 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L781] 2 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L782] EXPR 2 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=1, x=1, y=1, z=1] [L782] 2 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L783] EXPR 2 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L783] 2 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2))=0, x=1, y=1, z=1] [L784] 2 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L785] 2 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L752] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L753] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L754] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L755] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L787] EXPR 2 a$flush_delayed ? a$mem_tmp : a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L787] 2 a = a$flush_delayed ? a$mem_tmp : a [L788] 2 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L755] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L756] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L795] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L756] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L822] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L823] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L823] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L824] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L824] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L825] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L825] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L826] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L826] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L829] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 145 locations, 2 error locations. Result: UNSAFE, OverallTime: 61.0s, OverallIterations: 42, TraceHistogramMax: 1, AutomataDifference: 25.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11265 SDtfs, 12437 SDslu, 28922 SDs, 0 SdLazy, 12025 SolverSat, 620 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 483 GetRequests, 125 SyntacticMatches, 32 SemanticMatches, 326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71016occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 27.6s AutomataMinimizationTime, 41 MinimizatonAttempts, 103333 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 3438 NumberOfCodeBlocks, 3438 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 3297 ConstructedInterpolants, 0 QuantifiedInterpolants, 805505 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 41 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...