/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-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix032_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:16:14,345 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:16:14,348 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:16:14,365 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:16:14,366 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:16:14,368 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:16:14,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:16:14,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:16:14,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:16:14,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:16:14,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:16:14,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:16:14,390 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:16:14,391 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:16:14,392 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:16:14,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:16:14,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:16:14,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:16:14,399 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:16:14,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:16:14,409 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:16:14,412 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:16:14,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:16:14,413 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:16:14,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:16:14,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:16:14,417 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:16:14,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:16:14,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:16:14,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:16:14,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:16:14,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:16:14,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:16:14,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:16:14,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:16:14,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:16:14,427 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:16:14,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:16:14,428 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:16:14,429 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:16:14,430 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:16:14,431 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-SemanticLbe.epf [2019-12-27 02:16:14,448 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:16:14,448 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:16:14,449 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:16:14,449 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:16:14,449 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:16:14,450 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:16:14,450 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:16:14,450 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:16:14,450 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:16:14,450 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:16:14,450 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:16:14,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:16:14,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:16:14,451 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:16:14,451 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:16:14,451 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:16:14,452 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:16:14,452 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:16:14,452 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:16:14,452 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:16:14,452 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:16:14,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:16:14,453 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:16:14,453 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:16:14,453 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:16:14,453 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:16:14,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:16:14,454 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:16:14,454 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:16:14,710 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:16:14,722 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:16:14,726 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:16:14,727 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:16:14,727 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:16:14,728 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_rmo.oepc.i [2019-12-27 02:16:14,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68232ae2c/d5dd27461d3d4767b1aad0f99a85244b/FLAGd613e779c [2019-12-27 02:16:15,302 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:16:15,302 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_rmo.oepc.i [2019-12-27 02:16:15,325 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68232ae2c/d5dd27461d3d4767b1aad0f99a85244b/FLAGd613e779c [2019-12-27 02:16:15,580 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68232ae2c/d5dd27461d3d4767b1aad0f99a85244b [2019-12-27 02:16:15,588 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:16:15,590 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:16:15,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:16:15,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:16:15,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:16:15,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:16:15" (1/1) ... [2019-12-27 02:16:15,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42951733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:15, skipping insertion in model container [2019-12-27 02:16:15,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:16:15" (1/1) ... [2019-12-27 02:16:15,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:16:15,662 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:16:16,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:16:16,215 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:16:16,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:16:16,357 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:16:16,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:16 WrapperNode [2019-12-27 02:16:16,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:16:16,359 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:16:16,359 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:16:16,359 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:16:16,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:16" (1/1) ... [2019-12-27 02:16:16,389 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:16" (1/1) ... [2019-12-27 02:16:16,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:16:16,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:16:16,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:16:16,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:16:16,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:16" (1/1) ... [2019-12-27 02:16:16,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:16" (1/1) ... [2019-12-27 02:16:16,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:16" (1/1) ... [2019-12-27 02:16:16,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:16" (1/1) ... [2019-12-27 02:16:16,449 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:16" (1/1) ... [2019-12-27 02:16:16,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:16" (1/1) ... [2019-12-27 02:16:16,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:16" (1/1) ... [2019-12-27 02:16:16,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:16:16,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:16:16,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:16:16,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:16:16,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:16" (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-27 02:16:16,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:16:16,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:16:16,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:16:16,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:16:16,523 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:16:16,523 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:16:16,523 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:16:16,523 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:16:16,523 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:16:16,523 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:16:16,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:16:16,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:16:16,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:16:16,526 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:16:17,284 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:16:17,284 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:16:17,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:16:17 BoogieIcfgContainer [2019-12-27 02:16:17,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:16:17,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:16:17,287 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:16:17,289 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:16:17,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:16:15" (1/3) ... [2019-12-27 02:16:17,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218d39e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:16:17, skipping insertion in model container [2019-12-27 02:16:17,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:16:16" (2/3) ... [2019-12-27 02:16:17,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218d39e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:16:17, skipping insertion in model container [2019-12-27 02:16:17,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:16:17" (3/3) ... [2019-12-27 02:16:17,293 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_rmo.oepc.i [2019-12-27 02:16:17,304 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:16:17,304 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:16:17,312 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:16:17,313 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:16:17,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,357 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,357 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,357 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,358 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,358 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,385 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,386 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,387 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,390 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,397 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,398 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,415 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,415 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,424 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,427 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,428 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,435 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,436 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,437 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,438 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,439 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,440 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,455 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,456 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,459 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,460 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,465 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,465 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,466 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,467 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,467 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,468 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,472 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,473 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,473 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,474 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,474 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,474 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:16:17,494 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 02:16:17,514 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:16:17,515 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:16:17,515 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:16:17,515 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:16:17,515 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:16:17,515 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:16:17,515 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:16:17,515 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:16:17,530 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-27 02:16:17,532 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 02:16:17,636 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 02:16:17,637 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:16:17,654 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:16:17,678 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 02:16:17,733 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 02:16:17,734 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:16:17,742 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 02:16:17,763 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 02:16:17,764 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:16:23,102 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 02:16:23,249 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 02:16:23,284 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83556 [2019-12-27 02:16:23,284 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-27 02:16:23,288 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 105 transitions [2019-12-27 02:16:45,708 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129602 states. [2019-12-27 02:16:45,710 INFO L276 IsEmpty]: Start isEmpty. Operand 129602 states. [2019-12-27 02:16:45,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 02:16:45,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:16:45,717 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 02:16:45,717 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:16:45,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:16:45,723 INFO L82 PathProgramCache]: Analyzing trace with hash 923865, now seen corresponding path program 1 times [2019-12-27 02:16:45,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:16:45,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266554379] [2019-12-27 02:16:45,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:16:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:16:45,939 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-27 02:16:45,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266554379] [2019-12-27 02:16:45,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:16:45,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:16:45,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207698144] [2019-12-27 02:16:45,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:16:45,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:16:45,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:16:45,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:16:45,965 INFO L87 Difference]: Start difference. First operand 129602 states. Second operand 3 states. [2019-12-27 02:16:50,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:16:50,021 INFO L93 Difference]: Finished difference Result 128376 states and 546782 transitions. [2019-12-27 02:16:50,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:16:50,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 02:16:50,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:16:50,729 INFO L225 Difference]: With dead ends: 128376 [2019-12-27 02:16:50,729 INFO L226 Difference]: Without dead ends: 120914 [2019-12-27 02:16:50,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-27 02:16:56,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120914 states. [2019-12-27 02:17:00,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120914 to 120914. [2019-12-27 02:17:00,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120914 states. [2019-12-27 02:17:04,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120914 states to 120914 states and 514358 transitions. [2019-12-27 02:17:04,819 INFO L78 Accepts]: Start accepts. Automaton has 120914 states and 514358 transitions. Word has length 3 [2019-12-27 02:17:04,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:04,819 INFO L462 AbstractCegarLoop]: Abstraction has 120914 states and 514358 transitions. [2019-12-27 02:17:04,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:17:04,820 INFO L276 IsEmpty]: Start isEmpty. Operand 120914 states and 514358 transitions. [2019-12-27 02:17:04,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:17:04,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:04,824 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:04,825 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:04,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:04,825 INFO L82 PathProgramCache]: Analyzing trace with hash 2102120012, now seen corresponding path program 1 times [2019-12-27 02:17:04,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:04,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659990446] [2019-12-27 02:17:04,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:04,984 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-27 02:17:04,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659990446] [2019-12-27 02:17:04,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:04,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:17:04,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147624080] [2019-12-27 02:17:04,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:17:04,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:04,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:17:04,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:17:04,989 INFO L87 Difference]: Start difference. First operand 120914 states and 514358 transitions. Second operand 4 states. [2019-12-27 02:17:11,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:11,445 INFO L93 Difference]: Finished difference Result 187704 states and 768206 transitions. [2019-12-27 02:17:11,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:17:11,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 02:17:11,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:12,173 INFO L225 Difference]: With dead ends: 187704 [2019-12-27 02:17:12,173 INFO L226 Difference]: Without dead ends: 187655 [2019-12-27 02:17:12,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-27 02:17:18,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187655 states. [2019-12-27 02:17:22,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187655 to 171775. [2019-12-27 02:17:22,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171775 states. [2019-12-27 02:17:23,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171775 states to 171775 states and 711726 transitions. [2019-12-27 02:17:23,153 INFO L78 Accepts]: Start accepts. Automaton has 171775 states and 711726 transitions. Word has length 11 [2019-12-27 02:17:23,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:23,154 INFO L462 AbstractCegarLoop]: Abstraction has 171775 states and 711726 transitions. [2019-12-27 02:17:23,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:17:23,154 INFO L276 IsEmpty]: Start isEmpty. Operand 171775 states and 711726 transitions. [2019-12-27 02:17:23,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 02:17:23,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:23,160 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:23,160 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:23,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:23,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1617299066, now seen corresponding path program 1 times [2019-12-27 02:17:23,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:23,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226709366] [2019-12-27 02:17:23,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:23,213 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-27 02:17:23,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226709366] [2019-12-27 02:17:23,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:23,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:17:23,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254110277] [2019-12-27 02:17:23,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:17:23,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:23,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:17:23,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:23,216 INFO L87 Difference]: Start difference. First operand 171775 states and 711726 transitions. Second operand 3 states. [2019-12-27 02:17:23,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:23,361 INFO L93 Difference]: Finished difference Result 36261 states and 117727 transitions. [2019-12-27 02:17:23,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:17:23,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 02:17:23,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:23,419 INFO L225 Difference]: With dead ends: 36261 [2019-12-27 02:17:23,420 INFO L226 Difference]: Without dead ends: 36261 [2019-12-27 02:17:23,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-27 02:17:23,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36261 states. [2019-12-27 02:17:29,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36261 to 36261. [2019-12-27 02:17:29,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36261 states. [2019-12-27 02:17:29,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36261 states to 36261 states and 117727 transitions. [2019-12-27 02:17:29,137 INFO L78 Accepts]: Start accepts. Automaton has 36261 states and 117727 transitions. Word has length 13 [2019-12-27 02:17:29,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:29,137 INFO L462 AbstractCegarLoop]: Abstraction has 36261 states and 117727 transitions. [2019-12-27 02:17:29,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:17:29,137 INFO L276 IsEmpty]: Start isEmpty. Operand 36261 states and 117727 transitions. [2019-12-27 02:17:29,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:17:29,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:29,140 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:29,141 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:29,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:29,141 INFO L82 PathProgramCache]: Analyzing trace with hash 947448332, now seen corresponding path program 1 times [2019-12-27 02:17:29,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:29,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577887784] [2019-12-27 02:17:29,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:29,228 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-27 02:17:29,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577887784] [2019-12-27 02:17:29,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:29,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:17:29,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722330808] [2019-12-27 02:17:29,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:17:29,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:29,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:17:29,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:17:29,230 INFO L87 Difference]: Start difference. First operand 36261 states and 117727 transitions. Second operand 5 states. [2019-12-27 02:17:29,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:29,774 INFO L93 Difference]: Finished difference Result 50300 states and 161544 transitions. [2019-12-27 02:17:29,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:17:29,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 02:17:29,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:29,856 INFO L225 Difference]: With dead ends: 50300 [2019-12-27 02:17:29,856 INFO L226 Difference]: Without dead ends: 50300 [2019-12-27 02:17:29,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-27 02:17:30,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50300 states. [2019-12-27 02:17:30,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50300 to 43029. [2019-12-27 02:17:30,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43029 states. [2019-12-27 02:17:31,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43029 states to 43029 states and 139308 transitions. [2019-12-27 02:17:31,198 INFO L78 Accepts]: Start accepts. Automaton has 43029 states and 139308 transitions. Word has length 16 [2019-12-27 02:17:31,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:31,200 INFO L462 AbstractCegarLoop]: Abstraction has 43029 states and 139308 transitions. [2019-12-27 02:17:31,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:17:31,200 INFO L276 IsEmpty]: Start isEmpty. Operand 43029 states and 139308 transitions. [2019-12-27 02:17:31,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 02:17:31,210 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:31,210 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] [2019-12-27 02:17:31,210 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:31,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:31,210 INFO L82 PathProgramCache]: Analyzing trace with hash -282717849, now seen corresponding path program 1 times [2019-12-27 02:17:31,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:31,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61540197] [2019-12-27 02:17:31,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:31,348 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-27 02:17:31,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61540197] [2019-12-27 02:17:31,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:31,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:17:31,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394662307] [2019-12-27 02:17:31,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:17:31,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:31,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:17:31,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:17:31,351 INFO L87 Difference]: Start difference. First operand 43029 states and 139308 transitions. Second operand 6 states. [2019-12-27 02:17:32,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:32,276 INFO L93 Difference]: Finished difference Result 64122 states and 202692 transitions. [2019-12-27 02:17:32,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:17:32,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 02:17:32,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:32,381 INFO L225 Difference]: With dead ends: 64122 [2019-12-27 02:17:32,381 INFO L226 Difference]: Without dead ends: 64115 [2019-12-27 02:17:32,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:17:32,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64115 states. [2019-12-27 02:17:33,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64115 to 42953. [2019-12-27 02:17:33,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-27 02:17:33,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 138310 transitions. [2019-12-27 02:17:33,276 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 138310 transitions. Word has length 22 [2019-12-27 02:17:33,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:33,277 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 138310 transitions. [2019-12-27 02:17:33,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:17:33,277 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 138310 transitions. [2019-12-27 02:17:33,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 02:17:33,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:33,290 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] [2019-12-27 02:17:33,290 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:33,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:33,291 INFO L82 PathProgramCache]: Analyzing trace with hash -71664384, now seen corresponding path program 1 times [2019-12-27 02:17:33,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:33,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633251548] [2019-12-27 02:17:33,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:33,346 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-27 02:17:33,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633251548] [2019-12-27 02:17:33,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:33,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:17:33,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669370374] [2019-12-27 02:17:33,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:17:33,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:33,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:17:33,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:17:33,349 INFO L87 Difference]: Start difference. First operand 42953 states and 138310 transitions. Second operand 4 states. [2019-12-27 02:17:33,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:33,410 INFO L93 Difference]: Finished difference Result 17024 states and 51836 transitions. [2019-12-27 02:17:33,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:17:33,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 02:17:33,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:33,433 INFO L225 Difference]: With dead ends: 17024 [2019-12-27 02:17:33,433 INFO L226 Difference]: Without dead ends: 17024 [2019-12-27 02:17:33,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:17:33,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17024 states. [2019-12-27 02:17:33,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17024 to 16731. [2019-12-27 02:17:33,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16731 states. [2019-12-27 02:17:34,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16731 states to 16731 states and 51000 transitions. [2019-12-27 02:17:34,104 INFO L78 Accepts]: Start accepts. Automaton has 16731 states and 51000 transitions. Word has length 25 [2019-12-27 02:17:34,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:34,105 INFO L462 AbstractCegarLoop]: Abstraction has 16731 states and 51000 transitions. [2019-12-27 02:17:34,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:17:34,105 INFO L276 IsEmpty]: Start isEmpty. Operand 16731 states and 51000 transitions. [2019-12-27 02:17:34,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:17:34,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:34,117 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] [2019-12-27 02:17:34,117 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:34,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:34,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1418175430, now seen corresponding path program 1 times [2019-12-27 02:17:34,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:34,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275411255] [2019-12-27 02:17:34,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:34,163 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-27 02:17:34,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275411255] [2019-12-27 02:17:34,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:34,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:17:34,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501488503] [2019-12-27 02:17:34,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:17:34,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:34,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:17:34,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:34,165 INFO L87 Difference]: Start difference. First operand 16731 states and 51000 transitions. Second operand 3 states. [2019-12-27 02:17:34,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:34,280 INFO L93 Difference]: Finished difference Result 24375 states and 72822 transitions. [2019-12-27 02:17:34,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:17:34,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 02:17:34,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:34,312 INFO L225 Difference]: With dead ends: 24375 [2019-12-27 02:17:34,312 INFO L226 Difference]: Without dead ends: 24375 [2019-12-27 02:17:34,312 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-27 02:17:34,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24375 states. [2019-12-27 02:17:34,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24375 to 18589. [2019-12-27 02:17:34,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18589 states. [2019-12-27 02:17:34,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18589 states to 18589 states and 56096 transitions. [2019-12-27 02:17:34,642 INFO L78 Accepts]: Start accepts. Automaton has 18589 states and 56096 transitions. Word has length 27 [2019-12-27 02:17:34,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:34,643 INFO L462 AbstractCegarLoop]: Abstraction has 18589 states and 56096 transitions. [2019-12-27 02:17:34,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:17:34,643 INFO L276 IsEmpty]: Start isEmpty. Operand 18589 states and 56096 transitions. [2019-12-27 02:17:34,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 02:17:34,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:34,656 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] [2019-12-27 02:17:34,657 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:34,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:34,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1834697800, now seen corresponding path program 1 times [2019-12-27 02:17:34,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:34,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373555938] [2019-12-27 02:17:34,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:34,768 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-27 02:17:34,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373555938] [2019-12-27 02:17:34,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:34,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:17:34,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096503366] [2019-12-27 02:17:34,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:17:34,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:34,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:17:34,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:17:34,770 INFO L87 Difference]: Start difference. First operand 18589 states and 56096 transitions. Second operand 6 states. [2019-12-27 02:17:35,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:35,428 INFO L93 Difference]: Finished difference Result 26038 states and 76681 transitions. [2019-12-27 02:17:35,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:17:35,429 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 02:17:35,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:35,464 INFO L225 Difference]: With dead ends: 26038 [2019-12-27 02:17:35,465 INFO L226 Difference]: Without dead ends: 26038 [2019-12-27 02:17:35,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:17:35,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26038 states. [2019-12-27 02:17:35,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26038 to 21331. [2019-12-27 02:17:35,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21331 states. [2019-12-27 02:17:35,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21331 states to 21331 states and 64000 transitions. [2019-12-27 02:17:35,813 INFO L78 Accepts]: Start accepts. Automaton has 21331 states and 64000 transitions. Word has length 27 [2019-12-27 02:17:35,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:35,814 INFO L462 AbstractCegarLoop]: Abstraction has 21331 states and 64000 transitions. [2019-12-27 02:17:35,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:17:35,814 INFO L276 IsEmpty]: Start isEmpty. Operand 21331 states and 64000 transitions. [2019-12-27 02:17:35,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 02:17:35,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:35,839 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] [2019-12-27 02:17:35,839 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:35,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:35,840 INFO L82 PathProgramCache]: Analyzing trace with hash -2065332723, now seen corresponding path program 1 times [2019-12-27 02:17:35,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:35,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307270220] [2019-12-27 02:17:35,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:35,926 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-27 02:17:35,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307270220] [2019-12-27 02:17:35,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:35,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:17:35,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061343086] [2019-12-27 02:17:35,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:17:35,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:35,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:17:35,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:17:35,928 INFO L87 Difference]: Start difference. First operand 21331 states and 64000 transitions. Second operand 7 states. [2019-12-27 02:17:37,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:37,112 INFO L93 Difference]: Finished difference Result 28794 states and 84449 transitions. [2019-12-27 02:17:37,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 02:17:37,112 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 02:17:37,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:37,152 INFO L225 Difference]: With dead ends: 28794 [2019-12-27 02:17:37,152 INFO L226 Difference]: Without dead ends: 28794 [2019-12-27 02:17:37,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:17:37,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28794 states. [2019-12-27 02:17:37,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28794 to 19492. [2019-12-27 02:17:37,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19492 states. [2019-12-27 02:17:37,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19492 states to 19492 states and 58703 transitions. [2019-12-27 02:17:37,816 INFO L78 Accepts]: Start accepts. Automaton has 19492 states and 58703 transitions. Word has length 33 [2019-12-27 02:17:37,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:37,816 INFO L462 AbstractCegarLoop]: Abstraction has 19492 states and 58703 transitions. [2019-12-27 02:17:37,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:17:37,816 INFO L276 IsEmpty]: Start isEmpty. Operand 19492 states and 58703 transitions. [2019-12-27 02:17:37,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 02:17:37,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:37,843 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] [2019-12-27 02:17:37,843 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:37,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:37,844 INFO L82 PathProgramCache]: Analyzing trace with hash 603828080, now seen corresponding path program 1 times [2019-12-27 02:17:37,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:37,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807086720] [2019-12-27 02:17:37,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:37,945 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-27 02:17:37,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807086720] [2019-12-27 02:17:37,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:37,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:17:37,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877511851] [2019-12-27 02:17:37,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:17:37,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:37,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:17:37,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:17:37,948 INFO L87 Difference]: Start difference. First operand 19492 states and 58703 transitions. Second operand 4 states. [2019-12-27 02:17:38,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:38,101 INFO L93 Difference]: Finished difference Result 33180 states and 100186 transitions. [2019-12-27 02:17:38,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:17:38,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 02:17:38,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:38,136 INFO L225 Difference]: With dead ends: 33180 [2019-12-27 02:17:38,136 INFO L226 Difference]: Without dead ends: 16657 [2019-12-27 02:17:38,136 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-27 02:17:38,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16657 states. [2019-12-27 02:17:38,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16657 to 16583. [2019-12-27 02:17:38,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16583 states. [2019-12-27 02:17:38,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16583 states to 16583 states and 49025 transitions. [2019-12-27 02:17:38,499 INFO L78 Accepts]: Start accepts. Automaton has 16583 states and 49025 transitions. Word has length 39 [2019-12-27 02:17:38,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:38,500 INFO L462 AbstractCegarLoop]: Abstraction has 16583 states and 49025 transitions. [2019-12-27 02:17:38,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:17:38,500 INFO L276 IsEmpty]: Start isEmpty. Operand 16583 states and 49025 transitions. [2019-12-27 02:17:38,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 02:17:38,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:38,519 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] [2019-12-27 02:17:38,519 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:38,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:38,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1247651138, now seen corresponding path program 2 times [2019-12-27 02:17:38,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:38,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898784530] [2019-12-27 02:17:38,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:38,605 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-27 02:17:38,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898784530] [2019-12-27 02:17:38,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:38,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:17:38,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347449158] [2019-12-27 02:17:38,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:17:38,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:38,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:17:38,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:38,607 INFO L87 Difference]: Start difference. First operand 16583 states and 49025 transitions. Second operand 3 states. [2019-12-27 02:17:38,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:38,681 INFO L93 Difference]: Finished difference Result 16582 states and 49023 transitions. [2019-12-27 02:17:38,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:17:38,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 02:17:38,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:38,710 INFO L225 Difference]: With dead ends: 16582 [2019-12-27 02:17:38,711 INFO L226 Difference]: Without dead ends: 16582 [2019-12-27 02:17:38,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-27 02:17:38,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16582 states. [2019-12-27 02:17:38,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16582 to 16582. [2019-12-27 02:17:38,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16582 states. [2019-12-27 02:17:38,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16582 states to 16582 states and 49023 transitions. [2019-12-27 02:17:38,976 INFO L78 Accepts]: Start accepts. Automaton has 16582 states and 49023 transitions. Word has length 39 [2019-12-27 02:17:38,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:38,977 INFO L462 AbstractCegarLoop]: Abstraction has 16582 states and 49023 transitions. [2019-12-27 02:17:38,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:17:38,977 INFO L276 IsEmpty]: Start isEmpty. Operand 16582 states and 49023 transitions. [2019-12-27 02:17:38,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 02:17:38,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:38,992 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:38,993 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:38,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:38,993 INFO L82 PathProgramCache]: Analyzing trace with hash -2020108147, now seen corresponding path program 1 times [2019-12-27 02:17:38,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:38,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862356541] [2019-12-27 02:17:38,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:39,053 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-27 02:17:39,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862356541] [2019-12-27 02:17:39,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:39,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:17:39,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060072923] [2019-12-27 02:17:39,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:17:39,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:39,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:17:39,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:17:39,055 INFO L87 Difference]: Start difference. First operand 16582 states and 49023 transitions. Second operand 4 states. [2019-12-27 02:17:39,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:39,159 INFO L93 Difference]: Finished difference Result 26060 states and 77460 transitions. [2019-12-27 02:17:39,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:17:39,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 02:17:39,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:39,180 INFO L225 Difference]: With dead ends: 26060 [2019-12-27 02:17:39,180 INFO L226 Difference]: Without dead ends: 11670 [2019-12-27 02:17:39,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-27 02:17:39,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11670 states. [2019-12-27 02:17:39,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11670 to 11605. [2019-12-27 02:17:39,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11605 states. [2019-12-27 02:17:39,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11605 states to 11605 states and 33387 transitions. [2019-12-27 02:17:39,401 INFO L78 Accepts]: Start accepts. Automaton has 11605 states and 33387 transitions. Word has length 40 [2019-12-27 02:17:39,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:39,402 INFO L462 AbstractCegarLoop]: Abstraction has 11605 states and 33387 transitions. [2019-12-27 02:17:39,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:17:39,402 INFO L276 IsEmpty]: Start isEmpty. Operand 11605 states and 33387 transitions. [2019-12-27 02:17:39,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 02:17:39,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:39,413 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:39,413 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:39,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:39,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1707989501, now seen corresponding path program 2 times [2019-12-27 02:17:39,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:39,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871510111] [2019-12-27 02:17:39,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:39,470 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-27 02:17:39,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871510111] [2019-12-27 02:17:39,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:39,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:17:39,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661042711] [2019-12-27 02:17:39,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:17:39,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:39,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:17:39,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:17:39,472 INFO L87 Difference]: Start difference. First operand 11605 states and 33387 transitions. Second operand 5 states. [2019-12-27 02:17:39,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:39,521 INFO L93 Difference]: Finished difference Result 10656 states and 31273 transitions. [2019-12-27 02:17:39,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:17:39,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 02:17:39,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:39,534 INFO L225 Difference]: With dead ends: 10656 [2019-12-27 02:17:39,535 INFO L226 Difference]: Without dead ends: 7573 [2019-12-27 02:17:39,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:17:39,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7573 states. [2019-12-27 02:17:39,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7573 to 7573. [2019-12-27 02:17:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7573 states. [2019-12-27 02:17:39,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7573 states to 7573 states and 24358 transitions. [2019-12-27 02:17:39,670 INFO L78 Accepts]: Start accepts. Automaton has 7573 states and 24358 transitions. Word has length 40 [2019-12-27 02:17:39,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:39,670 INFO L462 AbstractCegarLoop]: Abstraction has 7573 states and 24358 transitions. [2019-12-27 02:17:39,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:17:39,671 INFO L276 IsEmpty]: Start isEmpty. Operand 7573 states and 24358 transitions. [2019-12-27 02:17:39,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:17:39,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:39,680 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:39,681 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:39,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:39,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1827713058, now seen corresponding path program 1 times [2019-12-27 02:17:39,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:39,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51939586] [2019-12-27 02:17:39,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:39,738 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-27 02:17:39,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51939586] [2019-12-27 02:17:39,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:39,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:17:39,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255160433] [2019-12-27 02:17:39,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:17:39,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:39,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:17:39,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:39,741 INFO L87 Difference]: Start difference. First operand 7573 states and 24358 transitions. Second operand 3 states. [2019-12-27 02:17:39,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:39,809 INFO L93 Difference]: Finished difference Result 10082 states and 31704 transitions. [2019-12-27 02:17:39,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:17:39,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 02:17:39,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:39,827 INFO L225 Difference]: With dead ends: 10082 [2019-12-27 02:17:39,827 INFO L226 Difference]: Without dead ends: 10082 [2019-12-27 02:17:39,828 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-27 02:17:39,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10082 states. [2019-12-27 02:17:39,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10082 to 7729. [2019-12-27 02:17:39,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7729 states. [2019-12-27 02:17:39,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7729 states to 7729 states and 24514 transitions. [2019-12-27 02:17:39,987 INFO L78 Accepts]: Start accepts. Automaton has 7729 states and 24514 transitions. Word has length 64 [2019-12-27 02:17:39,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:39,987 INFO L462 AbstractCegarLoop]: Abstraction has 7729 states and 24514 transitions. [2019-12-27 02:17:39,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:17:39,988 INFO L276 IsEmpty]: Start isEmpty. Operand 7729 states and 24514 transitions. [2019-12-27 02:17:39,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:17:39,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:39,997 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:39,998 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:39,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:39,998 INFO L82 PathProgramCache]: Analyzing trace with hash 572197328, now seen corresponding path program 1 times [2019-12-27 02:17:39,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:39,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268352652] [2019-12-27 02:17:39,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:40,084 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-27 02:17:40,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268352652] [2019-12-27 02:17:40,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:40,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:17:40,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941717233] [2019-12-27 02:17:40,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:17:40,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:40,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:17:40,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:17:40,086 INFO L87 Difference]: Start difference. First operand 7729 states and 24514 transitions. Second operand 7 states. [2019-12-27 02:17:40,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:40,397 INFO L93 Difference]: Finished difference Result 15437 states and 48014 transitions. [2019-12-27 02:17:40,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:17:40,397 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:17:40,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:40,417 INFO L225 Difference]: With dead ends: 15437 [2019-12-27 02:17:40,417 INFO L226 Difference]: Without dead ends: 11573 [2019-12-27 02:17:40,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:17:40,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11573 states. [2019-12-27 02:17:40,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11573 to 9445. [2019-12-27 02:17:40,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9445 states. [2019-12-27 02:17:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9445 states to 9445 states and 29808 transitions. [2019-12-27 02:17:40,974 INFO L78 Accepts]: Start accepts. Automaton has 9445 states and 29808 transitions. Word has length 64 [2019-12-27 02:17:40,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:40,974 INFO L462 AbstractCegarLoop]: Abstraction has 9445 states and 29808 transitions. [2019-12-27 02:17:40,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:17:40,974 INFO L276 IsEmpty]: Start isEmpty. Operand 9445 states and 29808 transitions. [2019-12-27 02:17:40,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:17:40,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:40,991 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:40,991 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:40,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:40,992 INFO L82 PathProgramCache]: Analyzing trace with hash -22937850, now seen corresponding path program 2 times [2019-12-27 02:17:40,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:40,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83670811] [2019-12-27 02:17:40,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:41,110 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-27 02:17:41,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83670811] [2019-12-27 02:17:41,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:41,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:17:41,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242236058] [2019-12-27 02:17:41,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:17:41,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:41,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:17:41,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:17:41,115 INFO L87 Difference]: Start difference. First operand 9445 states and 29808 transitions. Second operand 7 states. [2019-12-27 02:17:41,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:41,438 INFO L93 Difference]: Finished difference Result 17385 states and 53705 transitions. [2019-12-27 02:17:41,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:17:41,438 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 02:17:41,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:41,463 INFO L225 Difference]: With dead ends: 17385 [2019-12-27 02:17:41,463 INFO L226 Difference]: Without dead ends: 13105 [2019-12-27 02:17:41,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:17:41,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13105 states. [2019-12-27 02:17:41,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13105 to 10746. [2019-12-27 02:17:41,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10746 states. [2019-12-27 02:17:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10746 states to 10746 states and 33681 transitions. [2019-12-27 02:17:41,756 INFO L78 Accepts]: Start accepts. Automaton has 10746 states and 33681 transitions. Word has length 64 [2019-12-27 02:17:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:41,757 INFO L462 AbstractCegarLoop]: Abstraction has 10746 states and 33681 transitions. [2019-12-27 02:17:41,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:17:41,757 INFO L276 IsEmpty]: Start isEmpty. Operand 10746 states and 33681 transitions. [2019-12-27 02:17:41,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:17:41,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:41,768 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:41,768 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:41,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:41,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1388618928, now seen corresponding path program 3 times [2019-12-27 02:17:41,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:41,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115198163] [2019-12-27 02:17:41,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:41,877 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-27 02:17:41,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115198163] [2019-12-27 02:17:41,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:41,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:17:41,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791837204] [2019-12-27 02:17:41,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:17:41,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:41,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:17:41,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:17:41,880 INFO L87 Difference]: Start difference. First operand 10746 states and 33681 transitions. Second operand 9 states. [2019-12-27 02:17:42,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:42,885 INFO L93 Difference]: Finished difference Result 24832 states and 76056 transitions. [2019-12-27 02:17:42,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 02:17:42,885 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 02:17:42,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:42,914 INFO L225 Difference]: With dead ends: 24832 [2019-12-27 02:17:42,914 INFO L226 Difference]: Without dead ends: 22344 [2019-12-27 02:17:42,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2019-12-27 02:17:43,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22344 states. [2019-12-27 02:17:43,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22344 to 10578. [2019-12-27 02:17:43,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10578 states. [2019-12-27 02:17:43,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10578 states to 10578 states and 33121 transitions. [2019-12-27 02:17:43,163 INFO L78 Accepts]: Start accepts. Automaton has 10578 states and 33121 transitions. Word has length 64 [2019-12-27 02:17:43,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:43,163 INFO L462 AbstractCegarLoop]: Abstraction has 10578 states and 33121 transitions. [2019-12-27 02:17:43,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:17:43,164 INFO L276 IsEmpty]: Start isEmpty. Operand 10578 states and 33121 transitions. [2019-12-27 02:17:43,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:17:43,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:43,175 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:43,175 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:43,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:43,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1527941036, now seen corresponding path program 4 times [2019-12-27 02:17:43,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:43,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943806940] [2019-12-27 02:17:43,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:43,284 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-27 02:17:43,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943806940] [2019-12-27 02:17:43,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:43,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:17:43,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624735848] [2019-12-27 02:17:43,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:17:43,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:43,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:17:43,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:17:43,289 INFO L87 Difference]: Start difference. First operand 10578 states and 33121 transitions. Second operand 9 states. [2019-12-27 02:17:44,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:44,279 INFO L93 Difference]: Finished difference Result 28772 states and 88210 transitions. [2019-12-27 02:17:44,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 02:17:44,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 02:17:44,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:44,315 INFO L225 Difference]: With dead ends: 28772 [2019-12-27 02:17:44,315 INFO L226 Difference]: Without dead ends: 26348 [2019-12-27 02:17:44,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2019-12-27 02:17:44,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26348 states. [2019-12-27 02:17:44,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26348 to 10606. [2019-12-27 02:17:44,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10606 states. [2019-12-27 02:17:44,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10606 states to 10606 states and 33275 transitions. [2019-12-27 02:17:44,602 INFO L78 Accepts]: Start accepts. Automaton has 10606 states and 33275 transitions. Word has length 64 [2019-12-27 02:17:44,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:44,602 INFO L462 AbstractCegarLoop]: Abstraction has 10606 states and 33275 transitions. [2019-12-27 02:17:44,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:17:44,602 INFO L276 IsEmpty]: Start isEmpty. Operand 10606 states and 33275 transitions. [2019-12-27 02:17:44,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 02:17:44,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:44,613 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:44,614 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:44,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:44,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1911526292, now seen corresponding path program 5 times [2019-12-27 02:17:44,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:44,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219321024] [2019-12-27 02:17:44,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:44,667 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-27 02:17:44,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219321024] [2019-12-27 02:17:44,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:44,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:17:44,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305132098] [2019-12-27 02:17:44,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:17:44,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:44,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:17:44,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:44,670 INFO L87 Difference]: Start difference. First operand 10606 states and 33275 transitions. Second operand 3 states. [2019-12-27 02:17:44,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:44,761 INFO L93 Difference]: Finished difference Result 12322 states and 38579 transitions. [2019-12-27 02:17:44,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:17:44,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 02:17:44,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:44,784 INFO L225 Difference]: With dead ends: 12322 [2019-12-27 02:17:44,784 INFO L226 Difference]: Without dead ends: 12322 [2019-12-27 02:17:44,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:44,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12322 states. [2019-12-27 02:17:45,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12322 to 11074. [2019-12-27 02:17:45,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11074 states. [2019-12-27 02:17:45,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11074 states to 11074 states and 34835 transitions. [2019-12-27 02:17:45,250 INFO L78 Accepts]: Start accepts. Automaton has 11074 states and 34835 transitions. Word has length 64 [2019-12-27 02:17:45,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:45,251 INFO L462 AbstractCegarLoop]: Abstraction has 11074 states and 34835 transitions. [2019-12-27 02:17:45,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:17:45,251 INFO L276 IsEmpty]: Start isEmpty. Operand 11074 states and 34835 transitions. [2019-12-27 02:17:45,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:17:45,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:45,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] [2019-12-27 02:17:45,275 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:45,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:45,276 INFO L82 PathProgramCache]: Analyzing trace with hash -2140458066, now seen corresponding path program 1 times [2019-12-27 02:17:45,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:45,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597843813] [2019-12-27 02:17:45,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:45,421 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-27 02:17:45,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597843813] [2019-12-27 02:17:45,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:45,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 02:17:45,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548200158] [2019-12-27 02:17:45,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:17:45,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:45,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:17:45,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:17:45,424 INFO L87 Difference]: Start difference. First operand 11074 states and 34835 transitions. Second operand 8 states. [2019-12-27 02:17:46,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:46,285 INFO L93 Difference]: Finished difference Result 29477 states and 90578 transitions. [2019-12-27 02:17:46,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 02:17:46,285 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 02:17:46,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:46,320 INFO L225 Difference]: With dead ends: 29477 [2019-12-27 02:17:46,320 INFO L226 Difference]: Without dead ends: 26544 [2019-12-27 02:17:46,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-27 02:17:46,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26544 states. [2019-12-27 02:17:46,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26544 to 11347. [2019-12-27 02:17:46,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11347 states. [2019-12-27 02:17:46,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11347 states to 11347 states and 35865 transitions. [2019-12-27 02:17:46,605 INFO L78 Accepts]: Start accepts. Automaton has 11347 states and 35865 transitions. Word has length 65 [2019-12-27 02:17:46,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:46,605 INFO L462 AbstractCegarLoop]: Abstraction has 11347 states and 35865 transitions. [2019-12-27 02:17:46,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:17:46,605 INFO L276 IsEmpty]: Start isEmpty. Operand 11347 states and 35865 transitions. [2019-12-27 02:17:46,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:17:46,617 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:46,617 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:46,618 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:46,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:46,618 INFO L82 PathProgramCache]: Analyzing trace with hash -281745782, now seen corresponding path program 2 times [2019-12-27 02:17:46,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:46,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891846638] [2019-12-27 02:17:46,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:46,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:46,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891846638] [2019-12-27 02:17:46,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:46,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:17:46,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097608037] [2019-12-27 02:17:46,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:17:46,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:46,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:17:46,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:17:46,716 INFO L87 Difference]: Start difference. First operand 11347 states and 35865 transitions. Second operand 9 states. [2019-12-27 02:17:47,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:47,523 INFO L93 Difference]: Finished difference Result 32061 states and 97811 transitions. [2019-12-27 02:17:47,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 02:17:47,525 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 02:17:47,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:47,566 INFO L225 Difference]: With dead ends: 32061 [2019-12-27 02:17:47,566 INFO L226 Difference]: Without dead ends: 29128 [2019-12-27 02:17:47,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2019-12-27 02:17:47,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29128 states. [2019-12-27 02:17:47,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29128 to 11355. [2019-12-27 02:17:47,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11355 states. [2019-12-27 02:17:47,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11355 states to 11355 states and 35880 transitions. [2019-12-27 02:17:47,863 INFO L78 Accepts]: Start accepts. Automaton has 11355 states and 35880 transitions. Word has length 65 [2019-12-27 02:17:47,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:47,863 INFO L462 AbstractCegarLoop]: Abstraction has 11355 states and 35880 transitions. [2019-12-27 02:17:47,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:17:47,864 INFO L276 IsEmpty]: Start isEmpty. Operand 11355 states and 35880 transitions. [2019-12-27 02:17:47,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:17:47,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:47,880 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:47,880 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:47,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:47,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1813356122, now seen corresponding path program 3 times [2019-12-27 02:17:47,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:47,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601416549] [2019-12-27 02:17:47,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:47,989 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-27 02:17:47,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601416549] [2019-12-27 02:17:47,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:47,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:17:47,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122737598] [2019-12-27 02:17:47,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 02:17:47,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:47,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 02:17:47,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:17:47,993 INFO L87 Difference]: Start difference. First operand 11355 states and 35880 transitions. Second operand 9 states. [2019-12-27 02:17:49,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:49,209 INFO L93 Difference]: Finished difference Result 33909 states and 103392 transitions. [2019-12-27 02:17:49,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 02:17:49,209 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 02:17:49,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:49,267 INFO L225 Difference]: With dead ends: 33909 [2019-12-27 02:17:49,267 INFO L226 Difference]: Without dead ends: 30991 [2019-12-27 02:17:49,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-12-27 02:17:49,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30991 states. [2019-12-27 02:17:49,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30991 to 11298. [2019-12-27 02:17:49,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11298 states. [2019-12-27 02:17:49,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11298 states to 11298 states and 35607 transitions. [2019-12-27 02:17:49,933 INFO L78 Accepts]: Start accepts. Automaton has 11298 states and 35607 transitions. Word has length 65 [2019-12-27 02:17:49,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:49,934 INFO L462 AbstractCegarLoop]: Abstraction has 11298 states and 35607 transitions. [2019-12-27 02:17:49,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 02:17:49,934 INFO L276 IsEmpty]: Start isEmpty. Operand 11298 states and 35607 transitions. [2019-12-27 02:17:49,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:17:49,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:49,948 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:49,948 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:49,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:49,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1724524394, now seen corresponding path program 4 times [2019-12-27 02:17:49,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:49,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619199409] [2019-12-27 02:17:49,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:50,032 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-27 02:17:50,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619199409] [2019-12-27 02:17:50,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:50,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:17:50,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081654301] [2019-12-27 02:17:50,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:17:50,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:50,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:17:50,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:17:50,037 INFO L87 Difference]: Start difference. First operand 11298 states and 35607 transitions. Second operand 4 states. [2019-12-27 02:17:50,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:50,140 INFO L93 Difference]: Finished difference Result 11142 states and 34983 transitions. [2019-12-27 02:17:50,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:17:50,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 02:17:50,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:50,159 INFO L225 Difference]: With dead ends: 11142 [2019-12-27 02:17:50,159 INFO L226 Difference]: Without dead ends: 11142 [2019-12-27 02:17:50,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:17:50,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11142 states. [2019-12-27 02:17:50,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11142 to 10674. [2019-12-27 02:17:50,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10674 states. [2019-12-27 02:17:50,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10674 states to 10674 states and 33423 transitions. [2019-12-27 02:17:50,345 INFO L78 Accepts]: Start accepts. Automaton has 10674 states and 33423 transitions. Word has length 65 [2019-12-27 02:17:50,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:50,345 INFO L462 AbstractCegarLoop]: Abstraction has 10674 states and 33423 transitions. [2019-12-27 02:17:50,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:17:50,345 INFO L276 IsEmpty]: Start isEmpty. Operand 10674 states and 33423 transitions. [2019-12-27 02:17:50,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 02:17:50,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:50,357 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:50,357 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:50,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:50,357 INFO L82 PathProgramCache]: Analyzing trace with hash 837718325, now seen corresponding path program 1 times [2019-12-27 02:17:50,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:50,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693200725] [2019-12-27 02:17:50,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:50,412 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-27 02:17:50,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693200725] [2019-12-27 02:17:50,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:50,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:17:50,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387780187] [2019-12-27 02:17:50,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:17:50,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:50,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:17:50,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:50,414 INFO L87 Difference]: Start difference. First operand 10674 states and 33423 transitions. Second operand 3 states. [2019-12-27 02:17:50,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:50,462 INFO L93 Difference]: Finished difference Result 10673 states and 33421 transitions. [2019-12-27 02:17:50,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:17:50,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 02:17:50,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:50,481 INFO L225 Difference]: With dead ends: 10673 [2019-12-27 02:17:50,481 INFO L226 Difference]: Without dead ends: 10673 [2019-12-27 02:17:50,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:50,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10673 states. [2019-12-27 02:17:50,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10673 to 10673. [2019-12-27 02:17:50,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10673 states. [2019-12-27 02:17:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10673 states to 10673 states and 33421 transitions. [2019-12-27 02:17:50,837 INFO L78 Accepts]: Start accepts. Automaton has 10673 states and 33421 transitions. Word has length 65 [2019-12-27 02:17:50,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:50,837 INFO L462 AbstractCegarLoop]: Abstraction has 10673 states and 33421 transitions. [2019-12-27 02:17:50,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:17:50,837 INFO L276 IsEmpty]: Start isEmpty. Operand 10673 states and 33421 transitions. [2019-12-27 02:17:50,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 02:17:50,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:50,855 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-27 02:17:50,855 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:50,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:50,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1101261716, now seen corresponding path program 1 times [2019-12-27 02:17:50,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:50,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262985278] [2019-12-27 02:17:50,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:50,949 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-27 02:17:50,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262985278] [2019-12-27 02:17:50,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:50,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:17:50,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423692973] [2019-12-27 02:17:50,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:17:50,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:50,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:17:50,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:50,951 INFO L87 Difference]: Start difference. First operand 10673 states and 33421 transitions. Second operand 3 states. [2019-12-27 02:17:50,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:50,995 INFO L93 Difference]: Finished difference Result 8641 states and 26214 transitions. [2019-12-27 02:17:50,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:17:50,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 02:17:50,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:51,011 INFO L225 Difference]: With dead ends: 8641 [2019-12-27 02:17:51,011 INFO L226 Difference]: Without dead ends: 8641 [2019-12-27 02:17:51,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:17:51,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8641 states. [2019-12-27 02:17:51,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8641 to 8368. [2019-12-27 02:17:51,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8368 states. [2019-12-27 02:17:51,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8368 states to 8368 states and 25353 transitions. [2019-12-27 02:17:51,171 INFO L78 Accepts]: Start accepts. Automaton has 8368 states and 25353 transitions. Word has length 66 [2019-12-27 02:17:51,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:51,171 INFO L462 AbstractCegarLoop]: Abstraction has 8368 states and 25353 transitions. [2019-12-27 02:17:51,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:17:51,172 INFO L276 IsEmpty]: Start isEmpty. Operand 8368 states and 25353 transitions. [2019-12-27 02:17:51,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:17:51,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:51,182 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:51,182 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:51,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:51,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1000943315, now seen corresponding path program 1 times [2019-12-27 02:17:51,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:51,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853559255] [2019-12-27 02:17:51,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:51,358 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-27 02:17:51,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853559255] [2019-12-27 02:17:51,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:51,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:17:51,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807697114] [2019-12-27 02:17:51,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:17:51,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:51,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:17:51,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:17:51,359 INFO L87 Difference]: Start difference. First operand 8368 states and 25353 transitions. Second operand 10 states. [2019-12-27 02:17:52,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:52,659 INFO L93 Difference]: Finished difference Result 14716 states and 43783 transitions. [2019-12-27 02:17:52,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 02:17:52,660 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 02:17:52,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:52,675 INFO L225 Difference]: With dead ends: 14716 [2019-12-27 02:17:52,675 INFO L226 Difference]: Without dead ends: 11117 [2019-12-27 02:17:52,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2019-12-27 02:17:52,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11117 states. [2019-12-27 02:17:52,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11117 to 8666. [2019-12-27 02:17:52,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8666 states. [2019-12-27 02:17:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8666 states to 8666 states and 26101 transitions. [2019-12-27 02:17:52,828 INFO L78 Accepts]: Start accepts. Automaton has 8666 states and 26101 transitions. Word has length 67 [2019-12-27 02:17:52,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:52,828 INFO L462 AbstractCegarLoop]: Abstraction has 8666 states and 26101 transitions. [2019-12-27 02:17:52,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:17:52,828 INFO L276 IsEmpty]: Start isEmpty. Operand 8666 states and 26101 transitions. [2019-12-27 02:17:52,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:17:52,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:52,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:52,837 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:52,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:52,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1387520431, now seen corresponding path program 2 times [2019-12-27 02:17:52,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:52,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275507852] [2019-12-27 02:17:52,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:53,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:17:53,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275507852] [2019-12-27 02:17:53,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:53,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:17:53,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164073063] [2019-12-27 02:17:53,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 02:17:53,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:53,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 02:17:53,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:17:53,037 INFO L87 Difference]: Start difference. First operand 8666 states and 26101 transitions. Second operand 10 states. [2019-12-27 02:17:54,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:54,288 INFO L93 Difference]: Finished difference Result 15216 states and 44769 transitions. [2019-12-27 02:17:54,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 02:17:54,288 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 02:17:54,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:54,305 INFO L225 Difference]: With dead ends: 15216 [2019-12-27 02:17:54,306 INFO L226 Difference]: Without dead ends: 12165 [2019-12-27 02:17:54,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 02:17:54,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12165 states. [2019-12-27 02:17:54,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12165 to 9002. [2019-12-27 02:17:54,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9002 states. [2019-12-27 02:17:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9002 states to 9002 states and 26931 transitions. [2019-12-27 02:17:54,473 INFO L78 Accepts]: Start accepts. Automaton has 9002 states and 26931 transitions. Word has length 67 [2019-12-27 02:17:54,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:54,473 INFO L462 AbstractCegarLoop]: Abstraction has 9002 states and 26931 transitions. [2019-12-27 02:17:54,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 02:17:54,473 INFO L276 IsEmpty]: Start isEmpty. Operand 9002 states and 26931 transitions. [2019-12-27 02:17:54,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:17:54,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:54,482 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:54,482 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:54,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:54,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1156359029, now seen corresponding path program 3 times [2019-12-27 02:17:54,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:54,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346278983] [2019-12-27 02:17:54,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:54,673 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-27 02:17:54,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346278983] [2019-12-27 02:17:54,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:54,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:17:54,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198062693] [2019-12-27 02:17:54,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:17:54,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:54,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:17:54,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:17:54,675 INFO L87 Difference]: Start difference. First operand 9002 states and 26931 transitions. Second operand 11 states. [2019-12-27 02:17:56,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:56,153 INFO L93 Difference]: Finished difference Result 14588 states and 42742 transitions. [2019-12-27 02:17:56,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 02:17:56,154 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 02:17:56,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:56,170 INFO L225 Difference]: With dead ends: 14588 [2019-12-27 02:17:56,170 INFO L226 Difference]: Without dead ends: 11765 [2019-12-27 02:17:56,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-27 02:17:56,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11765 states. [2019-12-27 02:17:56,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11765 to 8714. [2019-12-27 02:17:56,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8714 states. [2019-12-27 02:17:56,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8714 states to 8714 states and 26091 transitions. [2019-12-27 02:17:56,336 INFO L78 Accepts]: Start accepts. Automaton has 8714 states and 26091 transitions. Word has length 67 [2019-12-27 02:17:56,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:56,336 INFO L462 AbstractCegarLoop]: Abstraction has 8714 states and 26091 transitions. [2019-12-27 02:17:56,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:17:56,336 INFO L276 IsEmpty]: Start isEmpty. Operand 8714 states and 26091 transitions. [2019-12-27 02:17:56,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:17:56,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:56,344 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:56,344 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:56,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:56,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1555205525, now seen corresponding path program 4 times [2019-12-27 02:17:56,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:56,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968946531] [2019-12-27 02:17:56,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:56,518 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-27 02:17:56,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968946531] [2019-12-27 02:17:56,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:56,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:17:56,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959825337] [2019-12-27 02:17:56,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:17:56,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:56,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:17:56,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:17:56,520 INFO L87 Difference]: Start difference. First operand 8714 states and 26091 transitions. Second operand 11 states. [2019-12-27 02:17:57,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:57,711 INFO L93 Difference]: Finished difference Result 10605 states and 31433 transitions. [2019-12-27 02:17:57,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 02:17:57,711 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 02:17:57,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:57,724 INFO L225 Difference]: With dead ends: 10605 [2019-12-27 02:17:57,724 INFO L226 Difference]: Without dead ends: 9442 [2019-12-27 02:17:57,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:17:57,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9442 states. [2019-12-27 02:17:57,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9442 to 8898. [2019-12-27 02:17:57,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8898 states. [2019-12-27 02:17:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8898 states to 8898 states and 26560 transitions. [2019-12-27 02:17:57,876 INFO L78 Accepts]: Start accepts. Automaton has 8898 states and 26560 transitions. Word has length 67 [2019-12-27 02:17:57,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:57,876 INFO L462 AbstractCegarLoop]: Abstraction has 8898 states and 26560 transitions. [2019-12-27 02:17:57,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:17:57,876 INFO L276 IsEmpty]: Start isEmpty. Operand 8898 states and 26560 transitions. [2019-12-27 02:17:57,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:17:57,885 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:57,885 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:57,885 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:57,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:57,885 INFO L82 PathProgramCache]: Analyzing trace with hash -2131583359, now seen corresponding path program 5 times [2019-12-27 02:17:57,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:57,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797246437] [2019-12-27 02:17:57,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:58,050 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-27 02:17:58,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797246437] [2019-12-27 02:17:58,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:58,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:17:58,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691040065] [2019-12-27 02:17:58,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:17:58,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:58,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:17:58,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:17:58,054 INFO L87 Difference]: Start difference. First operand 8898 states and 26560 transitions. Second operand 11 states. [2019-12-27 02:17:59,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:17:59,236 INFO L93 Difference]: Finished difference Result 12368 states and 36172 transitions. [2019-12-27 02:17:59,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 02:17:59,236 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 02:17:59,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:17:59,255 INFO L225 Difference]: With dead ends: 12368 [2019-12-27 02:17:59,255 INFO L226 Difference]: Without dead ends: 11273 [2019-12-27 02:17:59,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-12-27 02:17:59,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11273 states. [2019-12-27 02:17:59,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11273 to 8766. [2019-12-27 02:17:59,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8766 states. [2019-12-27 02:17:59,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8766 states to 8766 states and 26209 transitions. [2019-12-27 02:17:59,421 INFO L78 Accepts]: Start accepts. Automaton has 8766 states and 26209 transitions. Word has length 67 [2019-12-27 02:17:59,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:17:59,421 INFO L462 AbstractCegarLoop]: Abstraction has 8766 states and 26209 transitions. [2019-12-27 02:17:59,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:17:59,422 INFO L276 IsEmpty]: Start isEmpty. Operand 8766 states and 26209 transitions. [2019-12-27 02:17:59,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:17:59,430 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:17:59,430 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:17:59,430 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:17:59,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:17:59,431 INFO L82 PathProgramCache]: Analyzing trace with hash -421367111, now seen corresponding path program 6 times [2019-12-27 02:17:59,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:17:59,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462099093] [2019-12-27 02:17:59,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:17:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:17:59,605 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-27 02:17:59,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462099093] [2019-12-27 02:17:59,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:17:59,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:17:59,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428340462] [2019-12-27 02:17:59,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 02:17:59,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:17:59,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 02:17:59,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:17:59,608 INFO L87 Difference]: Start difference. First operand 8766 states and 26209 transitions. Second operand 12 states. [2019-12-27 02:18:01,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:01,043 INFO L93 Difference]: Finished difference Result 12376 states and 36256 transitions. [2019-12-27 02:18:01,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 02:18:01,044 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 02:18:01,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:01,061 INFO L225 Difference]: With dead ends: 12376 [2019-12-27 02:18:01,061 INFO L226 Difference]: Without dead ends: 11729 [2019-12-27 02:18:01,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2019-12-27 02:18:01,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11729 states. [2019-12-27 02:18:01,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11729 to 8754. [2019-12-27 02:18:01,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8754 states. [2019-12-27 02:18:01,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8754 states to 8754 states and 26177 transitions. [2019-12-27 02:18:01,229 INFO L78 Accepts]: Start accepts. Automaton has 8754 states and 26177 transitions. Word has length 67 [2019-12-27 02:18:01,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:01,229 INFO L462 AbstractCegarLoop]: Abstraction has 8754 states and 26177 transitions. [2019-12-27 02:18:01,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 02:18:01,229 INFO L276 IsEmpty]: Start isEmpty. Operand 8754 states and 26177 transitions. [2019-12-27 02:18:01,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:18:01,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:01,238 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:01,238 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:01,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:01,238 INFO L82 PathProgramCache]: Analyzing trace with hash 53405721, now seen corresponding path program 7 times [2019-12-27 02:18:01,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:01,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405914193] [2019-12-27 02:18:01,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:01,408 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-27 02:18:01,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405914193] [2019-12-27 02:18:01,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:01,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:18:01,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957011037] [2019-12-27 02:18:01,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:18:01,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:01,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:18:01,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:18:01,412 INFO L87 Difference]: Start difference. First operand 8754 states and 26177 transitions. Second operand 11 states. [2019-12-27 02:18:01,753 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-12-27 02:18:02,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:02,374 INFO L93 Difference]: Finished difference Result 13183 states and 39003 transitions. [2019-12-27 02:18:02,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 02:18:02,374 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 02:18:02,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:02,391 INFO L225 Difference]: With dead ends: 13183 [2019-12-27 02:18:02,391 INFO L226 Difference]: Without dead ends: 12164 [2019-12-27 02:18:02,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-12-27 02:18:02,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12164 states. [2019-12-27 02:18:02,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12164 to 10338. [2019-12-27 02:18:02,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10338 states. [2019-12-27 02:18:02,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10338 states to 10338 states and 30809 transitions. [2019-12-27 02:18:02,566 INFO L78 Accepts]: Start accepts. Automaton has 10338 states and 30809 transitions. Word has length 67 [2019-12-27 02:18:02,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:02,567 INFO L462 AbstractCegarLoop]: Abstraction has 10338 states and 30809 transitions. [2019-12-27 02:18:02,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:18:02,567 INFO L276 IsEmpty]: Start isEmpty. Operand 10338 states and 30809 transitions. [2019-12-27 02:18:02,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:18:02,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:02,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:02,576 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:02,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:02,577 INFO L82 PathProgramCache]: Analyzing trace with hash -374832785, now seen corresponding path program 8 times [2019-12-27 02:18:02,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:02,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300221843] [2019-12-27 02:18:02,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:02,706 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-27 02:18:02,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300221843] [2019-12-27 02:18:02,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:02,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 02:18:02,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212592938] [2019-12-27 02:18:02,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 02:18:02,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:02,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 02:18:02,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:18:02,708 INFO L87 Difference]: Start difference. First operand 10338 states and 30809 transitions. Second operand 11 states. [2019-12-27 02:18:03,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:03,472 INFO L93 Difference]: Finished difference Result 12614 states and 36935 transitions. [2019-12-27 02:18:03,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 02:18:03,472 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 02:18:03,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:03,488 INFO L225 Difference]: With dead ends: 12614 [2019-12-27 02:18:03,488 INFO L226 Difference]: Without dead ends: 10559 [2019-12-27 02:18:03,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 02:18:03,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10559 states. [2019-12-27 02:18:03,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10559 to 8416. [2019-12-27 02:18:03,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8416 states. [2019-12-27 02:18:03,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8416 states to 8416 states and 25159 transitions. [2019-12-27 02:18:03,651 INFO L78 Accepts]: Start accepts. Automaton has 8416 states and 25159 transitions. Word has length 67 [2019-12-27 02:18:03,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:03,651 INFO L462 AbstractCegarLoop]: Abstraction has 8416 states and 25159 transitions. [2019-12-27 02:18:03,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 02:18:03,651 INFO L276 IsEmpty]: Start isEmpty. Operand 8416 states and 25159 transitions. [2019-12-27 02:18:03,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:18:03,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:03,661 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:03,661 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:03,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:03,662 INFO L82 PathProgramCache]: Analyzing trace with hash -945042827, now seen corresponding path program 9 times [2019-12-27 02:18:03,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:03,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058771907] [2019-12-27 02:18:03,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:04,184 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-27 02:18:04,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058771907] [2019-12-27 02:18:04,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:04,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 02:18:04,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459646107] [2019-12-27 02:18:04,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 02:18:04,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:04,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 02:18:04,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-27 02:18:04,185 INFO L87 Difference]: Start difference. First operand 8416 states and 25159 transitions. Second operand 15 states. [2019-12-27 02:18:07,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:07,939 INFO L93 Difference]: Finished difference Result 12171 states and 35689 transitions. [2019-12-27 02:18:07,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 02:18:07,941 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 02:18:07,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:07,956 INFO L225 Difference]: With dead ends: 12171 [2019-12-27 02:18:07,957 INFO L226 Difference]: Without dead ends: 11960 [2019-12-27 02:18:07,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=278, Invalid=1128, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 02:18:08,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11960 states. [2019-12-27 02:18:08,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11960 to 8376. [2019-12-27 02:18:08,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8376 states. [2019-12-27 02:18:08,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8376 states to 8376 states and 25039 transitions. [2019-12-27 02:18:08,120 INFO L78 Accepts]: Start accepts. Automaton has 8376 states and 25039 transitions. Word has length 67 [2019-12-27 02:18:08,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:08,120 INFO L462 AbstractCegarLoop]: Abstraction has 8376 states and 25039 transitions. [2019-12-27 02:18:08,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 02:18:08,120 INFO L276 IsEmpty]: Start isEmpty. Operand 8376 states and 25039 transitions. [2019-12-27 02:18:08,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:18:08,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:08,128 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:08,128 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:08,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:08,129 INFO L82 PathProgramCache]: Analyzing trace with hash -628175685, now seen corresponding path program 10 times [2019-12-27 02:18:08,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:08,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644085593] [2019-12-27 02:18:08,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:18:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:18:08,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644085593] [2019-12-27 02:18:08,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:18:08,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 02:18:08,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080857241] [2019-12-27 02:18:08,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 02:18:08,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:18:08,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 02:18:08,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-27 02:18:08,621 INFO L87 Difference]: Start difference. First operand 8376 states and 25039 transitions. Second operand 15 states. [2019-12-27 02:18:12,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:18:12,397 INFO L93 Difference]: Finished difference Result 11548 states and 33940 transitions. [2019-12-27 02:18:12,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 02:18:12,397 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 02:18:12,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:18:12,413 INFO L225 Difference]: With dead ends: 11548 [2019-12-27 02:18:12,413 INFO L226 Difference]: Without dead ends: 11387 [2019-12-27 02:18:12,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=270, Invalid=1136, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 02:18:12,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11387 states. [2019-12-27 02:18:12,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11387 to 8240. [2019-12-27 02:18:12,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8240 states. [2019-12-27 02:18:12,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8240 states to 8240 states and 24675 transitions. [2019-12-27 02:18:12,565 INFO L78 Accepts]: Start accepts. Automaton has 8240 states and 24675 transitions. Word has length 67 [2019-12-27 02:18:12,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:18:12,565 INFO L462 AbstractCegarLoop]: Abstraction has 8240 states and 24675 transitions. [2019-12-27 02:18:12,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 02:18:12,565 INFO L276 IsEmpty]: Start isEmpty. Operand 8240 states and 24675 transitions. [2019-12-27 02:18:12,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 02:18:12,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:18:12,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:18:12,573 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:18:12,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:18:12,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1748623595, now seen corresponding path program 11 times [2019-12-27 02:18:12,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:18:12,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153343560] [2019-12-27 02:18:12,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:18:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:18:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:18:12,716 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:18:12,717 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:18:12,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= v_~b$r_buff1_thd0~0_230 0) (= v_~b$w_buff1~0_176 0) (= v_~b$mem_tmp~0_20 0) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t861~0.base_25| 1)) (= v_~weak$$choice2~0_144 0) (= 0 v_~b$r_buff1_thd3~0_337) (= 0 v_~b$read_delayed~0_7) (= 0 v_~b$r_buff0_thd2~0_182) (= 0 v_~__unbuffered_p0_EAX~0_176) (= v_~__unbuffered_p1_EBX~0_38 0) (= v_~main$tmp_guard1~0_34 0) (= v_~y~0_19 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~b$r_buff0_thd0~0_204 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~b$r_buff1_thd1~0_215) (= v_~a~0_14 0) (= 0 v_~x~0_124) (= 0 v_~b$r_buff0_thd3~0_395) (= v_~__unbuffered_p2_EBX~0_38 0) (= v_~b$read_delayed_var~0.offset_7 0) (= v_~z~0_23 0) (= 0 |v_#NULL.base_4|) (= 0 |v_ULTIMATE.start_main_~#t861~0.offset_17|) (= 0 v_~__unbuffered_p2_EAX~0_34) (= 0 v_~b$w_buff0_used~0_787) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t861~0.base_25| 4) |v_#length_25|) (= |v_#NULL.offset_4| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t861~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t861~0.base_25|) |v_ULTIMATE.start_main_~#t861~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~b$w_buff0~0_250) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t861~0.base_25|) (= v_~__unbuffered_cnt~0_137 0) (= 0 v_~b$w_buff1_used~0_450) (= 0 v_~b$r_buff1_thd2~0_222) (= 0 v_~weak$$choice0~0_13) (= v_~b~0_186 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t861~0.base_25|) 0) (= v_~main$tmp_guard0~0_24 0) (= v_~b$flush_delayed~0_35 0) (= 0 v_~b$read_delayed_var~0.base_7) (= 0 v_~b$r_buff0_thd1~0_323))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_395, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_215, ~b$read_delayed_var~0.offset=v_~b$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_245|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_51|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_787, ~a~0=v_~a~0_14, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_176, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, #length=|v_#length_25|, ~b$w_buff0~0=v_~b$w_buff0~0_250, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ULTIMATE.start_main_~#t861~0.base=|v_ULTIMATE.start_main_~#t861~0.base_25|, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_204, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_182, ~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~b$flush_delayed~0=v_~b$flush_delayed~0_35, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~b$read_delayed~0=v_~b$read_delayed~0_7, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~b$w_buff1~0=v_~b$w_buff1~0_176, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, ~x~0=v_~x~0_124, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_323, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_450, ULTIMATE.start_main_~#t861~0.offset=|v_ULTIMATE.start_main_~#t861~0.offset_17|, ~y~0=v_~y~0_19, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_222, ULTIMATE.start_main_~#t863~0.offset=|v_ULTIMATE.start_main_~#t863~0.offset_17|, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_230, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_38, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_~#t862~0.base=|v_ULTIMATE.start_main_~#t862~0.base_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_4|, ~b$read_delayed_var~0.base=v_~b$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t862~0.offset=|v_ULTIMATE.start_main_~#t862~0.offset_17|, ULTIMATE.start_main_~#t863~0.base=|v_ULTIMATE.start_main_~#t863~0.base_21|, ~b~0=v_~b~0_186, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_144, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_337} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, ~b$r_buff1_thd1~0, ~b$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ~b$w_buff0_used~0, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~b$w_buff0~0, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t861~0.base, ~b$r_buff0_thd0~0, ~b$r_buff0_thd2~0, ~b$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, ULTIMATE.start_main_#t~nondet45, ~b$read_delayed~0, ~weak$$choice0~0, ~b$w_buff1~0, ~__unbuffered_cnt~0, ~x~0, ~b$r_buff0_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite51, ~b$w_buff1_used~0, ULTIMATE.start_main_~#t861~0.offset, ~y~0, ~b$r_buff1_thd2~0, ULTIMATE.start_main_~#t863~0.offset, ~b$r_buff1_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t862~0.base, ~main$tmp_guard0~0, #NULL.base, ~b$read_delayed_var~0.base, ULTIMATE.start_main_~#t862~0.offset, ULTIMATE.start_main_~#t863~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-27 02:18:12,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L842-1-->L844: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t862~0.base_10|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t862~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t862~0.offset_9| 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t862~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t862~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t862~0.base_10|) |v_ULTIMATE.start_main_~#t862~0.offset_9| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t862~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t862~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t862~0.offset=|v_ULTIMATE.start_main_~#t862~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t862~0.base=|v_ULTIMATE.start_main_~#t862~0.base_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t862~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t862~0.base, #length] because there is no mapped edge [2019-12-27 02:18:12,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L844-1-->L846: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t863~0.base_13|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t863~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t863~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t863~0.base_13|) |v_ULTIMATE.start_main_~#t863~0.offset_11| 2)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t863~0.base_13|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t863~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t863~0.offset_11|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t863~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t863~0.offset=|v_ULTIMATE.start_main_~#t863~0.offset_11|, ULTIMATE.start_main_~#t863~0.base=|v_ULTIMATE.start_main_~#t863~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t863~0.offset, ULTIMATE.start_main_~#t863~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 02:18:12,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L754: Formula: (and (not (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-139268938 0)) (= ~b$r_buff1_thd1~0_Out-139268938 ~b$r_buff0_thd1~0_In-139268938) (= ~b$r_buff0_thd0~0_In-139268938 ~b$r_buff1_thd0~0_Out-139268938) (= ~b$r_buff1_thd2~0_Out-139268938 ~b$r_buff0_thd2~0_In-139268938) (= ~b$r_buff1_thd3~0_Out-139268938 ~b$r_buff0_thd3~0_In-139268938) (= 1 ~b$r_buff0_thd1~0_Out-139268938) (= ~x~0_In-139268938 ~__unbuffered_p0_EAX~0_Out-139268938)) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-139268938, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-139268938, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-139268938, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-139268938, ~x~0=~x~0_In-139268938, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-139268938} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out-139268938, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-139268938, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-139268938, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-139268938, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out-139268938, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out-139268938, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-139268938, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out-139268938, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out-139268938, ~x~0=~x~0_In-139268938, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-139268938} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~__unbuffered_p0_EAX~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-27 02:18:12,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L780-2-->L780-4: Formula: (let ((.cse0 (= (mod ~b$w_buff1_used~0_In-1848946910 256) 0)) (.cse1 (= 0 (mod ~b$r_buff1_thd2~0_In-1848946910 256)))) (or (and (or .cse0 .cse1) (= ~b~0_In-1848946910 |P1Thread1of1ForFork0_#t~ite9_Out-1848946910|)) (and (not .cse0) (= ~b$w_buff1~0_In-1848946910 |P1Thread1of1ForFork0_#t~ite9_Out-1848946910|) (not .cse1)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In-1848946910, ~b~0=~b~0_In-1848946910, ~b$w_buff1~0=~b$w_buff1~0_In-1848946910, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1848946910} OutVars{~b$w_buff1_used~0=~b$w_buff1_used~0_In-1848946910, ~b~0=~b~0_In-1848946910, ~b$w_buff1~0=~b$w_buff1~0_In-1848946910, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out-1848946910|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1848946910} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 02:18:12,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L780-4-->L781: Formula: (= v_~b~0_66 |v_P1Thread1of1ForFork0_#t~ite9_34|) InVars {P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_34|} OutVars{~b~0=v_~b~0_66, P1Thread1of1ForFork0_#t~ite10=|v_P1Thread1of1ForFork0_#t~ite10_53|, P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_33|} AuxVars[] AssignedVars[~b~0, P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 02:18:12,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In-554510370 256) 0)) (.cse0 (= 0 (mod ~b$r_buff0_thd2~0_In-554510370 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite11_Out-554510370| ~b$w_buff0_used~0_In-554510370) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite11_Out-554510370|) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-554510370, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-554510370} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-554510370, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-554510370, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out-554510370|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 02:18:12,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L782-->L782-2: Formula: (let ((.cse3 (= 0 (mod ~b$w_buff1_used~0_In1355557609 256))) (.cse2 (= (mod ~b$r_buff1_thd2~0_In1355557609 256) 0)) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In1355557609 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd2~0_In1355557609 256)))) (or (and (= ~b$w_buff1_used~0_In1355557609 |P1Thread1of1ForFork0_#t~ite12_Out1355557609|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite12_Out1355557609|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1355557609, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1355557609, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1355557609, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1355557609} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1355557609, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1355557609, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1355557609, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out1355557609|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1355557609} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 02:18:12,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In1719311857 256))) (.cse1 (= (mod ~b$r_buff0_thd2~0_In1719311857 256) 0))) (or (and (= ~b$r_buff0_thd2~0_In1719311857 |P1Thread1of1ForFork0_#t~ite13_Out1719311857|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite13_Out1719311857|) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1719311857, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1719311857} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1719311857, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1719311857, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out1719311857|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 02:18:12,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L784-->L784-2: Formula: (let ((.cse2 (= 0 (mod ~b$r_buff1_thd2~0_In-2084195224 256))) (.cse3 (= (mod ~b$w_buff1_used~0_In-2084195224 256) 0)) (.cse0 (= 0 (mod ~b$r_buff0_thd2~0_In-2084195224 256))) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In-2084195224 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite14_Out-2084195224| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite14_Out-2084195224| ~b$r_buff1_thd2~0_In-2084195224)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-2084195224, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-2084195224, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-2084195224, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-2084195224} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-2084195224, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-2084195224, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-2084195224, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out-2084195224|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-2084195224} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 02:18:12,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L784-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= v_~b$r_buff1_thd2~0_85 |v_P1Thread1of1ForFork0_#t~ite14_32|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_32|} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_31|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_85, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, ~b$r_buff1_thd2~0, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 02:18:12,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In338718808 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite21_Out338718808| ~b$w_buff0~0_In338718808) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite20_In338718808| |P2Thread1of1ForFork1_#t~ite20_Out338718808|)) (and (= |P2Thread1of1ForFork1_#t~ite21_Out338718808| |P2Thread1of1ForFork1_#t~ite20_Out338718808|) (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In338718808 256)))) (or (and .cse1 (= (mod ~b$w_buff1_used~0_In338718808 256) 0)) (and .cse1 (= (mod ~b$r_buff1_thd3~0_In338718808 256) 0)) (= 0 (mod ~b$w_buff0_used~0_In338718808 256)))) .cse0 (= |P2Thread1of1ForFork1_#t~ite20_Out338718808| ~b$w_buff0~0_In338718808)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In338718808, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In338718808, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In338718808|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In338718808, ~b$w_buff0~0=~b$w_buff0~0_In338718808, ~weak$$choice2~0=~weak$$choice2~0_In338718808, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In338718808} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In338718808, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In338718808, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out338718808|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out338718808|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In338718808, ~b$w_buff0~0=~b$w_buff0~0_In338718808, ~weak$$choice2~0=~weak$$choice2~0_In338718808, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In338718808} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 02:18:12,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1429433417 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite27_Out-1429433417| ~b$w_buff0_used~0_In-1429433417) (= |P2Thread1of1ForFork1_#t~ite26_In-1429433417| |P2Thread1of1ForFork1_#t~ite26_Out-1429433417|)) (and (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In-1429433417 256) 0))) (or (= 0 (mod ~b$w_buff0_used~0_In-1429433417 256)) (and (= 0 (mod ~b$w_buff1_used~0_In-1429433417 256)) .cse1) (and (= 0 (mod ~b$r_buff1_thd3~0_In-1429433417 256)) .cse1))) (= |P2Thread1of1ForFork1_#t~ite27_Out-1429433417| |P2Thread1of1ForFork1_#t~ite26_Out-1429433417|) (= |P2Thread1of1ForFork1_#t~ite26_Out-1429433417| ~b$w_buff0_used~0_In-1429433417) .cse0))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1429433417, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1429433417, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In-1429433417|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1429433417, ~weak$$choice2~0=~weak$$choice2~0_In-1429433417, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1429433417} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1429433417, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out-1429433417|, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1429433417, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out-1429433417|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1429433417, ~weak$$choice2~0=~weak$$choice2~0_In-1429433417, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1429433417} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-27 02:18:12,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L812-->L813: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~b$r_buff0_thd3~0_79 v_~b$r_buff0_thd3~0_78)) InVars {~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_78, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 02:18:12,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L815-->L819: Formula: (and (= v_~b$flush_delayed~0_7 0) (not (= (mod v_~b$flush_delayed~0_8 256) 0)) (= v_~b~0_30 v_~b$mem_tmp~0_5)) InVars {~b$mem_tmp~0=v_~b$mem_tmp~0_5, ~b$flush_delayed~0=v_~b$flush_delayed~0_8} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~b~0=v_~b~0_30, ~b$flush_delayed~0=v_~b$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, ~b~0, ~b$flush_delayed~0] because there is no mapped edge [2019-12-27 02:18:12,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L819-2-->L819-4: Formula: (let ((.cse0 (= (mod ~b$r_buff1_thd3~0_In-819706214 256) 0)) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In-819706214 256)))) (or (and (not .cse0) (= ~b$w_buff1~0_In-819706214 |P2Thread1of1ForFork1_#t~ite38_Out-819706214|) (not .cse1)) (and (= ~b~0_In-819706214 |P2Thread1of1ForFork1_#t~ite38_Out-819706214|) (or .cse0 .cse1)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In-819706214, ~b~0=~b~0_In-819706214, ~b$w_buff1~0=~b$w_buff1~0_In-819706214, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-819706214} OutVars{P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out-819706214|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-819706214, ~b~0=~b~0_In-819706214, ~b$w_buff1~0=~b$w_buff1~0_In-819706214, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-819706214} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-27 02:18:12,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L819-4-->L820: Formula: (= v_~b~0_46 |v_P2Thread1of1ForFork1_#t~ite38_12|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_12|} OutVars{P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_11|, ~b~0=v_~b~0_46, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38, ~b~0, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-27 02:18:12,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In-1148416107 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-1148416107 256)))) (or (and (= ~b$w_buff0_used~0_In-1148416107 |P2Thread1of1ForFork1_#t~ite40_Out-1148416107|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork1_#t~ite40_Out-1148416107|) (not .cse1) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1148416107, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1148416107} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1148416107, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1148416107, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-1148416107|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-27 02:18:12,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L821-->L821-2: Formula: (let ((.cse3 (= (mod ~b$w_buff0_used~0_In-620736107 256) 0)) (.cse2 (= 0 (mod ~b$r_buff0_thd3~0_In-620736107 256))) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In-620736107 256))) (.cse0 (= (mod ~b$r_buff1_thd3~0_In-620736107 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite41_Out-620736107|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~b$w_buff1_used~0_In-620736107 |P2Thread1of1ForFork1_#t~ite41_Out-620736107|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-620736107, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-620736107, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-620736107, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-620736107} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-620736107, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-620736107, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-620736107, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out-620736107|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-620736107} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-27 02:18:12,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In-420852319 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In-420852319 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite42_Out-420852319| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite42_Out-420852319| ~b$r_buff0_thd3~0_In-420852319)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-420852319, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-420852319} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-420852319, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-420852319, P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out-420852319|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-27 02:18:12,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In-190026286 256))) (.cse0 (= (mod ~b$r_buff0_thd3~0_In-190026286 256) 0)) (.cse3 (= (mod ~b$w_buff1_used~0_In-190026286 256) 0)) (.cse2 (= 0 (mod ~b$r_buff1_thd3~0_In-190026286 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite43_Out-190026286| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P2Thread1of1ForFork1_#t~ite43_Out-190026286| ~b$r_buff1_thd3~0_In-190026286)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-190026286, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-190026286, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-190026286, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-190026286} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-190026286, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-190026286, P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out-190026286|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-190026286, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-190026286} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-27 02:18:12,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= |v_P2Thread1of1ForFork1_#t~ite43_44| v_~b$r_buff1_thd3~0_140) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_140, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~b$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 02:18:12,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L755-->L755-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In2099105778 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd1~0_In2099105778 256) 0))) (or (and (or .cse0 .cse1) (= ~b$w_buff0_used~0_In2099105778 |P0Thread1of1ForFork2_#t~ite5_Out2099105778|)) (and (not .cse0) (= 0 |P0Thread1of1ForFork2_#t~ite5_Out2099105778|) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2099105778, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In2099105778} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2099105778, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In2099105778, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out2099105778|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 02:18:12,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L756-->L756-2: Formula: (let ((.cse2 (= (mod ~b$r_buff1_thd1~0_In293378844 256) 0)) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In293378844 256))) (.cse1 (= (mod ~b$r_buff0_thd1~0_In293378844 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In293378844 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite6_Out293378844| ~b$w_buff1_used~0_In293378844) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork2_#t~ite6_Out293378844| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In293378844, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In293378844, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In293378844, ~b$w_buff1_used~0=~b$w_buff1_used~0_In293378844} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In293378844, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In293378844, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In293378844, ~b$w_buff1_used~0=~b$w_buff1_used~0_In293378844, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out293378844|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 02:18:12,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L757-->L758: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In895885909 256) 0)) (.cse0 (= 0 (mod ~b$r_buff0_thd1~0_In895885909 256)))) (or (and (= 0 ~b$r_buff0_thd1~0_Out895885909) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~b$r_buff0_thd1~0_Out895885909 ~b$r_buff0_thd1~0_In895885909)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In895885909, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In895885909} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In895885909, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out895885909, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out895885909|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 02:18:12,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L758-->L758-2: Formula: (let ((.cse2 (= (mod ~b$r_buff1_thd1~0_In-331397995 256) 0)) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In-331397995 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd1~0_In-331397995 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In-331397995 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_Out-331397995| ~b$r_buff1_thd1~0_In-331397995) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork2_#t~ite8_Out-331397995| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-331397995, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-331397995, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-331397995, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-331397995} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-331397995, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-331397995, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-331397995, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-331397995, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-331397995|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 02:18:12,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L758-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= |v_P0Thread1of1ForFork2_#t~ite8_36| v_~b$r_buff1_thd1~0_103) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80)) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_103, P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_35|, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~b$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 02:18:12,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L846-1-->L852: Formula: (and (= 3 v_~__unbuffered_cnt~0_33) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:18:12,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L852-2-->L852-4: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff1_thd0~0_In461614783 256))) (.cse0 (= (mod ~b$w_buff1_used~0_In461614783 256) 0))) (or (and (= ~b~0_In461614783 |ULTIMATE.start_main_#t~ite47_Out461614783|) (or .cse0 .cse1)) (and (= ~b$w_buff1~0_In461614783 |ULTIMATE.start_main_#t~ite47_Out461614783|) (not .cse1) (not .cse0)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In461614783, ~b$w_buff1_used~0=~b$w_buff1_used~0_In461614783, ~b~0=~b~0_In461614783, ~b$w_buff1~0=~b$w_buff1~0_In461614783} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In461614783, ~b$w_buff1_used~0=~b$w_buff1_used~0_In461614783, ~b~0=~b~0_In461614783, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out461614783|, ~b$w_buff1~0=~b$w_buff1~0_In461614783} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 02:18:12,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L852-4-->L853: Formula: (= v_~b~0_51 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{~b~0=v_~b~0_51, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~b~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 02:18:12,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In28769235 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In28769235 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out28769235| 0)) (and (= |ULTIMATE.start_main_#t~ite49_Out28769235| ~b$w_buff0_used~0_In28769235) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In28769235, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In28769235} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In28769235, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out28769235|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In28769235} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 02:18:12,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L854-->L854-2: Formula: (let ((.cse2 (= 0 (mod ~b$w_buff0_used~0_In293559787 256))) (.cse3 (= 0 (mod ~b$r_buff0_thd0~0_In293559787 256))) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In293559787 256))) (.cse1 (= 0 (mod ~b$r_buff1_thd0~0_In293559787 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out293559787| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite50_Out293559787| ~b$w_buff1_used~0_In293559787)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In293559787, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In293559787, ~b$w_buff1_used~0=~b$w_buff1_used~0_In293559787, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In293559787} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out293559787|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In293559787, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In293559787, ~b$w_buff1_used~0=~b$w_buff1_used~0_In293559787, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In293559787} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 02:18:12,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L855-->L855-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In-1173155821 256))) (.cse0 (= (mod ~b$r_buff0_thd0~0_In-1173155821 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-1173155821|) (not .cse1)) (and (= ~b$r_buff0_thd0~0_In-1173155821 |ULTIMATE.start_main_#t~ite51_Out-1173155821|) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1173155821, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1173155821} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1173155821, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1173155821|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1173155821} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 02:18:12,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L856-->L856-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In940673143 256))) (.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In940673143 256))) (.cse2 (= 0 (mod ~b$w_buff1_used~0_In940673143 256))) (.cse3 (= 0 (mod ~b$r_buff1_thd0~0_In940673143 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out940673143|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out940673143| ~b$r_buff1_thd0~0_In940673143)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In940673143, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In940673143, ~b$w_buff1_used~0=~b$w_buff1_used~0_In940673143, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In940673143} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In940673143, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out940673143|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In940673143, ~b$w_buff1_used~0=~b$w_buff1_used~0_In940673143, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In940673143} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 02:18:12,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_19) (= v_~b$r_buff1_thd0~0_185 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_~main$tmp_guard1~0_18 0) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= 0 v_~__unbuffered_p0_EAX~0_139) (= v_~__unbuffered_p2_EBX~0_26 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_185, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~b$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:18:12,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:18:12 BasicIcfg [2019-12-27 02:18:12,882 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:18:12,883 INFO L168 Benchmark]: Toolchain (without parser) took 117293.98 ms. Allocated memory was 138.9 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 100.9 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-27 02:18:12,884 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 138.9 MB. Free memory is still 120.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 02:18:12,884 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.19 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.9 MB in the beginning and 155.6 MB in the end (delta: -54.7 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2019-12-27 02:18:12,884 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.03 ms. Allocated memory is still 203.4 MB. Free memory was 155.6 MB in the beginning and 153.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 02:18:12,885 INFO L168 Benchmark]: Boogie Preprocessor took 38.56 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 150.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 02:18:12,886 INFO L168 Benchmark]: RCFGBuilder took 823.42 ms. Allocated memory is still 203.4 MB. Free memory was 150.8 MB in the beginning and 99.8 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:18:12,886 INFO L168 Benchmark]: TraceAbstraction took 115595.21 ms. Allocated memory was 203.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 98.8 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 02:18:12,888 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 138.9 MB. Free memory is still 120.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 767.19 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.9 MB in the beginning and 155.6 MB in the end (delta: -54.7 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.03 ms. Allocated memory is still 203.4 MB. Free memory was 155.6 MB in the beginning and 153.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.56 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 150.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 823.42 ms. Allocated memory is still 203.4 MB. Free memory was 150.8 MB in the beginning and 99.8 MB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 115595.21 ms. Allocated memory was 203.4 MB in the beginning and 3.6 GB in the end (delta: 3.4 GB). Free memory was 98.8 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 180 ProgramPointsBefore, 96 ProgramPointsAfterwards, 217 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7698 VarBasedMoverChecksPositive, 261 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 271 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 83556 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t861, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t862, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t863, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L739] 1 b$w_buff1 = b$w_buff0 [L740] 1 b$w_buff0 = 1 [L741] 1 b$w_buff1_used = b$w_buff0_used [L742] 1 b$w_buff0_used = (_Bool)1 [L754] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L768] 2 x = 1 [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L780] 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L754] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L781] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L782] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L783] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 3 z = 1 [L797] 3 a = 1 [L800] 3 __unbuffered_p2_EAX = a [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 b$flush_delayed = weak$$choice2 [L806] 3 b$mem_tmp = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) VAL [!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L808] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L809] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1))=0, x=1, y=1, z=1] [L809] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L810] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L821] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L822] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L755] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L756] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L852] 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L854] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L855] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 115.2s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 39.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7787 SDtfs, 12276 SDslu, 30094 SDs, 0 SdLazy, 19644 SolverSat, 542 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 517 GetRequests, 75 SyntacticMatches, 18 SemanticMatches, 424 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1646 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171775occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 41.5s AutomataMinimizationTime, 35 MinimizatonAttempts, 178931 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1847 NumberOfCodeBlocks, 1847 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1745 ConstructedInterpolants, 0 QuantifiedInterpolants, 369755 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...