/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/mix012_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 00:41:45,266 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 00:41:45,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 00:41:45,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 00:41:45,287 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 00:41:45,289 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 00:41:45,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 00:41:45,299 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 00:41:45,302 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 00:41:45,302 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 00:41:45,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 00:41:45,307 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 00:41:45,307 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 00:41:45,310 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 00:41:45,312 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 00:41:45,313 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 00:41:45,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 00:41:45,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 00:41:45,318 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 00:41:45,323 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 00:41:45,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 00:41:45,329 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 00:41:45,330 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 00:41:45,332 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 00:41:45,334 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 00:41:45,334 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 00:41:45,334 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 00:41:45,336 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 00:41:45,337 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 00:41:45,338 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 00:41:45,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 00:41:45,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 00:41:45,341 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 00:41:45,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 00:41:45,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 00:41:45,343 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 00:41:45,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 00:41:45,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 00:41:45,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 00:41:45,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 00:41:45,348 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 00:41:45,349 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-19 00:41:45,380 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 00:41:45,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 00:41:45,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 00:41:45,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 00:41:45,384 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 00:41:45,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 00:41:45,384 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 00:41:45,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 00:41:45,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 00:41:45,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 00:41:45,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 00:41:45,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 00:41:45,385 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 00:41:45,385 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 00:41:45,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 00:41:45,386 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 00:41:45,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 00:41:45,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 00:41:45,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 00:41:45,387 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 00:41:45,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 00:41:45,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 00:41:45,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 00:41:45,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 00:41:45,388 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 00:41:45,388 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 00:41:45,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 00:41:45,388 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 00:41:45,388 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 00:41:45,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 00:41:45,657 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 00:41:45,666 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 00:41:45,670 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 00:41:45,672 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 00:41:45,672 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 00:41:45,673 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_power.oepc.i [2019-12-19 00:41:45,732 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9084b109/f49c68b3440a40a7898a4be8b617f693/FLAGe65fcda40 [2019-12-19 00:41:46,243 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 00:41:46,245 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_power.oepc.i [2019-12-19 00:41:46,270 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9084b109/f49c68b3440a40a7898a4be8b617f693/FLAGe65fcda40 [2019-12-19 00:41:46,512 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9084b109/f49c68b3440a40a7898a4be8b617f693 [2019-12-19 00:41:46,522 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 00:41:46,524 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 00:41:46,525 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 00:41:46,525 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 00:41:46,529 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 00:41:46,530 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 12:41:46" (1/1) ... [2019-12-19 00:41:46,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@195cbd31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:41:46, skipping insertion in model container [2019-12-19 00:41:46,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 12:41:46" (1/1) ... [2019-12-19 00:41:46,540 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 00:41:46,599 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 00:41:47,128 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 00:41:47,152 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 00:41:47,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 00:41:47,303 INFO L208 MainTranslator]: Completed translation [2019-12-19 00:41:47,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:41:47 WrapperNode [2019-12-19 00:41:47,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 00:41:47,304 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 00:41:47,304 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 00:41:47,304 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 00:41:47,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:41:47" (1/1) ... [2019-12-19 00:41:47,332 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:41:47" (1/1) ... [2019-12-19 00:41:47,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 00:41:47,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 00:41:47,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 00:41:47,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 00:41:47,374 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:41:47" (1/1) ... [2019-12-19 00:41:47,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:41:47" (1/1) ... [2019-12-19 00:41:47,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:41:47" (1/1) ... [2019-12-19 00:41:47,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:41:47" (1/1) ... [2019-12-19 00:41:47,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:41:47" (1/1) ... [2019-12-19 00:41:47,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:41:47" (1/1) ... [2019-12-19 00:41:47,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:41:47" (1/1) ... [2019-12-19 00:41:47,407 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 00:41:47,407 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 00:41:47,407 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 00:41:47,407 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 00:41:47,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:41:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 00:41:47,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 00:41:47,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 00:41:47,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 00:41:47,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 00:41:47,471 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 00:41:47,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 00:41:47,472 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 00:41:47,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 00:41:47,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 00:41:47,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 00:41:47,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 00:41:47,476 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 00:41:48,135 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 00:41:48,135 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 00:41:48,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:41:48 BoogieIcfgContainer [2019-12-19 00:41:48,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 00:41:48,138 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 00:41:48,138 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 00:41:48,141 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 00:41:48,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 12:41:46" (1/3) ... [2019-12-19 00:41:48,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117ea068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:41:48, skipping insertion in model container [2019-12-19 00:41:48,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:41:47" (2/3) ... [2019-12-19 00:41:48,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117ea068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:41:48, skipping insertion in model container [2019-12-19 00:41:48,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:41:48" (3/3) ... [2019-12-19 00:41:48,146 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc.i [2019-12-19 00:41:48,156 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 00:41:48,157 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 00:41:48,165 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 00:41:48,168 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 00:41:48,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,223 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,223 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,223 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,224 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,224 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,243 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,244 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,295 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,295 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,295 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,302 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,305 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,306 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 00:41:48,326 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 00:41:48,347 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 00:41:48,347 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 00:41:48,347 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 00:41:48,347 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 00:41:48,347 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 00:41:48,348 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 00:41:48,348 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 00:41:48,348 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 00:41:48,364 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 148 places, 182 transitions [2019-12-19 00:41:50,255 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32592 states. [2019-12-19 00:41:50,257 INFO L276 IsEmpty]: Start isEmpty. Operand 32592 states. [2019-12-19 00:41:50,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-19 00:41:50,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:41:50,271 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] [2019-12-19 00:41:50,271 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:41:50,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:41:50,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1564572936, now seen corresponding path program 1 times [2019-12-19 00:41:50,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:41:50,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026024070] [2019-12-19 00:41:50,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:41:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:41:50,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:41:50,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026024070] [2019-12-19 00:41:50,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:41:50,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:41:50,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814242520] [2019-12-19 00:41:50,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:41:50,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:41:50,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:41:50,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:41:50,595 INFO L87 Difference]: Start difference. First operand 32592 states. Second operand 4 states. [2019-12-19 00:41:52,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:41:52,010 INFO L93 Difference]: Finished difference Result 33592 states and 129569 transitions. [2019-12-19 00:41:52,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 00:41:52,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-19 00:41:52,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:41:52,266 INFO L225 Difference]: With dead ends: 33592 [2019-12-19 00:41:52,267 INFO L226 Difference]: Without dead ends: 25704 [2019-12-19 00:41:52,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:41:52,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25704 states. [2019-12-19 00:41:53,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25704 to 25704. [2019-12-19 00:41:53,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25704 states. [2019-12-19 00:41:54,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25704 states to 25704 states and 99585 transitions. [2019-12-19 00:41:54,169 INFO L78 Accepts]: Start accepts. Automaton has 25704 states and 99585 transitions. Word has length 35 [2019-12-19 00:41:54,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:41:54,170 INFO L462 AbstractCegarLoop]: Abstraction has 25704 states and 99585 transitions. [2019-12-19 00:41:54,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:41:54,170 INFO L276 IsEmpty]: Start isEmpty. Operand 25704 states and 99585 transitions. [2019-12-19 00:41:54,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-19 00:41:54,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:41:54,189 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:41:54,189 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:41:54,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:41:54,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1980442200, now seen corresponding path program 1 times [2019-12-19 00:41:54,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:41:54,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799541340] [2019-12-19 00:41:54,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:41:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:41:54,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:41:54,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799541340] [2019-12-19 00:41:54,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:41:54,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:41:54,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134573381] [2019-12-19 00:41:54,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:41:54,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:41:54,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:41:54,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:41:54,388 INFO L87 Difference]: Start difference. First operand 25704 states and 99585 transitions. Second operand 5 states. [2019-12-19 00:41:55,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:41:55,259 INFO L93 Difference]: Finished difference Result 41082 states and 150432 transitions. [2019-12-19 00:41:55,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:41:55,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-19 00:41:55,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:41:56,695 INFO L225 Difference]: With dead ends: 41082 [2019-12-19 00:41:56,696 INFO L226 Difference]: Without dead ends: 40546 [2019-12-19 00:41:56,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:41:57,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40546 states. [2019-12-19 00:41:57,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40546 to 38926. [2019-12-19 00:41:57,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38926 states. [2019-12-19 00:41:58,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38926 states to 38926 states and 143582 transitions. [2019-12-19 00:41:58,046 INFO L78 Accepts]: Start accepts. Automaton has 38926 states and 143582 transitions. Word has length 47 [2019-12-19 00:41:58,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:41:58,048 INFO L462 AbstractCegarLoop]: Abstraction has 38926 states and 143582 transitions. [2019-12-19 00:41:58,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:41:58,048 INFO L276 IsEmpty]: Start isEmpty. Operand 38926 states and 143582 transitions. [2019-12-19 00:41:58,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-19 00:41:58,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:41:58,054 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:41:58,055 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:41:58,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:41:58,055 INFO L82 PathProgramCache]: Analyzing trace with hash 645631914, now seen corresponding path program 1 times [2019-12-19 00:41:58,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:41:58,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512490961] [2019-12-19 00:41:58,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:41:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:41:58,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:41:58,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512490961] [2019-12-19 00:41:58,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:41:58,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:41:58,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010771586] [2019-12-19 00:41:58,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:41:58,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:41:58,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:41:58,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:41:58,151 INFO L87 Difference]: Start difference. First operand 38926 states and 143582 transitions. Second operand 5 states. [2019-12-19 00:41:59,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:41:59,083 INFO L93 Difference]: Finished difference Result 49779 states and 180634 transitions. [2019-12-19 00:41:59,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:41:59,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-19 00:41:59,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:41:59,295 INFO L225 Difference]: With dead ends: 49779 [2019-12-19 00:41:59,295 INFO L226 Difference]: Without dead ends: 49275 [2019-12-19 00:41:59,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:41:59,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49275 states. [2019-12-19 00:42:02,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49275 to 42678. [2019-12-19 00:42:02,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42678 states. [2019-12-19 00:42:02,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42678 states to 42678 states and 156593 transitions. [2019-12-19 00:42:02,221 INFO L78 Accepts]: Start accepts. Automaton has 42678 states and 156593 transitions. Word has length 48 [2019-12-19 00:42:02,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:02,221 INFO L462 AbstractCegarLoop]: Abstraction has 42678 states and 156593 transitions. [2019-12-19 00:42:02,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:42:02,222 INFO L276 IsEmpty]: Start isEmpty. Operand 42678 states and 156593 transitions. [2019-12-19 00:42:02,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-19 00:42:02,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:02,231 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:42:02,231 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:02,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:02,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1346758064, now seen corresponding path program 1 times [2019-12-19 00:42:02,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:02,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732107412] [2019-12-19 00:42:02,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:02,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:02,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732107412] [2019-12-19 00:42:02,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:02,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:42:02,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775727409] [2019-12-19 00:42:02,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:42:02,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:02,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:42:02,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:42:02,294 INFO L87 Difference]: Start difference. First operand 42678 states and 156593 transitions. Second operand 3 states. [2019-12-19 00:42:02,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:02,950 INFO L93 Difference]: Finished difference Result 61088 states and 221431 transitions. [2019-12-19 00:42:02,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:42:02,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-19 00:42:02,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:03,134 INFO L225 Difference]: With dead ends: 61088 [2019-12-19 00:42:03,134 INFO L226 Difference]: Without dead ends: 61088 [2019-12-19 00:42:03,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:42:03,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61088 states. [2019-12-19 00:42:05,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61088 to 48017. [2019-12-19 00:42:05,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48017 states. [2019-12-19 00:42:06,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48017 states to 48017 states and 174180 transitions. [2019-12-19 00:42:06,076 INFO L78 Accepts]: Start accepts. Automaton has 48017 states and 174180 transitions. Word has length 50 [2019-12-19 00:42:06,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:06,076 INFO L462 AbstractCegarLoop]: Abstraction has 48017 states and 174180 transitions. [2019-12-19 00:42:06,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:42:06,076 INFO L276 IsEmpty]: Start isEmpty. Operand 48017 states and 174180 transitions. [2019-12-19 00:42:06,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 00:42:06,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:06,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] [2019-12-19 00:42:06,093 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:06,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:06,094 INFO L82 PathProgramCache]: Analyzing trace with hash 551995902, now seen corresponding path program 1 times [2019-12-19 00:42:06,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:06,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396470104] [2019-12-19 00:42:06,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:06,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:06,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396470104] [2019-12-19 00:42:06,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:06,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:42:06,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254955396] [2019-12-19 00:42:06,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:42:06,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:06,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:42:06,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:42:06,178 INFO L87 Difference]: Start difference. First operand 48017 states and 174180 transitions. Second operand 3 states. [2019-12-19 00:42:06,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:06,634 INFO L93 Difference]: Finished difference Result 53337 states and 193528 transitions. [2019-12-19 00:42:06,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:42:06,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-19 00:42:06,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:06,796 INFO L225 Difference]: With dead ends: 53337 [2019-12-19 00:42:06,796 INFO L226 Difference]: Without dead ends: 53337 [2019-12-19 00:42:06,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:42:07,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53337 states. [2019-12-19 00:42:08,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53337 to 50675. [2019-12-19 00:42:08,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50675 states. [2019-12-19 00:42:08,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50675 states to 50675 states and 183848 transitions. [2019-12-19 00:42:08,191 INFO L78 Accepts]: Start accepts. Automaton has 50675 states and 183848 transitions. Word has length 54 [2019-12-19 00:42:08,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:08,191 INFO L462 AbstractCegarLoop]: Abstraction has 50675 states and 183848 transitions. [2019-12-19 00:42:08,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:42:08,191 INFO L276 IsEmpty]: Start isEmpty. Operand 50675 states and 183848 transitions. [2019-12-19 00:42:08,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 00:42:08,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:08,205 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] [2019-12-19 00:42:08,206 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:08,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:08,206 INFO L82 PathProgramCache]: Analyzing trace with hash -962055554, now seen corresponding path program 1 times [2019-12-19 00:42:08,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:08,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669619598] [2019-12-19 00:42:08,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:08,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:08,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669619598] [2019-12-19 00:42:08,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:08,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:42:08,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287542933] [2019-12-19 00:42:08,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:42:08,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:08,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:42:08,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:42:08,351 INFO L87 Difference]: Start difference. First operand 50675 states and 183848 transitions. Second operand 6 states. [2019-12-19 00:42:10,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:10,631 INFO L93 Difference]: Finished difference Result 65267 states and 234906 transitions. [2019-12-19 00:42:10,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:42:10,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-19 00:42:10,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:10,791 INFO L225 Difference]: With dead ends: 65267 [2019-12-19 00:42:10,791 INFO L226 Difference]: Without dead ends: 65267 [2019-12-19 00:42:10,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:42:11,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65267 states. [2019-12-19 00:42:12,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65267 to 59950. [2019-12-19 00:42:12,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59950 states. [2019-12-19 00:42:12,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59950 states to 59950 states and 215673 transitions. [2019-12-19 00:42:12,335 INFO L78 Accepts]: Start accepts. Automaton has 59950 states and 215673 transitions. Word has length 54 [2019-12-19 00:42:12,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:12,335 INFO L462 AbstractCegarLoop]: Abstraction has 59950 states and 215673 transitions. [2019-12-19 00:42:12,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:42:12,335 INFO L276 IsEmpty]: Start isEmpty. Operand 59950 states and 215673 transitions. [2019-12-19 00:42:12,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 00:42:12,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:12,349 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] [2019-12-19 00:42:12,349 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:12,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:12,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1535960383, now seen corresponding path program 1 times [2019-12-19 00:42:12,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:12,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254607063] [2019-12-19 00:42:12,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:12,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:12,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254607063] [2019-12-19 00:42:12,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:12,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:42:12,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668536795] [2019-12-19 00:42:12,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:42:12,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:12,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:42:12,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:42:12,467 INFO L87 Difference]: Start difference. First operand 59950 states and 215673 transitions. Second operand 7 states. [2019-12-19 00:42:13,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:13,895 INFO L93 Difference]: Finished difference Result 83686 states and 290098 transitions. [2019-12-19 00:42:13,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 00:42:13,896 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-19 00:42:13,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:14,115 INFO L225 Difference]: With dead ends: 83686 [2019-12-19 00:42:14,116 INFO L226 Difference]: Without dead ends: 83686 [2019-12-19 00:42:14,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 00:42:15,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83686 states. [2019-12-19 00:42:15,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83686 to 71013. [2019-12-19 00:42:15,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71013 states. [2019-12-19 00:42:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71013 states to 71013 states and 249887 transitions. [2019-12-19 00:42:19,269 INFO L78 Accepts]: Start accepts. Automaton has 71013 states and 249887 transitions. Word has length 54 [2019-12-19 00:42:19,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:19,270 INFO L462 AbstractCegarLoop]: Abstraction has 71013 states and 249887 transitions. [2019-12-19 00:42:19,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:42:19,270 INFO L276 IsEmpty]: Start isEmpty. Operand 71013 states and 249887 transitions. [2019-12-19 00:42:19,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 00:42:19,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:19,283 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] [2019-12-19 00:42:19,284 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:19,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:19,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1871503232, now seen corresponding path program 1 times [2019-12-19 00:42:19,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:19,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733024029] [2019-12-19 00:42:19,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:19,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:19,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733024029] [2019-12-19 00:42:19,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:19,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:42:19,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179108301] [2019-12-19 00:42:19,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:42:19,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:19,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:42:19,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:42:19,359 INFO L87 Difference]: Start difference. First operand 71013 states and 249887 transitions. Second operand 4 states. [2019-12-19 00:42:19,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:19,417 INFO L93 Difference]: Finished difference Result 12160 states and 37830 transitions. [2019-12-19 00:42:19,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 00:42:19,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-19 00:42:19,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:19,433 INFO L225 Difference]: With dead ends: 12160 [2019-12-19 00:42:19,434 INFO L226 Difference]: Without dead ends: 10675 [2019-12-19 00:42:19,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:42:19,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10675 states. [2019-12-19 00:42:19,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10675 to 10626. [2019-12-19 00:42:19,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10626 states. [2019-12-19 00:42:19,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10626 states to 10626 states and 32592 transitions. [2019-12-19 00:42:19,585 INFO L78 Accepts]: Start accepts. Automaton has 10626 states and 32592 transitions. Word has length 54 [2019-12-19 00:42:19,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:19,585 INFO L462 AbstractCegarLoop]: Abstraction has 10626 states and 32592 transitions. [2019-12-19 00:42:19,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:42:19,585 INFO L276 IsEmpty]: Start isEmpty. Operand 10626 states and 32592 transitions. [2019-12-19 00:42:19,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-19 00:42:19,587 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:19,587 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] [2019-12-19 00:42:19,587 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:19,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:19,587 INFO L82 PathProgramCache]: Analyzing trace with hash 683903899, now seen corresponding path program 1 times [2019-12-19 00:42:19,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:19,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543845089] [2019-12-19 00:42:19,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:19,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:19,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543845089] [2019-12-19 00:42:19,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:19,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:42:19,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276057868] [2019-12-19 00:42:19,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:42:19,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:19,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:42:19,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:42:19,658 INFO L87 Difference]: Start difference. First operand 10626 states and 32592 transitions. Second operand 6 states. [2019-12-19 00:42:20,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:20,121 INFO L93 Difference]: Finished difference Result 13183 states and 39873 transitions. [2019-12-19 00:42:20,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 00:42:20,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-19 00:42:20,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:20,140 INFO L225 Difference]: With dead ends: 13183 [2019-12-19 00:42:20,141 INFO L226 Difference]: Without dead ends: 13120 [2019-12-19 00:42:20,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-19 00:42:20,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13120 states. [2019-12-19 00:42:20,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13120 to 11049. [2019-12-19 00:42:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11049 states. [2019-12-19 00:42:20,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11049 states to 11049 states and 33786 transitions. [2019-12-19 00:42:20,309 INFO L78 Accepts]: Start accepts. Automaton has 11049 states and 33786 transitions. Word has length 54 [2019-12-19 00:42:20,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:20,309 INFO L462 AbstractCegarLoop]: Abstraction has 11049 states and 33786 transitions. [2019-12-19 00:42:20,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:42:20,309 INFO L276 IsEmpty]: Start isEmpty. Operand 11049 states and 33786 transitions. [2019-12-19 00:42:20,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-19 00:42:20,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:20,313 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:42:20,313 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:20,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:20,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1727879850, now seen corresponding path program 1 times [2019-12-19 00:42:20,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:20,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724238556] [2019-12-19 00:42:20,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:20,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:20,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724238556] [2019-12-19 00:42:20,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:20,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:42:20,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126861287] [2019-12-19 00:42:20,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:42:20,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:20,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:42:20,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:42:20,403 INFO L87 Difference]: Start difference. First operand 11049 states and 33786 transitions. Second operand 6 states. [2019-12-19 00:42:20,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:20,839 INFO L93 Difference]: Finished difference Result 13540 states and 40805 transitions. [2019-12-19 00:42:20,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 00:42:20,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-19 00:42:20,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:20,860 INFO L225 Difference]: With dead ends: 13540 [2019-12-19 00:42:20,860 INFO L226 Difference]: Without dead ends: 13479 [2019-12-19 00:42:20,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 00:42:20,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13479 states. [2019-12-19 00:42:21,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13479 to 12787. [2019-12-19 00:42:21,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12787 states. [2019-12-19 00:42:21,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12787 states to 12787 states and 38735 transitions. [2019-12-19 00:42:21,338 INFO L78 Accepts]: Start accepts. Automaton has 12787 states and 38735 transitions. Word has length 62 [2019-12-19 00:42:21,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:21,338 INFO L462 AbstractCegarLoop]: Abstraction has 12787 states and 38735 transitions. [2019-12-19 00:42:21,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:42:21,338 INFO L276 IsEmpty]: Start isEmpty. Operand 12787 states and 38735 transitions. [2019-12-19 00:42:21,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 00:42:21,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:21,346 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] [2019-12-19 00:42:21,347 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:21,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:21,347 INFO L82 PathProgramCache]: Analyzing trace with hash -903159920, now seen corresponding path program 1 times [2019-12-19 00:42:21,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:21,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286724282] [2019-12-19 00:42:21,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:21,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:21,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286724282] [2019-12-19 00:42:21,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:21,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:42:21,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244805857] [2019-12-19 00:42:21,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:42:21,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:21,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:42:21,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:42:21,427 INFO L87 Difference]: Start difference. First operand 12787 states and 38735 transitions. Second operand 4 states. [2019-12-19 00:42:21,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:21,821 INFO L93 Difference]: Finished difference Result 15674 states and 46880 transitions. [2019-12-19 00:42:21,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 00:42:21,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-19 00:42:21,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:21,862 INFO L225 Difference]: With dead ends: 15674 [2019-12-19 00:42:21,862 INFO L226 Difference]: Without dead ends: 15674 [2019-12-19 00:42:21,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:42:21,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15674 states. [2019-12-19 00:42:22,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15674 to 14153. [2019-12-19 00:42:22,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14153 states. [2019-12-19 00:42:22,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14153 states to 14153 states and 42469 transitions. [2019-12-19 00:42:22,185 INFO L78 Accepts]: Start accepts. Automaton has 14153 states and 42469 transitions. Word has length 66 [2019-12-19 00:42:22,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:22,186 INFO L462 AbstractCegarLoop]: Abstraction has 14153 states and 42469 transitions. [2019-12-19 00:42:22,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:42:22,186 INFO L276 IsEmpty]: Start isEmpty. Operand 14153 states and 42469 transitions. [2019-12-19 00:42:22,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 00:42:22,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:42:22,199 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:22,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:22,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1314598033, now seen corresponding path program 1 times [2019-12-19 00:42:22,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:22,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077010361] [2019-12-19 00:42:22,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:22,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:22,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077010361] [2019-12-19 00:42:22,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:22,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:42:22,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156161633] [2019-12-19 00:42:22,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:42:22,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:22,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:42:22,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:42:22,248 INFO L87 Difference]: Start difference. First operand 14153 states and 42469 transitions. Second operand 3 states. [2019-12-19 00:42:22,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:22,499 INFO L93 Difference]: Finished difference Result 14686 states and 43876 transitions. [2019-12-19 00:42:22,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:42:22,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-19 00:42:22,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:22,532 INFO L225 Difference]: With dead ends: 14686 [2019-12-19 00:42:22,532 INFO L226 Difference]: Without dead ends: 14686 [2019-12-19 00:42:22,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:42:22,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14686 states. [2019-12-19 00:42:22,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14686 to 14437. [2019-12-19 00:42:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14437 states. [2019-12-19 00:42:22,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14437 states to 14437 states and 43213 transitions. [2019-12-19 00:42:22,806 INFO L78 Accepts]: Start accepts. Automaton has 14437 states and 43213 transitions. Word has length 66 [2019-12-19 00:42:22,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:22,806 INFO L462 AbstractCegarLoop]: Abstraction has 14437 states and 43213 transitions. [2019-12-19 00:42:22,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:42:22,806 INFO L276 IsEmpty]: Start isEmpty. Operand 14437 states and 43213 transitions. [2019-12-19 00:42:22,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:42:22,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:22,815 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] [2019-12-19 00:42:22,815 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:22,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:22,815 INFO L82 PathProgramCache]: Analyzing trace with hash 789260736, now seen corresponding path program 1 times [2019-12-19 00:42:22,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:22,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291257638] [2019-12-19 00:42:22,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:22,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:22,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291257638] [2019-12-19 00:42:22,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:22,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:42:22,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681475016] [2019-12-19 00:42:22,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:42:22,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:22,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:42:22,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:42:22,914 INFO L87 Difference]: Start difference. First operand 14437 states and 43213 transitions. Second operand 6 states. [2019-12-19 00:42:23,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:23,522 INFO L93 Difference]: Finished difference Result 15429 states and 45576 transitions. [2019-12-19 00:42:23,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:42:23,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-19 00:42:23,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:23,545 INFO L225 Difference]: With dead ends: 15429 [2019-12-19 00:42:23,545 INFO L226 Difference]: Without dead ends: 15429 [2019-12-19 00:42:23,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:42:23,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15429 states. [2019-12-19 00:42:23,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15429 to 15010. [2019-12-19 00:42:23,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15010 states. [2019-12-19 00:42:23,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15010 states to 15010 states and 44510 transitions. [2019-12-19 00:42:23,748 INFO L78 Accepts]: Start accepts. Automaton has 15010 states and 44510 transitions. Word has length 68 [2019-12-19 00:42:23,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:23,749 INFO L462 AbstractCegarLoop]: Abstraction has 15010 states and 44510 transitions. [2019-12-19 00:42:23,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:42:23,749 INFO L276 IsEmpty]: Start isEmpty. Operand 15010 states and 44510 transitions. [2019-12-19 00:42:23,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:42:23,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:23,758 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] [2019-12-19 00:42:23,758 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:23,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:23,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1287948607, now seen corresponding path program 1 times [2019-12-19 00:42:23,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:23,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150181849] [2019-12-19 00:42:23,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:23,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:23,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150181849] [2019-12-19 00:42:23,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:23,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:42:23,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385258655] [2019-12-19 00:42:23,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:42:23,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:23,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:42:23,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:42:23,853 INFO L87 Difference]: Start difference. First operand 15010 states and 44510 transitions. Second operand 6 states. [2019-12-19 00:42:24,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:24,289 INFO L93 Difference]: Finished difference Result 17281 states and 49779 transitions. [2019-12-19 00:42:24,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 00:42:24,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-19 00:42:24,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:24,314 INFO L225 Difference]: With dead ends: 17281 [2019-12-19 00:42:24,314 INFO L226 Difference]: Without dead ends: 17281 [2019-12-19 00:42:24,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 00:42:24,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17281 states. [2019-12-19 00:42:24,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17281 to 15702. [2019-12-19 00:42:24,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15702 states. [2019-12-19 00:42:24,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15702 states to 15702 states and 45760 transitions. [2019-12-19 00:42:24,726 INFO L78 Accepts]: Start accepts. Automaton has 15702 states and 45760 transitions. Word has length 68 [2019-12-19 00:42:24,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:24,727 INFO L462 AbstractCegarLoop]: Abstraction has 15702 states and 45760 transitions. [2019-12-19 00:42:24,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:42:24,727 INFO L276 IsEmpty]: Start isEmpty. Operand 15702 states and 45760 transitions. [2019-12-19 00:42:24,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:42:24,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:24,736 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] [2019-12-19 00:42:24,737 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:24,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:24,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1076597694, now seen corresponding path program 1 times [2019-12-19 00:42:24,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:24,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155141459] [2019-12-19 00:42:24,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:24,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:24,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155141459] [2019-12-19 00:42:24,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:24,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:42:24,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291869278] [2019-12-19 00:42:24,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:42:24,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:24,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:42:24,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:42:24,812 INFO L87 Difference]: Start difference. First operand 15702 states and 45760 transitions. Second operand 5 states. [2019-12-19 00:42:25,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:25,250 INFO L93 Difference]: Finished difference Result 20231 states and 58824 transitions. [2019-12-19 00:42:25,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 00:42:25,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-19 00:42:25,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:25,282 INFO L225 Difference]: With dead ends: 20231 [2019-12-19 00:42:25,283 INFO L226 Difference]: Without dead ends: 20231 [2019-12-19 00:42:25,283 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 00:42:25,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20231 states. [2019-12-19 00:42:25,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20231 to 18521. [2019-12-19 00:42:25,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18521 states. [2019-12-19 00:42:25,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18521 states to 18521 states and 53710 transitions. [2019-12-19 00:42:25,557 INFO L78 Accepts]: Start accepts. Automaton has 18521 states and 53710 transitions. Word has length 68 [2019-12-19 00:42:25,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:25,557 INFO L462 AbstractCegarLoop]: Abstraction has 18521 states and 53710 transitions. [2019-12-19 00:42:25,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:42:25,558 INFO L276 IsEmpty]: Start isEmpty. Operand 18521 states and 53710 transitions. [2019-12-19 00:42:25,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:42:25,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:25,570 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] [2019-12-19 00:42:25,570 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:25,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:25,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1587131871, now seen corresponding path program 1 times [2019-12-19 00:42:25,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:25,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466055684] [2019-12-19 00:42:25,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:25,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:25,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466055684] [2019-12-19 00:42:25,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:25,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:42:25,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375521837] [2019-12-19 00:42:25,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:42:25,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:25,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:42:25,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:42:25,669 INFO L87 Difference]: Start difference. First operand 18521 states and 53710 transitions. Second operand 5 states. [2019-12-19 00:42:26,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:26,256 INFO L93 Difference]: Finished difference Result 25228 states and 72837 transitions. [2019-12-19 00:42:26,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 00:42:26,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-19 00:42:26,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:26,293 INFO L225 Difference]: With dead ends: 25228 [2019-12-19 00:42:26,293 INFO L226 Difference]: Without dead ends: 25228 [2019-12-19 00:42:26,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:42:26,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25228 states. [2019-12-19 00:42:26,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25228 to 20409. [2019-12-19 00:42:26,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20409 states. [2019-12-19 00:42:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20409 states to 20409 states and 58984 transitions. [2019-12-19 00:42:26,581 INFO L78 Accepts]: Start accepts. Automaton has 20409 states and 58984 transitions. Word has length 68 [2019-12-19 00:42:26,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:26,581 INFO L462 AbstractCegarLoop]: Abstraction has 20409 states and 58984 transitions. [2019-12-19 00:42:26,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:42:26,581 INFO L276 IsEmpty]: Start isEmpty. Operand 20409 states and 58984 transitions. [2019-12-19 00:42:26,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:42:26,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:26,590 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] [2019-12-19 00:42:26,591 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:26,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:26,591 INFO L82 PathProgramCache]: Analyzing trace with hash 900380962, now seen corresponding path program 1 times [2019-12-19 00:42:26,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:26,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667345205] [2019-12-19 00:42:26,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:26,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:26,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667345205] [2019-12-19 00:42:26,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:26,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:42:26,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787040902] [2019-12-19 00:42:26,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:42:26,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:26,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:42:26,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:42:26,671 INFO L87 Difference]: Start difference. First operand 20409 states and 58984 transitions. Second operand 6 states. [2019-12-19 00:42:27,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:27,920 INFO L93 Difference]: Finished difference Result 26880 states and 78478 transitions. [2019-12-19 00:42:27,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 00:42:27,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-19 00:42:27,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:27,956 INFO L225 Difference]: With dead ends: 26880 [2019-12-19 00:42:27,957 INFO L226 Difference]: Without dead ends: 26769 [2019-12-19 00:42:27,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:42:27,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26769 states. [2019-12-19 00:42:28,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26769 to 24702. [2019-12-19 00:42:28,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24702 states. [2019-12-19 00:42:28,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24702 states to 24702 states and 71782 transitions. [2019-12-19 00:42:28,290 INFO L78 Accepts]: Start accepts. Automaton has 24702 states and 71782 transitions. Word has length 68 [2019-12-19 00:42:28,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:28,290 INFO L462 AbstractCegarLoop]: Abstraction has 24702 states and 71782 transitions. [2019-12-19 00:42:28,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:42:28,290 INFO L276 IsEmpty]: Start isEmpty. Operand 24702 states and 71782 transitions. [2019-12-19 00:42:28,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:42:28,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:28,299 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] [2019-12-19 00:42:28,299 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:28,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:28,299 INFO L82 PathProgramCache]: Analyzing trace with hash -896570397, now seen corresponding path program 1 times [2019-12-19 00:42:28,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:28,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27293687] [2019-12-19 00:42:28,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:28,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:28,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27293687] [2019-12-19 00:42:28,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:28,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 00:42:28,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140544919] [2019-12-19 00:42:28,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 00:42:28,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:28,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 00:42:28,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-19 00:42:28,434 INFO L87 Difference]: Start difference. First operand 24702 states and 71782 transitions. Second operand 9 states. [2019-12-19 00:42:29,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:29,303 INFO L93 Difference]: Finished difference Result 30982 states and 89506 transitions. [2019-12-19 00:42:29,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 00:42:29,303 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-12-19 00:42:29,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:29,353 INFO L225 Difference]: With dead ends: 30982 [2019-12-19 00:42:29,354 INFO L226 Difference]: Without dead ends: 30982 [2019-12-19 00:42:29,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-19 00:42:29,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30982 states. [2019-12-19 00:42:29,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30982 to 27343. [2019-12-19 00:42:29,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27343 states. [2019-12-19 00:42:29,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27343 states to 27343 states and 79281 transitions. [2019-12-19 00:42:29,749 INFO L78 Accepts]: Start accepts. Automaton has 27343 states and 79281 transitions. Word has length 68 [2019-12-19 00:42:29,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:29,750 INFO L462 AbstractCegarLoop]: Abstraction has 27343 states and 79281 transitions. [2019-12-19 00:42:29,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 00:42:29,750 INFO L276 IsEmpty]: Start isEmpty. Operand 27343 states and 79281 transitions. [2019-12-19 00:42:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:42:29,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:29,759 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] [2019-12-19 00:42:29,759 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:29,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:29,760 INFO L82 PathProgramCache]: Analyzing trace with hash -9066716, now seen corresponding path program 1 times [2019-12-19 00:42:29,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:29,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836852412] [2019-12-19 00:42:29,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:29,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 00:42:29,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836852412] [2019-12-19 00:42:29,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:29,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:42:29,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503611692] [2019-12-19 00:42:29,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:42:29,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:29,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:42:29,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:42:29,834 INFO L87 Difference]: Start difference. First operand 27343 states and 79281 transitions. Second operand 5 states. [2019-12-19 00:42:29,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:29,888 INFO L93 Difference]: Finished difference Result 7438 states and 17579 transitions. [2019-12-19 00:42:29,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 00:42:29,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-19 00:42:29,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:29,897 INFO L225 Difference]: With dead ends: 7438 [2019-12-19 00:42:29,897 INFO L226 Difference]: Without dead ends: 6196 [2019-12-19 00:42:29,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:42:29,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6196 states. [2019-12-19 00:42:29,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6196 to 5051. [2019-12-19 00:42:29,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5051 states. [2019-12-19 00:42:29,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5051 states to 5051 states and 11647 transitions. [2019-12-19 00:42:29,951 INFO L78 Accepts]: Start accepts. Automaton has 5051 states and 11647 transitions. Word has length 68 [2019-12-19 00:42:29,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:29,951 INFO L462 AbstractCegarLoop]: Abstraction has 5051 states and 11647 transitions. [2019-12-19 00:42:29,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:42:29,951 INFO L276 IsEmpty]: Start isEmpty. Operand 5051 states and 11647 transitions. [2019-12-19 00:42:29,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 00:42:29,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:29,955 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] [2019-12-19 00:42:29,955 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:29,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:29,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1271293831, now seen corresponding path program 1 times [2019-12-19 00:42:29,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:29,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740942105] [2019-12-19 00:42:29,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:29,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:29,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740942105] [2019-12-19 00:42:29,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:29,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:42:29,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789577774] [2019-12-19 00:42:29,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:42:29,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:29,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:42:29,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:42:29,982 INFO L87 Difference]: Start difference. First operand 5051 states and 11647 transitions. Second operand 3 states. [2019-12-19 00:42:30,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:30,024 INFO L93 Difference]: Finished difference Result 6708 states and 15325 transitions. [2019-12-19 00:42:30,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:42:30,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-19 00:42:30,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:30,033 INFO L225 Difference]: With dead ends: 6708 [2019-12-19 00:42:30,034 INFO L226 Difference]: Without dead ends: 6708 [2019-12-19 00:42:30,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:42:30,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6708 states. [2019-12-19 00:42:30,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6708 to 4999. [2019-12-19 00:42:30,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4999 states. [2019-12-19 00:42:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4999 states to 4999 states and 11249 transitions. [2019-12-19 00:42:30,093 INFO L78 Accepts]: Start accepts. Automaton has 4999 states and 11249 transitions. Word has length 68 [2019-12-19 00:42:30,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:30,093 INFO L462 AbstractCegarLoop]: Abstraction has 4999 states and 11249 transitions. [2019-12-19 00:42:30,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:42:30,093 INFO L276 IsEmpty]: Start isEmpty. Operand 4999 states and 11249 transitions. [2019-12-19 00:42:30,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-19 00:42:30,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:30,100 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] [2019-12-19 00:42:30,100 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:30,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:30,101 INFO L82 PathProgramCache]: Analyzing trace with hash 186991737, now seen corresponding path program 1 times [2019-12-19 00:42:30,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:30,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434158248] [2019-12-19 00:42:30,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:30,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:30,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434158248] [2019-12-19 00:42:30,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:30,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:42:30,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106871771] [2019-12-19 00:42:30,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:42:30,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:30,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:42:30,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:42:30,172 INFO L87 Difference]: Start difference. First operand 4999 states and 11249 transitions. Second operand 7 states. [2019-12-19 00:42:30,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:30,673 INFO L93 Difference]: Finished difference Result 5810 states and 12970 transitions. [2019-12-19 00:42:30,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 00:42:30,674 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2019-12-19 00:42:30,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:30,681 INFO L225 Difference]: With dead ends: 5810 [2019-12-19 00:42:30,681 INFO L226 Difference]: Without dead ends: 5757 [2019-12-19 00:42:30,682 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 00:42:30,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5757 states. [2019-12-19 00:42:30,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5757 to 5015. [2019-12-19 00:42:30,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5015 states. [2019-12-19 00:42:30,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5015 states to 5015 states and 11212 transitions. [2019-12-19 00:42:30,731 INFO L78 Accepts]: Start accepts. Automaton has 5015 states and 11212 transitions. Word has length 74 [2019-12-19 00:42:30,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:30,731 INFO L462 AbstractCegarLoop]: Abstraction has 5015 states and 11212 transitions. [2019-12-19 00:42:30,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:42:30,731 INFO L276 IsEmpty]: Start isEmpty. Operand 5015 states and 11212 transitions. [2019-12-19 00:42:30,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 00:42:30,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:30,735 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] [2019-12-19 00:42:30,736 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:30,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:30,736 INFO L82 PathProgramCache]: Analyzing trace with hash 316232134, now seen corresponding path program 1 times [2019-12-19 00:42:30,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:30,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103365359] [2019-12-19 00:42:30,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:30,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:30,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103365359] [2019-12-19 00:42:30,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:30,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 00:42:30,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719745367] [2019-12-19 00:42:30,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 00:42:30,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:30,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 00:42:30,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:42:30,790 INFO L87 Difference]: Start difference. First operand 5015 states and 11212 transitions. Second operand 3 states. [2019-12-19 00:42:30,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:30,955 INFO L93 Difference]: Finished difference Result 6355 states and 13991 transitions. [2019-12-19 00:42:30,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 00:42:30,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-12-19 00:42:30,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:30,963 INFO L225 Difference]: With dead ends: 6355 [2019-12-19 00:42:30,963 INFO L226 Difference]: Without dead ends: 6355 [2019-12-19 00:42:30,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 00:42:30,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6355 states. [2019-12-19 00:42:31,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6355 to 5918. [2019-12-19 00:42:31,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5918 states. [2019-12-19 00:42:31,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5918 states to 5918 states and 13072 transitions. [2019-12-19 00:42:31,020 INFO L78 Accepts]: Start accepts. Automaton has 5918 states and 13072 transitions. Word has length 93 [2019-12-19 00:42:31,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:31,020 INFO L462 AbstractCegarLoop]: Abstraction has 5918 states and 13072 transitions. [2019-12-19 00:42:31,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 00:42:31,020 INFO L276 IsEmpty]: Start isEmpty. Operand 5918 states and 13072 transitions. [2019-12-19 00:42:31,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 00:42:31,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:31,026 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] [2019-12-19 00:42:31,026 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:31,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:31,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1415085423, now seen corresponding path program 1 times [2019-12-19 00:42:31,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:31,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235957879] [2019-12-19 00:42:31,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:31,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:31,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235957879] [2019-12-19 00:42:31,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:31,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 00:42:31,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845540325] [2019-12-19 00:42:31,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 00:42:31,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:31,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 00:42:31,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 00:42:31,095 INFO L87 Difference]: Start difference. First operand 5918 states and 13072 transitions. Second operand 4 states. [2019-12-19 00:42:31,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:31,217 INFO L93 Difference]: Finished difference Result 6314 states and 13994 transitions. [2019-12-19 00:42:31,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 00:42:31,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-12-19 00:42:31,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:31,223 INFO L225 Difference]: With dead ends: 6314 [2019-12-19 00:42:31,223 INFO L226 Difference]: Without dead ends: 6314 [2019-12-19 00:42:31,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:42:31,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6314 states. [2019-12-19 00:42:31,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6314 to 5757. [2019-12-19 00:42:31,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5757 states. [2019-12-19 00:42:31,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 12813 transitions. [2019-12-19 00:42:31,279 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 12813 transitions. Word has length 93 [2019-12-19 00:42:31,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:31,279 INFO L462 AbstractCegarLoop]: Abstraction has 5757 states and 12813 transitions. [2019-12-19 00:42:31,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 00:42:31,279 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 12813 transitions. [2019-12-19 00:42:31,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 00:42:31,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:31,284 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] [2019-12-19 00:42:31,284 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:31,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:31,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1096662197, now seen corresponding path program 1 times [2019-12-19 00:42:31,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:31,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321898292] [2019-12-19 00:42:31,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:31,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:31,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321898292] [2019-12-19 00:42:31,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:31,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:42:31,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469414371] [2019-12-19 00:42:31,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:42:31,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:31,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:42:31,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:42:31,358 INFO L87 Difference]: Start difference. First operand 5757 states and 12813 transitions. Second operand 5 states. [2019-12-19 00:42:32,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:32,068 INFO L93 Difference]: Finished difference Result 12046 states and 26381 transitions. [2019-12-19 00:42:32,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 00:42:32,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-19 00:42:32,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:32,086 INFO L225 Difference]: With dead ends: 12046 [2019-12-19 00:42:32,086 INFO L226 Difference]: Without dead ends: 12032 [2019-12-19 00:42:32,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-19 00:42:32,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12032 states. [2019-12-19 00:42:32,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12032 to 7935. [2019-12-19 00:42:32,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7935 states. [2019-12-19 00:42:32,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7935 states to 7935 states and 17552 transitions. [2019-12-19 00:42:32,267 INFO L78 Accepts]: Start accepts. Automaton has 7935 states and 17552 transitions. Word has length 95 [2019-12-19 00:42:32,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:32,268 INFO L462 AbstractCegarLoop]: Abstraction has 7935 states and 17552 transitions. [2019-12-19 00:42:32,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:42:32,268 INFO L276 IsEmpty]: Start isEmpty. Operand 7935 states and 17552 transitions. [2019-12-19 00:42:32,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 00:42:32,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:32,284 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] [2019-12-19 00:42:32,284 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:32,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:32,285 INFO L82 PathProgramCache]: Analyzing trace with hash 148102284, now seen corresponding path program 1 times [2019-12-19 00:42:32,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:32,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466050617] [2019-12-19 00:42:32,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:32,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:32,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466050617] [2019-12-19 00:42:32,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:32,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:42:32,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468384385] [2019-12-19 00:42:32,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:42:32,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:32,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:42:32,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:42:32,383 INFO L87 Difference]: Start difference. First operand 7935 states and 17552 transitions. Second operand 6 states. [2019-12-19 00:42:32,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:32,954 INFO L93 Difference]: Finished difference Result 10055 states and 22088 transitions. [2019-12-19 00:42:32,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 00:42:32,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-19 00:42:32,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:32,971 INFO L225 Difference]: With dead ends: 10055 [2019-12-19 00:42:32,972 INFO L226 Difference]: Without dead ends: 10055 [2019-12-19 00:42:32,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 00:42:32,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10055 states. [2019-12-19 00:42:33,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10055 to 7937. [2019-12-19 00:42:33,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7937 states. [2019-12-19 00:42:33,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7937 states to 7937 states and 17521 transitions. [2019-12-19 00:42:33,137 INFO L78 Accepts]: Start accepts. Automaton has 7937 states and 17521 transitions. Word has length 95 [2019-12-19 00:42:33,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:33,137 INFO L462 AbstractCegarLoop]: Abstraction has 7937 states and 17521 transitions. [2019-12-19 00:42:33,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:42:33,138 INFO L276 IsEmpty]: Start isEmpty. Operand 7937 states and 17521 transitions. [2019-12-19 00:42:33,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 00:42:33,148 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:33,149 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] [2019-12-19 00:42:33,149 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:33,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:33,149 INFO L82 PathProgramCache]: Analyzing trace with hash -2039041963, now seen corresponding path program 1 times [2019-12-19 00:42:33,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:33,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178393453] [2019-12-19 00:42:33,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:33,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:33,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178393453] [2019-12-19 00:42:33,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:33,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-19 00:42:33,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648451803] [2019-12-19 00:42:33,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-19 00:42:33,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:33,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-19 00:42:33,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-19 00:42:33,304 INFO L87 Difference]: Start difference. First operand 7937 states and 17521 transitions. Second operand 9 states. [2019-12-19 00:42:34,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:34,224 INFO L93 Difference]: Finished difference Result 10174 states and 22470 transitions. [2019-12-19 00:42:34,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-19 00:42:34,225 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-12-19 00:42:34,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:34,238 INFO L225 Difference]: With dead ends: 10174 [2019-12-19 00:42:34,238 INFO L226 Difference]: Without dead ends: 10156 [2019-12-19 00:42:34,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-12-19 00:42:34,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10156 states. [2019-12-19 00:42:34,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10156 to 9171. [2019-12-19 00:42:34,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9171 states. [2019-12-19 00:42:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9171 states to 9171 states and 20276 transitions. [2019-12-19 00:42:34,349 INFO L78 Accepts]: Start accepts. Automaton has 9171 states and 20276 transitions. Word has length 95 [2019-12-19 00:42:34,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:34,350 INFO L462 AbstractCegarLoop]: Abstraction has 9171 states and 20276 transitions. [2019-12-19 00:42:34,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-19 00:42:34,350 INFO L276 IsEmpty]: Start isEmpty. Operand 9171 states and 20276 transitions. [2019-12-19 00:42:34,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 00:42:34,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:34,361 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] [2019-12-19 00:42:34,361 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:34,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:34,361 INFO L82 PathProgramCache]: Analyzing trace with hash 458973974, now seen corresponding path program 1 times [2019-12-19 00:42:34,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:34,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278575989] [2019-12-19 00:42:34,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:34,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278575989] [2019-12-19 00:42:34,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:34,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 00:42:34,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93467780] [2019-12-19 00:42:34,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 00:42:34,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:34,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 00:42:34,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:42:34,478 INFO L87 Difference]: Start difference. First operand 9171 states and 20276 transitions. Second operand 8 states. [2019-12-19 00:42:35,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:35,164 INFO L93 Difference]: Finished difference Result 14959 states and 33331 transitions. [2019-12-19 00:42:35,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 00:42:35,164 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-19 00:42:35,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:35,182 INFO L225 Difference]: With dead ends: 14959 [2019-12-19 00:42:35,182 INFO L226 Difference]: Without dead ends: 14959 [2019-12-19 00:42:35,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-19 00:42:35,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14959 states. [2019-12-19 00:42:35,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14959 to 9554. [2019-12-19 00:42:35,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9554 states. [2019-12-19 00:42:35,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9554 states to 9554 states and 21229 transitions. [2019-12-19 00:42:35,309 INFO L78 Accepts]: Start accepts. Automaton has 9554 states and 21229 transitions. Word has length 95 [2019-12-19 00:42:35,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:35,310 INFO L462 AbstractCegarLoop]: Abstraction has 9554 states and 21229 transitions. [2019-12-19 00:42:35,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 00:42:35,310 INFO L276 IsEmpty]: Start isEmpty. Operand 9554 states and 21229 transitions. [2019-12-19 00:42:35,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 00:42:35,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:35,318 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] [2019-12-19 00:42:35,318 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:35,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:35,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1346477655, now seen corresponding path program 1 times [2019-12-19 00:42:35,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:35,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162608279] [2019-12-19 00:42:35,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:35,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:35,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162608279] [2019-12-19 00:42:35,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:35,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 00:42:35,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991447012] [2019-12-19 00:42:35,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 00:42:35,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:35,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 00:42:35,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 00:42:35,457 INFO L87 Difference]: Start difference. First operand 9554 states and 21229 transitions. Second operand 7 states. [2019-12-19 00:42:35,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:35,633 INFO L93 Difference]: Finished difference Result 9634 states and 21541 transitions. [2019-12-19 00:42:35,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 00:42:35,633 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-19 00:42:35,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:35,642 INFO L225 Difference]: With dead ends: 9634 [2019-12-19 00:42:35,642 INFO L226 Difference]: Without dead ends: 9634 [2019-12-19 00:42:35,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-19 00:42:35,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9634 states. [2019-12-19 00:42:35,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9634 to 7355. [2019-12-19 00:42:35,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7355 states. [2019-12-19 00:42:35,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7355 states to 7355 states and 16376 transitions. [2019-12-19 00:42:35,725 INFO L78 Accepts]: Start accepts. Automaton has 7355 states and 16376 transitions. Word has length 95 [2019-12-19 00:42:35,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:35,726 INFO L462 AbstractCegarLoop]: Abstraction has 7355 states and 16376 transitions. [2019-12-19 00:42:35,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 00:42:35,726 INFO L276 IsEmpty]: Start isEmpty. Operand 7355 states and 16376 transitions. [2019-12-19 00:42:35,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 00:42:35,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:35,733 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] [2019-12-19 00:42:35,733 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:35,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:35,733 INFO L82 PathProgramCache]: Analyzing trace with hash -385497897, now seen corresponding path program 1 times [2019-12-19 00:42:35,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:35,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408383749] [2019-12-19 00:42:35,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:35,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408383749] [2019-12-19 00:42:35,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:35,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 00:42:35,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723805285] [2019-12-19 00:42:35,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 00:42:35,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:35,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 00:42:35,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:42:35,826 INFO L87 Difference]: Start difference. First operand 7355 states and 16376 transitions. Second operand 6 states. [2019-12-19 00:42:35,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:35,945 INFO L93 Difference]: Finished difference Result 7085 states and 15602 transitions. [2019-12-19 00:42:35,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 00:42:35,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-19 00:42:35,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:35,954 INFO L225 Difference]: With dead ends: 7085 [2019-12-19 00:42:35,954 INFO L226 Difference]: Without dead ends: 7085 [2019-12-19 00:42:35,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 00:42:35,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7085 states. [2019-12-19 00:42:36,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7085 to 4422. [2019-12-19 00:42:36,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4422 states. [2019-12-19 00:42:36,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4422 states to 4422 states and 9758 transitions. [2019-12-19 00:42:36,021 INFO L78 Accepts]: Start accepts. Automaton has 4422 states and 9758 transitions. Word has length 95 [2019-12-19 00:42:36,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:36,022 INFO L462 AbstractCegarLoop]: Abstraction has 4422 states and 9758 transitions. [2019-12-19 00:42:36,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 00:42:36,022 INFO L276 IsEmpty]: Start isEmpty. Operand 4422 states and 9758 transitions. [2019-12-19 00:42:36,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 00:42:36,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:36,026 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:42:36,026 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:36,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:36,026 INFO L82 PathProgramCache]: Analyzing trace with hash 881537949, now seen corresponding path program 1 times [2019-12-19 00:42:36,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:36,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982369063] [2019-12-19 00:42:36,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:36,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:36,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982369063] [2019-12-19 00:42:36,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:36,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 00:42:36,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393540182] [2019-12-19 00:42:36,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 00:42:36,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:36,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 00:42:36,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 00:42:36,125 INFO L87 Difference]: Start difference. First operand 4422 states and 9758 transitions. Second operand 5 states. [2019-12-19 00:42:36,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:36,177 INFO L93 Difference]: Finished difference Result 4422 states and 9749 transitions. [2019-12-19 00:42:36,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 00:42:36,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-12-19 00:42:36,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:36,186 INFO L225 Difference]: With dead ends: 4422 [2019-12-19 00:42:36,186 INFO L226 Difference]: Without dead ends: 4422 [2019-12-19 00:42:36,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-19 00:42:36,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4422 states. [2019-12-19 00:42:36,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4422 to 4422. [2019-12-19 00:42:36,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4422 states. [2019-12-19 00:42:36,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4422 states to 4422 states and 9749 transitions. [2019-12-19 00:42:36,265 INFO L78 Accepts]: Start accepts. Automaton has 4422 states and 9749 transitions. Word has length 97 [2019-12-19 00:42:36,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:36,266 INFO L462 AbstractCegarLoop]: Abstraction has 4422 states and 9749 transitions. [2019-12-19 00:42:36,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 00:42:36,266 INFO L276 IsEmpty]: Start isEmpty. Operand 4422 states and 9749 transitions. [2019-12-19 00:42:36,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 00:42:36,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:36,275 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:42:36,275 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:36,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:36,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1769041630, now seen corresponding path program 1 times [2019-12-19 00:42:36,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:36,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397551401] [2019-12-19 00:42:36,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 00:42:36,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 00:42:36,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397551401] [2019-12-19 00:42:36,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 00:42:36,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-19 00:42:36,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294889518] [2019-12-19 00:42:36,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-19 00:42:36,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 00:42:36,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-19 00:42:36,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-19 00:42:36,454 INFO L87 Difference]: Start difference. First operand 4422 states and 9749 transitions. Second operand 10 states. [2019-12-19 00:42:36,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 00:42:36,984 INFO L93 Difference]: Finished difference Result 14844 states and 33432 transitions. [2019-12-19 00:42:36,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-19 00:42:36,984 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-19 00:42:36,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 00:42:36,999 INFO L225 Difference]: With dead ends: 14844 [2019-12-19 00:42:36,999 INFO L226 Difference]: Without dead ends: 9899 [2019-12-19 00:42:37,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-19 00:42:37,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9899 states. [2019-12-19 00:42:37,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9899 to 4516. [2019-12-19 00:42:37,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4516 states. [2019-12-19 00:42:37,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4516 states to 4516 states and 9884 transitions. [2019-12-19 00:42:37,097 INFO L78 Accepts]: Start accepts. Automaton has 4516 states and 9884 transitions. Word has length 97 [2019-12-19 00:42:37,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 00:42:37,097 INFO L462 AbstractCegarLoop]: Abstraction has 4516 states and 9884 transitions. [2019-12-19 00:42:37,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-19 00:42:37,097 INFO L276 IsEmpty]: Start isEmpty. Operand 4516 states and 9884 transitions. [2019-12-19 00:42:37,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-19 00:42:37,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 00:42:37,103 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 00:42:37,103 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 00:42:37,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 00:42:37,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1980984750, now seen corresponding path program 2 times [2019-12-19 00:42:37,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 00:42:37,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166033698] [2019-12-19 00:42:37,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 00:42:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 00:42:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 00:42:37,274 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 00:42:37,274 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 00:42:37,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 12:42:37 BasicIcfg [2019-12-19 00:42:37,542 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 00:42:37,545 INFO L168 Benchmark]: Toolchain (without parser) took 51020.50 ms. Allocated memory was 146.8 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 103.2 MB in the beginning and 1.0 GB in the end (delta: -930.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-19 00:42:37,546 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-19 00:42:37,547 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.50 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 103.0 MB in the beginning and 159.4 MB in the end (delta: -56.4 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-19 00:42:37,553 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.96 ms. Allocated memory is still 205.0 MB. Free memory was 159.4 MB in the beginning and 156.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-19 00:42:37,554 INFO L168 Benchmark]: Boogie Preprocessor took 42.54 ms. Allocated memory is still 205.0 MB. Free memory was 156.7 MB in the beginning and 154.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-19 00:42:37,554 INFO L168 Benchmark]: RCFGBuilder took 729.75 ms. Allocated memory is still 205.0 MB. Free memory was 154.7 MB in the beginning and 109.9 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. [2019-12-19 00:42:37,555 INFO L168 Benchmark]: TraceAbstraction took 49404.44 ms. Allocated memory was 205.0 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 109.9 MB in the beginning and 1.0 GB in the end (delta: -923.4 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-19 00:42:37,558 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 778.50 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 103.0 MB in the beginning and 159.4 MB in the end (delta: -56.4 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.96 ms. Allocated memory is still 205.0 MB. Free memory was 159.4 MB in the beginning and 156.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.54 ms. Allocated memory is still 205.0 MB. Free memory was 156.7 MB in the beginning and 154.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 729.75 ms. Allocated memory is still 205.0 MB. Free memory was 154.7 MB in the beginning and 109.9 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 49404.44 ms. Allocated memory was 205.0 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 109.9 MB in the beginning and 1.0 GB in the end (delta: -923.4 MB). Peak memory consumption was 1.4 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L700] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L701] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L702] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L704] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L707] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L708] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L709] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L710] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L711] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L712] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L713] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L714] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L715] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L716] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L717] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L718] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L719] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L720] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 pthread_t t305; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] FCALL, FORK 0 pthread_create(&t305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L732] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L733] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L734] 1 y$r_buff0_thd1 = (_Bool)1 [L737] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 pthread_t t306; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L801] FCALL, FORK 0 pthread_create(&t306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L744] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L770] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y = y$flush_delayed ? y$mem_tmp : y [L773] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L807] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L808] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L814] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 48.9s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 21.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8850 SDtfs, 9485 SDslu, 20413 SDs, 0 SdLazy, 8720 SolverSat, 549 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 90 SyntacticMatches, 14 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71013occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 88275 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2309 NumberOfCodeBlocks, 2309 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2181 ConstructedInterpolants, 0 QuantifiedInterpolants, 439879 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...