/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:53:02,425 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:53:02,427 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:53:02,439 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:53:02,440 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:53:02,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:53:02,442 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:53:02,444 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:53:02,446 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:53:02,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:53:02,448 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:53:02,449 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:53:02,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:53:02,450 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:53:02,451 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:53:02,452 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:53:02,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:53:02,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:53:02,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:53:02,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:53:02,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:53:02,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:53:02,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:53:02,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:53:02,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:53:02,464 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:53:02,464 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:53:02,465 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:53:02,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:53:02,466 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:53:02,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:53:02,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:53:02,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:53:02,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:53:02,470 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:53:02,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:53:02,471 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:53:02,472 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:53:02,472 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:53:02,474 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:53:02,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:53:02,479 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-VariableLbe.epf [2019-12-27 05:53:02,501 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:53:02,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:53:02,504 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:53:02,504 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:53:02,504 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:53:02,505 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:53:02,505 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:53:02,505 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:53:02,505 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:53:02,505 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:53:02,506 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:53:02,507 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:53:02,507 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:53:02,507 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:53:02,508 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:53:02,508 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:53:02,508 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:53:02,508 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:53:02,508 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:53:02,508 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:53:02,509 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:53:02,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:53:02,509 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:53:02,509 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:53:02,510 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:53:02,510 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:53:02,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:53:02,510 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:53:02,510 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:53:02,511 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:53:02,788 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:53:02,808 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:53:02,811 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:53:02,813 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:53:02,813 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:53:02,814 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_tso.opt.i [2019-12-27 05:53:02,879 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/542c5a015/c4d6bd45835a44dd941264a66d7c6ee4/FLAG4c0ff067e [2019-12-27 05:53:03,493 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:53:03,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_tso.opt.i [2019-12-27 05:53:03,521 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/542c5a015/c4d6bd45835a44dd941264a66d7c6ee4/FLAG4c0ff067e [2019-12-27 05:53:03,725 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/542c5a015/c4d6bd45835a44dd941264a66d7c6ee4 [2019-12-27 05:53:03,735 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:53:03,737 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:53:03,738 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:53:03,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:53:03,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:53:03,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:53:03" (1/1) ... [2019-12-27 05:53:03,746 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a6e624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:53:03, skipping insertion in model container [2019-12-27 05:53:03,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:53:03" (1/1) ... [2019-12-27 05:53:03,754 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:53:03,803 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:53:04,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:53:04,336 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:53:04,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:53:04,503 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:53:04,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:53:04 WrapperNode [2019-12-27 05:53:04,505 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:53:04,506 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:53:04,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:53:04,506 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:53:04,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:53:04" (1/1) ... [2019-12-27 05:53:04,544 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:53:04" (1/1) ... [2019-12-27 05:53:04,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:53:04,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:53:04,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:53:04,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:53:04,585 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:53:04" (1/1) ... [2019-12-27 05:53:04,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:53:04" (1/1) ... [2019-12-27 05:53:04,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:53:04" (1/1) ... [2019-12-27 05:53:04,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:53:04" (1/1) ... [2019-12-27 05:53:04,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:53:04" (1/1) ... [2019-12-27 05:53:04,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:53:04" (1/1) ... [2019-12-27 05:53:04,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:53:04" (1/1) ... [2019-12-27 05:53:04,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:53:04,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:53:04,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:53:04,616 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:53:04,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:53:04" (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 05:53:04,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:53:04,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:53:04,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:53:04,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:53:04,684 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:53:04,685 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:53:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:53:04,685 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:53:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 05:53:04,685 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 05:53:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:53:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:53:04,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:53:04,688 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 05:53:05,514 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:53:05,514 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:53:05,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:53:05 BoogieIcfgContainer [2019-12-27 05:53:05,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:53:05,517 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:53:05,517 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:53:05,520 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:53:05,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:53:03" (1/3) ... [2019-12-27 05:53:05,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f93e151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:53:05, skipping insertion in model container [2019-12-27 05:53:05,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:53:04" (2/3) ... [2019-12-27 05:53:05,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f93e151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:53:05, skipping insertion in model container [2019-12-27 05:53:05,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:53:05" (3/3) ... [2019-12-27 05:53:05,524 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_tso.opt.i [2019-12-27 05:53:05,535 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:53:05,535 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:53:05,546 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:53:05,547 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:53:05,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,600 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,601 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,601 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,602 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,603 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,612 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,612 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,616 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,617 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,618 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,621 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,621 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,655 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,656 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,657 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,658 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,659 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,660 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,661 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,662 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,665 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,666 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,667 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,667 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,668 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,669 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,677 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,677 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,677 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,679 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,679 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:53:05,696 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 05:53:05,717 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:53:05,717 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:53:05,718 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:53:05,718 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:53:05,718 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:53:05,718 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:53:05,718 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:53:05,718 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:53:05,735 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 05:53:05,737 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 05:53:05,861 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 05:53:05,861 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:53:05,880 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:53:05,902 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 05:53:05,963 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 05:53:05,964 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:53:05,971 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:53:05,993 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 05:53:05,994 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:53:09,436 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 05:53:09,592 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 05:53:09,628 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82648 [2019-12-27 05:53:09,629 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 05:53:09,633 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 106 transitions [2019-12-27 05:53:32,585 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129058 states. [2019-12-27 05:53:32,587 INFO L276 IsEmpty]: Start isEmpty. Operand 129058 states. [2019-12-27 05:53:32,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 05:53:32,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:53:32,593 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 05:53:32,594 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 05:53:32,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:53:32,599 INFO L82 PathProgramCache]: Analyzing trace with hash 914072, now seen corresponding path program 1 times [2019-12-27 05:53:32,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:53:32,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144320148] [2019-12-27 05:53:32,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:53:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:53:32,794 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 05:53:32,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144320148] [2019-12-27 05:53:32,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:53:32,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:53:32,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358506928] [2019-12-27 05:53:32,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:53:32,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:53:32,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:53:32,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:53:32,814 INFO L87 Difference]: Start difference. First operand 129058 states. Second operand 3 states. [2019-12-27 05:53:36,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:53:36,005 INFO L93 Difference]: Finished difference Result 128056 states and 545104 transitions. [2019-12-27 05:53:36,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:53:36,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 05:53:36,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:53:36,706 INFO L225 Difference]: With dead ends: 128056 [2019-12-27 05:53:36,706 INFO L226 Difference]: Without dead ends: 120020 [2019-12-27 05:53:36,708 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 05:53:44,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120020 states. [2019-12-27 05:53:47,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120020 to 120020. [2019-12-27 05:53:47,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120020 states. [2019-12-27 05:53:52,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120020 states to 120020 states and 510230 transitions. [2019-12-27 05:53:52,473 INFO L78 Accepts]: Start accepts. Automaton has 120020 states and 510230 transitions. Word has length 3 [2019-12-27 05:53:52,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:53:52,473 INFO L462 AbstractCegarLoop]: Abstraction has 120020 states and 510230 transitions. [2019-12-27 05:53:52,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:53:52,473 INFO L276 IsEmpty]: Start isEmpty. Operand 120020 states and 510230 transitions. [2019-12-27 05:53:52,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 05:53:52,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:53:52,479 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:53:52,479 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 05:53:52,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:53:52,480 INFO L82 PathProgramCache]: Analyzing trace with hash 634457403, now seen corresponding path program 1 times [2019-12-27 05:53:52,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:53:52,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364928446] [2019-12-27 05:53:52,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:53:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:53:52,586 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 05:53:52,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364928446] [2019-12-27 05:53:52,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:53:52,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:53:52,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013101458] [2019-12-27 05:53:52,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:53:52,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:53:52,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:53:52,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:53:52,590 INFO L87 Difference]: Start difference. First operand 120020 states and 510230 transitions. Second operand 4 states. [2019-12-27 05:53:58,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:53:58,236 INFO L93 Difference]: Finished difference Result 186650 states and 761123 transitions. [2019-12-27 05:53:58,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:53:58,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 05:53:58,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:53:59,000 INFO L225 Difference]: With dead ends: 186650 [2019-12-27 05:53:59,001 INFO L226 Difference]: Without dead ends: 186601 [2019-12-27 05:53:59,001 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 05:54:06,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186601 states. [2019-12-27 05:54:10,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186601 to 170989. [2019-12-27 05:54:10,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170989 states. [2019-12-27 05:54:11,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170989 states to 170989 states and 706730 transitions. [2019-12-27 05:54:11,015 INFO L78 Accepts]: Start accepts. Automaton has 170989 states and 706730 transitions. Word has length 11 [2019-12-27 05:54:11,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:11,017 INFO L462 AbstractCegarLoop]: Abstraction has 170989 states and 706730 transitions. [2019-12-27 05:54:11,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:54:11,017 INFO L276 IsEmpty]: Start isEmpty. Operand 170989 states and 706730 transitions. [2019-12-27 05:54:11,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 05:54:11,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:11,022 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:54:11,022 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 05:54:11,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:11,022 INFO L82 PathProgramCache]: Analyzing trace with hash 401091072, now seen corresponding path program 1 times [2019-12-27 05:54:11,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:11,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847817323] [2019-12-27 05:54:11,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:11,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:54:11,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847817323] [2019-12-27 05:54:11,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:11,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:54:11,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165439728] [2019-12-27 05:54:11,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:54:11,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:11,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:54:11,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:54:11,111 INFO L87 Difference]: Start difference. First operand 170989 states and 706730 transitions. Second operand 3 states. [2019-12-27 05:54:11,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:11,267 INFO L93 Difference]: Finished difference Result 36488 states and 117956 transitions. [2019-12-27 05:54:11,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:54:11,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 05:54:11,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:11,352 INFO L225 Difference]: With dead ends: 36488 [2019-12-27 05:54:11,352 INFO L226 Difference]: Without dead ends: 36488 [2019-12-27 05:54:11,352 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 05:54:11,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36488 states. [2019-12-27 05:54:16,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36488 to 36488. [2019-12-27 05:54:16,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36488 states. [2019-12-27 05:54:17,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36488 states to 36488 states and 117956 transitions. [2019-12-27 05:54:17,041 INFO L78 Accepts]: Start accepts. Automaton has 36488 states and 117956 transitions. Word has length 13 [2019-12-27 05:54:17,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:17,042 INFO L462 AbstractCegarLoop]: Abstraction has 36488 states and 117956 transitions. [2019-12-27 05:54:17,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:54:17,042 INFO L276 IsEmpty]: Start isEmpty. Operand 36488 states and 117956 transitions. [2019-12-27 05:54:17,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:54:17,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:17,046 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:54:17,046 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 05:54:17,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:17,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1042189126, now seen corresponding path program 1 times [2019-12-27 05:54:17,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:17,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998242367] [2019-12-27 05:54:17,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:17,160 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 05:54:17,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998242367] [2019-12-27 05:54:17,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:17,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:54:17,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535780217] [2019-12-27 05:54:17,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:54:17,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:17,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:54:17,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:54:17,164 INFO L87 Difference]: Start difference. First operand 36488 states and 117956 transitions. Second operand 5 states. [2019-12-27 05:54:17,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:17,674 INFO L93 Difference]: Finished difference Result 49379 states and 157671 transitions. [2019-12-27 05:54:17,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:54:17,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 05:54:17,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:17,757 INFO L225 Difference]: With dead ends: 49379 [2019-12-27 05:54:17,757 INFO L226 Difference]: Without dead ends: 49379 [2019-12-27 05:54:17,757 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 05:54:18,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49379 states. [2019-12-27 05:54:18,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49379 to 41803. [2019-12-27 05:54:18,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41803 states. [2019-12-27 05:54:18,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41803 states to 41803 states and 134583 transitions. [2019-12-27 05:54:18,893 INFO L78 Accepts]: Start accepts. Automaton has 41803 states and 134583 transitions. Word has length 16 [2019-12-27 05:54:18,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:18,894 INFO L462 AbstractCegarLoop]: Abstraction has 41803 states and 134583 transitions. [2019-12-27 05:54:18,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:54:18,894 INFO L276 IsEmpty]: Start isEmpty. Operand 41803 states and 134583 transitions. [2019-12-27 05:54:18,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:54:18,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:18,905 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 05:54:18,905 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 05:54:18,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:18,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1062845656, now seen corresponding path program 1 times [2019-12-27 05:54:18,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:18,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426959522] [2019-12-27 05:54:18,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:19,019 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 05:54:19,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426959522] [2019-12-27 05:54:19,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:19,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:54:19,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8955462] [2019-12-27 05:54:19,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:54:19,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:19,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:54:19,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:54:19,022 INFO L87 Difference]: Start difference. First operand 41803 states and 134583 transitions. Second operand 6 states. [2019-12-27 05:54:19,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:19,961 INFO L93 Difference]: Finished difference Result 61952 states and 194620 transitions. [2019-12-27 05:54:19,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:54:19,962 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 05:54:19,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:20,058 INFO L225 Difference]: With dead ends: 61952 [2019-12-27 05:54:20,058 INFO L226 Difference]: Without dead ends: 61945 [2019-12-27 05:54:20,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 05:54:20,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61945 states. [2019-12-27 05:54:20,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61945 to 42202. [2019-12-27 05:54:20,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42202 states. [2019-12-27 05:54:21,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42202 states to 42202 states and 134980 transitions. [2019-12-27 05:54:21,527 INFO L78 Accepts]: Start accepts. Automaton has 42202 states and 134980 transitions. Word has length 22 [2019-12-27 05:54:21,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:21,527 INFO L462 AbstractCegarLoop]: Abstraction has 42202 states and 134980 transitions. [2019-12-27 05:54:21,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:54:21,527 INFO L276 IsEmpty]: Start isEmpty. Operand 42202 states and 134980 transitions. [2019-12-27 05:54:21,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 05:54:21,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:21,541 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 05:54:21,541 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 05:54:21,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:21,542 INFO L82 PathProgramCache]: Analyzing trace with hash 389254536, now seen corresponding path program 1 times [2019-12-27 05:54:21,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:21,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052452941] [2019-12-27 05:54:21,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:21,610 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 05:54:21,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052452941] [2019-12-27 05:54:21,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:21,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:54:21,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345888058] [2019-12-27 05:54:21,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:54:21,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:21,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:54:21,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:54:21,613 INFO L87 Difference]: Start difference. First operand 42202 states and 134980 transitions. Second operand 4 states. [2019-12-27 05:54:21,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:21,697 INFO L93 Difference]: Finished difference Result 17764 states and 53552 transitions. [2019-12-27 05:54:21,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:54:21,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 05:54:21,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:21,730 INFO L225 Difference]: With dead ends: 17764 [2019-12-27 05:54:21,731 INFO L226 Difference]: Without dead ends: 17764 [2019-12-27 05:54:21,731 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 05:54:21,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17764 states. [2019-12-27 05:54:21,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17764 to 17380. [2019-12-27 05:54:21,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17380 states. [2019-12-27 05:54:22,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17380 states to 17380 states and 52512 transitions. [2019-12-27 05:54:22,010 INFO L78 Accepts]: Start accepts. Automaton has 17380 states and 52512 transitions. Word has length 25 [2019-12-27 05:54:22,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:22,011 INFO L462 AbstractCegarLoop]: Abstraction has 17380 states and 52512 transitions. [2019-12-27 05:54:22,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:54:22,011 INFO L276 IsEmpty]: Start isEmpty. Operand 17380 states and 52512 transitions. [2019-12-27 05:54:22,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:54:22,023 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:22,023 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 05:54:22,024 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 05:54:22,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:22,024 INFO L82 PathProgramCache]: Analyzing trace with hash -565342962, now seen corresponding path program 1 times [2019-12-27 05:54:22,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:22,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529931124] [2019-12-27 05:54:22,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:22,117 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 05:54:22,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529931124] [2019-12-27 05:54:22,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:22,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:54:22,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670009616] [2019-12-27 05:54:22,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:54:22,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:22,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:54:22,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:54:22,119 INFO L87 Difference]: Start difference. First operand 17380 states and 52512 transitions. Second operand 6 states. [2019-12-27 05:54:22,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:22,655 INFO L93 Difference]: Finished difference Result 24778 states and 73126 transitions. [2019-12-27 05:54:22,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 05:54:22,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 05:54:22,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:22,689 INFO L225 Difference]: With dead ends: 24778 [2019-12-27 05:54:22,689 INFO L226 Difference]: Without dead ends: 24778 [2019-12-27 05:54:22,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 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 05:54:22,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24778 states. [2019-12-27 05:54:22,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24778 to 19837. [2019-12-27 05:54:22,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19837 states. [2019-12-27 05:54:23,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19837 states to 19837 states and 59751 transitions. [2019-12-27 05:54:23,009 INFO L78 Accepts]: Start accepts. Automaton has 19837 states and 59751 transitions. Word has length 27 [2019-12-27 05:54:23,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:23,010 INFO L462 AbstractCegarLoop]: Abstraction has 19837 states and 59751 transitions. [2019-12-27 05:54:23,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:54:23,010 INFO L276 IsEmpty]: Start isEmpty. Operand 19837 states and 59751 transitions. [2019-12-27 05:54:23,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:54:23,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:23,028 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 05:54:23,028 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 05:54:23,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:23,029 INFO L82 PathProgramCache]: Analyzing trace with hash -26145312, now seen corresponding path program 1 times [2019-12-27 05:54:23,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:23,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704412050] [2019-12-27 05:54:23,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:23,133 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 05:54:23,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704412050] [2019-12-27 05:54:23,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:23,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:54:23,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202511989] [2019-12-27 05:54:23,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:54:23,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:23,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:54:23,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:54:23,136 INFO L87 Difference]: Start difference. First operand 19837 states and 59751 transitions. Second operand 7 states. [2019-12-27 05:54:24,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:24,224 INFO L93 Difference]: Finished difference Result 27047 states and 79356 transitions. [2019-12-27 05:54:24,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 05:54:24,225 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 05:54:24,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:24,265 INFO L225 Difference]: With dead ends: 27047 [2019-12-27 05:54:24,265 INFO L226 Difference]: Without dead ends: 27047 [2019-12-27 05:54:24,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 05:54:24,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27047 states. [2019-12-27 05:54:24,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27047 to 18334. [2019-12-27 05:54:24,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18334 states. [2019-12-27 05:54:24,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18334 states to 18334 states and 55114 transitions. [2019-12-27 05:54:24,856 INFO L78 Accepts]: Start accepts. Automaton has 18334 states and 55114 transitions. Word has length 33 [2019-12-27 05:54:24,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:24,857 INFO L462 AbstractCegarLoop]: Abstraction has 18334 states and 55114 transitions. [2019-12-27 05:54:24,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:54:24,857 INFO L276 IsEmpty]: Start isEmpty. Operand 18334 states and 55114 transitions. [2019-12-27 05:54:24,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:54:24,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:24,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] [2019-12-27 05:54:24,881 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 05:54:24,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:24,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1777489015, now seen corresponding path program 1 times [2019-12-27 05:54:24,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:24,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440562280] [2019-12-27 05:54:24,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:24,955 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 05:54:24,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440562280] [2019-12-27 05:54:24,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:24,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:54:24,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407173159] [2019-12-27 05:54:24,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:54:24,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:24,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:54:24,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:54:24,958 INFO L87 Difference]: Start difference. First operand 18334 states and 55114 transitions. Second operand 3 states. [2019-12-27 05:54:25,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:25,033 INFO L93 Difference]: Finished difference Result 18333 states and 55112 transitions. [2019-12-27 05:54:25,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:54:25,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 05:54:25,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:25,074 INFO L225 Difference]: With dead ends: 18333 [2019-12-27 05:54:25,075 INFO L226 Difference]: Without dead ends: 18333 [2019-12-27 05:54:25,075 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 05:54:25,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18333 states. [2019-12-27 05:54:25,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18333 to 18333. [2019-12-27 05:54:25,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18333 states. [2019-12-27 05:54:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18333 states to 18333 states and 55112 transitions. [2019-12-27 05:54:25,537 INFO L78 Accepts]: Start accepts. Automaton has 18333 states and 55112 transitions. Word has length 39 [2019-12-27 05:54:25,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:25,537 INFO L462 AbstractCegarLoop]: Abstraction has 18333 states and 55112 transitions. [2019-12-27 05:54:25,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:54:25,537 INFO L276 IsEmpty]: Start isEmpty. Operand 18333 states and 55112 transitions. [2019-12-27 05:54:25,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:54:25,573 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:25,574 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 05:54:25,574 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 05:54:25,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:25,574 INFO L82 PathProgramCache]: Analyzing trace with hash 51869366, now seen corresponding path program 1 times [2019-12-27 05:54:25,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:25,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879317024] [2019-12-27 05:54:25,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:25,662 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 05:54:25,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879317024] [2019-12-27 05:54:25,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:25,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:54:25,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581763190] [2019-12-27 05:54:25,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:54:25,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:25,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:54:25,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:54:25,664 INFO L87 Difference]: Start difference. First operand 18333 states and 55112 transitions. Second operand 4 states. [2019-12-27 05:54:25,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:25,758 INFO L93 Difference]: Finished difference Result 30242 states and 91634 transitions. [2019-12-27 05:54:25,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:54:25,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 05:54:25,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:25,783 INFO L225 Difference]: With dead ends: 30242 [2019-12-27 05:54:25,783 INFO L226 Difference]: Without dead ends: 15767 [2019-12-27 05:54:25,784 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 05:54:25,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15767 states. [2019-12-27 05:54:26,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15767 to 15693. [2019-12-27 05:54:26,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15693 states. [2019-12-27 05:54:26,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15693 states to 15693 states and 46442 transitions. [2019-12-27 05:54:26,030 INFO L78 Accepts]: Start accepts. Automaton has 15693 states and 46442 transitions. Word has length 40 [2019-12-27 05:54:26,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:26,030 INFO L462 AbstractCegarLoop]: Abstraction has 15693 states and 46442 transitions. [2019-12-27 05:54:26,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:54:26,030 INFO L276 IsEmpty]: Start isEmpty. Operand 15693 states and 46442 transitions. [2019-12-27 05:54:26,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:54:26,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:26,047 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 05:54:26,047 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 05:54:26,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:26,048 INFO L82 PathProgramCache]: Analyzing trace with hash 573984020, now seen corresponding path program 2 times [2019-12-27 05:54:26,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:26,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031885476] [2019-12-27 05:54:26,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:26,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:54:26,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031885476] [2019-12-27 05:54:26,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:26,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:54:26,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129238534] [2019-12-27 05:54:26,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:54:26,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:26,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:54:26,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:54:26,110 INFO L87 Difference]: Start difference. First operand 15693 states and 46442 transitions. Second operand 3 states. [2019-12-27 05:54:26,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:26,202 INFO L93 Difference]: Finished difference Result 25156 states and 74663 transitions. [2019-12-27 05:54:26,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:54:26,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 05:54:26,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:26,221 INFO L225 Difference]: With dead ends: 25156 [2019-12-27 05:54:26,221 INFO L226 Difference]: Without dead ends: 11596 [2019-12-27 05:54:26,221 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 05:54:26,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11596 states. [2019-12-27 05:54:26,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11596 to 11531. [2019-12-27 05:54:26,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11531 states. [2019-12-27 05:54:26,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11531 states to 11531 states and 33132 transitions. [2019-12-27 05:54:26,414 INFO L78 Accepts]: Start accepts. Automaton has 11531 states and 33132 transitions. Word has length 40 [2019-12-27 05:54:26,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:26,414 INFO L462 AbstractCegarLoop]: Abstraction has 11531 states and 33132 transitions. [2019-12-27 05:54:26,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:54:26,414 INFO L276 IsEmpty]: Start isEmpty. Operand 11531 states and 33132 transitions. [2019-12-27 05:54:26,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:54:26,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:26,429 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 05:54:26,429 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 05:54:26,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:26,429 INFO L82 PathProgramCache]: Analyzing trace with hash 974597418, now seen corresponding path program 3 times [2019-12-27 05:54:26,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:26,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072027105] [2019-12-27 05:54:26,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:26,497 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 05:54:26,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072027105] [2019-12-27 05:54:26,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:26,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:54:26,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095550874] [2019-12-27 05:54:26,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:54:26,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:26,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:54:26,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:54:26,499 INFO L87 Difference]: Start difference. First operand 11531 states and 33132 transitions. Second operand 5 states. [2019-12-27 05:54:26,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:26,580 INFO L93 Difference]: Finished difference Result 10699 states and 31268 transitions. [2019-12-27 05:54:26,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:54:26,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 05:54:26,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:26,598 INFO L225 Difference]: With dead ends: 10699 [2019-12-27 05:54:26,599 INFO L226 Difference]: Without dead ends: 6792 [2019-12-27 05:54:26,599 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 05:54:26,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6792 states. [2019-12-27 05:54:27,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6792 to 6792. [2019-12-27 05:54:27,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6792 states. [2019-12-27 05:54:27,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6792 states to 6792 states and 22017 transitions. [2019-12-27 05:54:27,136 INFO L78 Accepts]: Start accepts. Automaton has 6792 states and 22017 transitions. Word has length 40 [2019-12-27 05:54:27,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:27,136 INFO L462 AbstractCegarLoop]: Abstraction has 6792 states and 22017 transitions. [2019-12-27 05:54:27,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:54:27,137 INFO L276 IsEmpty]: Start isEmpty. Operand 6792 states and 22017 transitions. [2019-12-27 05:54:27,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:54:27,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:27,148 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 05:54:27,148 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 05:54:27,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:27,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1875886253, now seen corresponding path program 1 times [2019-12-27 05:54:27,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:27,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490450993] [2019-12-27 05:54:27,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:27,261 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 05:54:27,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490450993] [2019-12-27 05:54:27,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:27,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:54:27,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442177015] [2019-12-27 05:54:27,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:54:27,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:27,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:54:27,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:54:27,263 INFO L87 Difference]: Start difference. First operand 6792 states and 22017 transitions. Second operand 7 states. [2019-12-27 05:54:27,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:27,549 INFO L93 Difference]: Finished difference Result 13682 states and 43391 transitions. [2019-12-27 05:54:27,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:54:27,550 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 05:54:27,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:27,569 INFO L225 Difference]: With dead ends: 13682 [2019-12-27 05:54:27,569 INFO L226 Difference]: Without dead ends: 10287 [2019-12-27 05:54:27,570 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 05:54:27,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10287 states. [2019-12-27 05:54:27,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10287 to 8280. [2019-12-27 05:54:27,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8280 states. [2019-12-27 05:54:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8280 states to 8280 states and 26738 transitions. [2019-12-27 05:54:27,747 INFO L78 Accepts]: Start accepts. Automaton has 8280 states and 26738 transitions. Word has length 64 [2019-12-27 05:54:27,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:27,748 INFO L462 AbstractCegarLoop]: Abstraction has 8280 states and 26738 transitions. [2019-12-27 05:54:27,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:54:27,748 INFO L276 IsEmpty]: Start isEmpty. Operand 8280 states and 26738 transitions. [2019-12-27 05:54:27,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:54:27,758 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:27,758 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:54:27,759 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 05:54:27,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:27,759 INFO L82 PathProgramCache]: Analyzing trace with hash -233855723, now seen corresponding path program 2 times [2019-12-27 05:54:27,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:27,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461215818] [2019-12-27 05:54:27,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:27,849 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 05:54:27,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461215818] [2019-12-27 05:54:27,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:27,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:54:27,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820241027] [2019-12-27 05:54:27,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:54:27,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:27,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:54:27,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:54:27,852 INFO L87 Difference]: Start difference. First operand 8280 states and 26738 transitions. Second operand 7 states. [2019-12-27 05:54:28,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:28,114 INFO L93 Difference]: Finished difference Result 15353 states and 48447 transitions. [2019-12-27 05:54:28,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:54:28,114 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 05:54:28,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:28,135 INFO L225 Difference]: With dead ends: 15353 [2019-12-27 05:54:28,136 INFO L226 Difference]: Without dead ends: 11623 [2019-12-27 05:54:28,137 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 05:54:28,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-27 05:54:28,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 9382. [2019-12-27 05:54:28,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9382 states. [2019-12-27 05:54:28,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9382 states to 9382 states and 30156 transitions. [2019-12-27 05:54:28,408 INFO L78 Accepts]: Start accepts. Automaton has 9382 states and 30156 transitions. Word has length 64 [2019-12-27 05:54:28,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:28,408 INFO L462 AbstractCegarLoop]: Abstraction has 9382 states and 30156 transitions. [2019-12-27 05:54:28,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:54:28,409 INFO L276 IsEmpty]: Start isEmpty. Operand 9382 states and 30156 transitions. [2019-12-27 05:54:28,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:54:28,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:28,424 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 05:54:28,425 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 05:54:28,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:28,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1270827741, now seen corresponding path program 3 times [2019-12-27 05:54:28,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:28,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591816119] [2019-12-27 05:54:28,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:28,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:28,567 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 05:54:28,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591816119] [2019-12-27 05:54:28,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:28,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:54:28,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18851238] [2019-12-27 05:54:28,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:54:28,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:28,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:54:28,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:54:28,570 INFO L87 Difference]: Start difference. First operand 9382 states and 30156 transitions. Second operand 9 states. [2019-12-27 05:54:30,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:30,141 INFO L93 Difference]: Finished difference Result 53485 states and 171065 transitions. [2019-12-27 05:54:30,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 05:54:30,142 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 05:54:30,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:30,229 INFO L225 Difference]: With dead ends: 53485 [2019-12-27 05:54:30,229 INFO L226 Difference]: Without dead ends: 43652 [2019-12-27 05:54:30,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=322, Invalid=868, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 05:54:30,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43652 states. [2019-12-27 05:54:30,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43652 to 9634. [2019-12-27 05:54:30,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9634 states. [2019-12-27 05:54:31,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9634 states to 9634 states and 31168 transitions. [2019-12-27 05:54:31,006 INFO L78 Accepts]: Start accepts. Automaton has 9634 states and 31168 transitions. Word has length 64 [2019-12-27 05:54:31,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:31,006 INFO L462 AbstractCegarLoop]: Abstraction has 9634 states and 31168 transitions. [2019-12-27 05:54:31,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:54:31,006 INFO L276 IsEmpty]: Start isEmpty. Operand 9634 states and 31168 transitions. [2019-12-27 05:54:31,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:54:31,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:31,020 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 05:54:31,020 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 05:54:31,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:31,021 INFO L82 PathProgramCache]: Analyzing trace with hash 917508348, now seen corresponding path program 1 times [2019-12-27 05:54:31,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:31,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445102785] [2019-12-27 05:54:31,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:31,074 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 05:54:31,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445102785] [2019-12-27 05:54:31,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:31,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:54:31,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384302641] [2019-12-27 05:54:31,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:54:31,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:31,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:54:31,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:54:31,076 INFO L87 Difference]: Start difference. First operand 9634 states and 31168 transitions. Second operand 3 states. [2019-12-27 05:54:31,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:31,162 INFO L93 Difference]: Finished difference Result 13619 states and 44172 transitions. [2019-12-27 05:54:31,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:54:31,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 05:54:31,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:31,183 INFO L225 Difference]: With dead ends: 13619 [2019-12-27 05:54:31,183 INFO L226 Difference]: Without dead ends: 13619 [2019-12-27 05:54:31,184 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 05:54:31,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13619 states. [2019-12-27 05:54:31,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13619 to 11423. [2019-12-27 05:54:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11423 states. [2019-12-27 05:54:31,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11423 states to 11423 states and 37451 transitions. [2019-12-27 05:54:31,400 INFO L78 Accepts]: Start accepts. Automaton has 11423 states and 37451 transitions. Word has length 64 [2019-12-27 05:54:31,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:31,400 INFO L462 AbstractCegarLoop]: Abstraction has 11423 states and 37451 transitions. [2019-12-27 05:54:31,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:54:31,400 INFO L276 IsEmpty]: Start isEmpty. Operand 11423 states and 37451 transitions. [2019-12-27 05:54:31,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:54:31,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:31,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, 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 05:54:31,414 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 05:54:31,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:31,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1537602983, now seen corresponding path program 4 times [2019-12-27 05:54:31,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:31,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363174597] [2019-12-27 05:54:31,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:31,526 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 05:54:31,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363174597] [2019-12-27 05:54:31,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:31,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:54:31,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406163981] [2019-12-27 05:54:31,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:54:31,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:31,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:54:31,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:54:31,528 INFO L87 Difference]: Start difference. First operand 11423 states and 37451 transitions. Second operand 9 states. [2019-12-27 05:54:32,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:32,711 INFO L93 Difference]: Finished difference Result 45185 states and 141607 transitions. [2019-12-27 05:54:32,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:54:32,712 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 05:54:32,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:32,767 INFO L225 Difference]: With dead ends: 45185 [2019-12-27 05:54:32,767 INFO L226 Difference]: Without dead ends: 40231 [2019-12-27 05:54:32,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=590, Unknown=0, NotChecked=0, Total=812 [2019-12-27 05:54:32,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40231 states. [2019-12-27 05:54:33,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40231 to 11451. [2019-12-27 05:54:33,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11451 states. [2019-12-27 05:54:33,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11451 states to 11451 states and 37605 transitions. [2019-12-27 05:54:33,154 INFO L78 Accepts]: Start accepts. Automaton has 11451 states and 37605 transitions. Word has length 64 [2019-12-27 05:54:33,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:33,154 INFO L462 AbstractCegarLoop]: Abstraction has 11451 states and 37605 transitions. [2019-12-27 05:54:33,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:54:33,154 INFO L276 IsEmpty]: Start isEmpty. Operand 11451 states and 37605 transitions. [2019-12-27 05:54:33,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:54:33,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:33,168 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 05:54:33,168 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 05:54:33,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:33,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1888227633, now seen corresponding path program 5 times [2019-12-27 05:54:33,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:33,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078334012] [2019-12-27 05:54:33,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:33,236 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 05:54:33,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078334012] [2019-12-27 05:54:33,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:33,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:54:33,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783519246] [2019-12-27 05:54:33,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:54:33,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:33,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:54:33,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:54:33,238 INFO L87 Difference]: Start difference. First operand 11451 states and 37605 transitions. Second operand 3 states. [2019-12-27 05:54:33,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:33,333 INFO L93 Difference]: Finished difference Result 13625 states and 44189 transitions. [2019-12-27 05:54:33,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:54:33,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 05:54:33,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:33,353 INFO L225 Difference]: With dead ends: 13625 [2019-12-27 05:54:33,353 INFO L226 Difference]: Without dead ends: 13625 [2019-12-27 05:54:33,354 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 05:54:33,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13625 states. [2019-12-27 05:54:33,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13625 to 12377. [2019-12-27 05:54:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12377 states. [2019-12-27 05:54:33,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12377 states to 12377 states and 40445 transitions. [2019-12-27 05:54:33,571 INFO L78 Accepts]: Start accepts. Automaton has 12377 states and 40445 transitions. Word has length 64 [2019-12-27 05:54:33,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:33,571 INFO L462 AbstractCegarLoop]: Abstraction has 12377 states and 40445 transitions. [2019-12-27 05:54:33,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:54:33,572 INFO L276 IsEmpty]: Start isEmpty. Operand 12377 states and 40445 transitions. [2019-12-27 05:54:33,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:54:33,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:33,591 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 05:54:33,591 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 05:54:33,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:33,592 INFO L82 PathProgramCache]: Analyzing trace with hash 614331262, now seen corresponding path program 1 times [2019-12-27 05:54:33,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:33,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18206270] [2019-12-27 05:54:33,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:33,644 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 05:54:33,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18206270] [2019-12-27 05:54:33,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:33,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:54:33,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085954534] [2019-12-27 05:54:33,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:54:33,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:33,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:54:33,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:54:33,646 INFO L87 Difference]: Start difference. First operand 12377 states and 40445 transitions. Second operand 3 states. [2019-12-27 05:54:33,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:33,827 INFO L93 Difference]: Finished difference Result 18388 states and 59830 transitions. [2019-12-27 05:54:33,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:54:33,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 05:54:33,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:33,856 INFO L225 Difference]: With dead ends: 18388 [2019-12-27 05:54:33,856 INFO L226 Difference]: Without dead ends: 18388 [2019-12-27 05:54:33,857 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 05:54:33,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18388 states. [2019-12-27 05:54:34,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18388 to 12948. [2019-12-27 05:54:34,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12948 states. [2019-12-27 05:54:34,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12948 states to 12948 states and 42250 transitions. [2019-12-27 05:54:34,355 INFO L78 Accepts]: Start accepts. Automaton has 12948 states and 42250 transitions. Word has length 65 [2019-12-27 05:54:34,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:34,355 INFO L462 AbstractCegarLoop]: Abstraction has 12948 states and 42250 transitions. [2019-12-27 05:54:34,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:54:34,355 INFO L276 IsEmpty]: Start isEmpty. Operand 12948 states and 42250 transitions. [2019-12-27 05:54:34,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:54:34,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:34,369 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 05:54:34,369 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 05:54:34,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:34,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1069012218, now seen corresponding path program 2 times [2019-12-27 05:54:34,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:34,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742494273] [2019-12-27 05:54:34,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:34,478 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 05:54:34,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742494273] [2019-12-27 05:54:34,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:34,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:54:34,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120373954] [2019-12-27 05:54:34,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:54:34,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:34,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:54:34,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:54:34,480 INFO L87 Difference]: Start difference. First operand 12948 states and 42250 transitions. Second operand 9 states. [2019-12-27 05:54:35,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:35,486 INFO L93 Difference]: Finished difference Result 39920 states and 125028 transitions. [2019-12-27 05:54:35,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 05:54:35,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 05:54:35,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:35,537 INFO L225 Difference]: With dead ends: 39920 [2019-12-27 05:54:35,537 INFO L226 Difference]: Without dead ends: 36380 [2019-12-27 05:54:35,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2019-12-27 05:54:35,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36380 states. [2019-12-27 05:54:35,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36380 to 12318. [2019-12-27 05:54:35,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12318 states. [2019-12-27 05:54:35,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12318 states to 12318 states and 39954 transitions. [2019-12-27 05:54:35,910 INFO L78 Accepts]: Start accepts. Automaton has 12318 states and 39954 transitions. Word has length 65 [2019-12-27 05:54:35,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:35,911 INFO L462 AbstractCegarLoop]: Abstraction has 12318 states and 39954 transitions. [2019-12-27 05:54:35,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:54:35,911 INFO L276 IsEmpty]: Start isEmpty. Operand 12318 states and 39954 transitions. [2019-12-27 05:54:35,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:54:35,923 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:35,924 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 05:54:35,924 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 05:54:35,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:35,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1039758982, now seen corresponding path program 3 times [2019-12-27 05:54:35,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:35,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510244681] [2019-12-27 05:54:35,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:36,038 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 05:54:36,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510244681] [2019-12-27 05:54:36,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:36,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:54:36,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079519742] [2019-12-27 05:54:36,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:54:36,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:36,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:54:36,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:54:36,040 INFO L87 Difference]: Start difference. First operand 12318 states and 39954 transitions. Second operand 9 states. [2019-12-27 05:54:37,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:37,528 INFO L93 Difference]: Finished difference Result 48293 states and 150377 transitions. [2019-12-27 05:54:37,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 05:54:37,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 05:54:37,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:37,595 INFO L225 Difference]: With dead ends: 48293 [2019-12-27 05:54:37,595 INFO L226 Difference]: Without dead ends: 36189 [2019-12-27 05:54:37,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=639, Unknown=0, NotChecked=0, Total=870 [2019-12-27 05:54:37,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36189 states. [2019-12-27 05:54:37,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36189 to 13536. [2019-12-27 05:54:37,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13536 states. [2019-12-27 05:54:37,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13536 states to 13536 states and 43763 transitions. [2019-12-27 05:54:37,998 INFO L78 Accepts]: Start accepts. Automaton has 13536 states and 43763 transitions. Word has length 65 [2019-12-27 05:54:37,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:37,998 INFO L462 AbstractCegarLoop]: Abstraction has 13536 states and 43763 transitions. [2019-12-27 05:54:37,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:54:37,998 INFO L276 IsEmpty]: Start isEmpty. Operand 13536 states and 43763 transitions. [2019-12-27 05:54:38,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:54:38,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:38,258 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 05:54:38,259 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 05:54:38,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:38,259 INFO L82 PathProgramCache]: Analyzing trace with hash -506815583, now seen corresponding path program 1 times [2019-12-27 05:54:38,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:38,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180885735] [2019-12-27 05:54:38,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:38,315 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 05:54:38,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180885735] [2019-12-27 05:54:38,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:38,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:54:38,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129558451] [2019-12-27 05:54:38,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:54:38,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:38,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:54:38,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:54:38,318 INFO L87 Difference]: Start difference. First operand 13536 states and 43763 transitions. Second operand 3 states. [2019-12-27 05:54:38,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:38,372 INFO L93 Difference]: Finished difference Result 11866 states and 37579 transitions. [2019-12-27 05:54:38,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:54:38,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 05:54:38,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:38,397 INFO L225 Difference]: With dead ends: 11866 [2019-12-27 05:54:38,397 INFO L226 Difference]: Without dead ends: 11866 [2019-12-27 05:54:38,402 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 05:54:38,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11866 states. [2019-12-27 05:54:38,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11866 to 11866. [2019-12-27 05:54:38,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11866 states. [2019-12-27 05:54:38,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11866 states to 11866 states and 37579 transitions. [2019-12-27 05:54:38,772 INFO L78 Accepts]: Start accepts. Automaton has 11866 states and 37579 transitions. Word has length 65 [2019-12-27 05:54:38,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:38,773 INFO L462 AbstractCegarLoop]: Abstraction has 11866 states and 37579 transitions. [2019-12-27 05:54:38,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:54:38,773 INFO L276 IsEmpty]: Start isEmpty. Operand 11866 states and 37579 transitions. [2019-12-27 05:54:38,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:54:38,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:38,796 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 05:54:38,796 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 05:54:38,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:38,797 INFO L82 PathProgramCache]: Analyzing trace with hash 553188743, now seen corresponding path program 1 times [2019-12-27 05:54:38,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:38,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636371712] [2019-12-27 05:54:38,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:38,922 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 05:54:38,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636371712] [2019-12-27 05:54:38,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:38,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:54:38,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030688982] [2019-12-27 05:54:38,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:54:38,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:38,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:54:38,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:54:38,926 INFO L87 Difference]: Start difference. First operand 11866 states and 37579 transitions. Second operand 8 states. [2019-12-27 05:54:39,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:39,704 INFO L93 Difference]: Finished difference Result 20184 states and 62903 transitions. [2019-12-27 05:54:39,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 05:54:39,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-27 05:54:39,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:39,727 INFO L225 Difference]: With dead ends: 20184 [2019-12-27 05:54:39,727 INFO L226 Difference]: Without dead ends: 15133 [2019-12-27 05:54:39,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-27 05:54:39,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15133 states. [2019-12-27 05:54:39,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15133 to 12362. [2019-12-27 05:54:39,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12362 states. [2019-12-27 05:54:39,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12362 states to 12362 states and 38821 transitions. [2019-12-27 05:54:39,958 INFO L78 Accepts]: Start accepts. Automaton has 12362 states and 38821 transitions. Word has length 66 [2019-12-27 05:54:39,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:39,958 INFO L462 AbstractCegarLoop]: Abstraction has 12362 states and 38821 transitions. [2019-12-27 05:54:39,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:54:39,958 INFO L276 IsEmpty]: Start isEmpty. Operand 12362 states and 38821 transitions. [2019-12-27 05:54:39,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:54:39,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:39,972 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 05:54:39,973 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 05:54:39,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:39,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1174316229, now seen corresponding path program 2 times [2019-12-27 05:54:39,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:39,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806387625] [2019-12-27 05:54:39,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:40,076 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 05:54:40,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806387625] [2019-12-27 05:54:40,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:40,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:54:40,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524863549] [2019-12-27 05:54:40,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:54:40,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:40,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:54:40,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:54:40,081 INFO L87 Difference]: Start difference. First operand 12362 states and 38821 transitions. Second operand 9 states. [2019-12-27 05:54:41,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:41,012 INFO L93 Difference]: Finished difference Result 19440 states and 60053 transitions. [2019-12-27 05:54:41,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 05:54:41,013 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 05:54:41,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:41,035 INFO L225 Difference]: With dead ends: 19440 [2019-12-27 05:54:41,036 INFO L226 Difference]: Without dead ends: 14941 [2019-12-27 05:54:41,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-27 05:54:41,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14941 states. [2019-12-27 05:54:41,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14941 to 12242. [2019-12-27 05:54:41,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12242 states. [2019-12-27 05:54:41,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12242 states to 12242 states and 38405 transitions. [2019-12-27 05:54:41,266 INFO L78 Accepts]: Start accepts. Automaton has 12242 states and 38405 transitions. Word has length 66 [2019-12-27 05:54:41,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:41,266 INFO L462 AbstractCegarLoop]: Abstraction has 12242 states and 38405 transitions. [2019-12-27 05:54:41,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:54:41,266 INFO L276 IsEmpty]: Start isEmpty. Operand 12242 states and 38405 transitions. [2019-12-27 05:54:41,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:54:41,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:41,279 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 05:54:41,279 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 05:54:41,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:41,279 INFO L82 PathProgramCache]: Analyzing trace with hash 877096621, now seen corresponding path program 3 times [2019-12-27 05:54:41,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:41,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751899867] [2019-12-27 05:54:41,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:41,414 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 05:54:41,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751899867] [2019-12-27 05:54:41,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:41,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:54:41,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761237619] [2019-12-27 05:54:41,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 05:54:41,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:41,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 05:54:41,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:54:41,416 INFO L87 Difference]: Start difference. First operand 12242 states and 38405 transitions. Second operand 10 states. [2019-12-27 05:54:42,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:42,129 INFO L93 Difference]: Finished difference Result 19398 states and 59780 transitions. [2019-12-27 05:54:42,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:54:42,130 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 05:54:42,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:42,153 INFO L225 Difference]: With dead ends: 19398 [2019-12-27 05:54:42,153 INFO L226 Difference]: Without dead ends: 15363 [2019-12-27 05:54:42,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-12-27 05:54:42,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15363 states. [2019-12-27 05:54:42,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15363 to 12282. [2019-12-27 05:54:42,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12282 states. [2019-12-27 05:54:42,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12282 states to 12282 states and 38419 transitions. [2019-12-27 05:54:42,383 INFO L78 Accepts]: Start accepts. Automaton has 12282 states and 38419 transitions. Word has length 66 [2019-12-27 05:54:42,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:42,383 INFO L462 AbstractCegarLoop]: Abstraction has 12282 states and 38419 transitions. [2019-12-27 05:54:42,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 05:54:42,383 INFO L276 IsEmpty]: Start isEmpty. Operand 12282 states and 38419 transitions. [2019-12-27 05:54:42,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:54:42,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:42,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:54:42,397 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 05:54:42,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:42,397 INFO L82 PathProgramCache]: Analyzing trace with hash -700189627, now seen corresponding path program 4 times [2019-12-27 05:54:42,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:42,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181724167] [2019-12-27 05:54:42,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:42,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:54:42,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181724167] [2019-12-27 05:54:42,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:42,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 05:54:42,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47448017] [2019-12-27 05:54:42,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:54:42,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:42,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:54:42,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:54:42,791 INFO L87 Difference]: Start difference. First operand 12282 states and 38419 transitions. Second operand 11 states. [2019-12-27 05:54:43,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:43,554 INFO L93 Difference]: Finished difference Result 18678 states and 57378 transitions. [2019-12-27 05:54:43,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 05:54:43,554 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 05:54:43,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:43,576 INFO L225 Difference]: With dead ends: 18678 [2019-12-27 05:54:43,577 INFO L226 Difference]: Without dead ends: 14763 [2019-12-27 05:54:43,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2019-12-27 05:54:43,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14763 states. [2019-12-27 05:54:43,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14763 to 12090. [2019-12-27 05:54:43,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12090 states. [2019-12-27 05:54:43,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12090 states to 12090 states and 37749 transitions. [2019-12-27 05:54:43,814 INFO L78 Accepts]: Start accepts. Automaton has 12090 states and 37749 transitions. Word has length 66 [2019-12-27 05:54:43,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:43,814 INFO L462 AbstractCegarLoop]: Abstraction has 12090 states and 37749 transitions. [2019-12-27 05:54:43,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:54:43,814 INFO L276 IsEmpty]: Start isEmpty. Operand 12090 states and 37749 transitions. [2019-12-27 05:54:43,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:54:43,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:43,829 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 05:54:43,829 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 05:54:43,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:43,829 INFO L82 PathProgramCache]: Analyzing trace with hash 498939327, now seen corresponding path program 5 times [2019-12-27 05:54:43,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:43,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594981802] [2019-12-27 05:54:43,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:44,001 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 05:54:44,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594981802] [2019-12-27 05:54:44,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:44,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 05:54:44,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130467771] [2019-12-27 05:54:44,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 05:54:44,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:44,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 05:54:44,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:54:44,003 INFO L87 Difference]: Start difference. First operand 12090 states and 37749 transitions. Second operand 12 states. [2019-12-27 05:54:44,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:44,802 INFO L93 Difference]: Finished difference Result 14970 states and 45952 transitions. [2019-12-27 05:54:44,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:54:44,803 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 05:54:44,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:44,823 INFO L225 Difference]: With dead ends: 14970 [2019-12-27 05:54:44,823 INFO L226 Difference]: Without dead ends: 14731 [2019-12-27 05:54:44,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 05:54:44,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14731 states. [2019-12-27 05:54:45,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14731 to 11914. [2019-12-27 05:54:45,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11914 states. [2019-12-27 05:54:45,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11914 states to 11914 states and 37265 transitions. [2019-12-27 05:54:45,030 INFO L78 Accepts]: Start accepts. Automaton has 11914 states and 37265 transitions. Word has length 66 [2019-12-27 05:54:45,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:45,031 INFO L462 AbstractCegarLoop]: Abstraction has 11914 states and 37265 transitions. [2019-12-27 05:54:45,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 05:54:45,031 INFO L276 IsEmpty]: Start isEmpty. Operand 11914 states and 37265 transitions. [2019-12-27 05:54:45,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:54:45,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:45,042 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 05:54:45,042 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 05:54:45,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:45,043 INFO L82 PathProgramCache]: Analyzing trace with hash -856403297, now seen corresponding path program 6 times [2019-12-27 05:54:45,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:45,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249338422] [2019-12-27 05:54:45,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:45,234 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 05:54:45,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249338422] [2019-12-27 05:54:45,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:45,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 05:54:45,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413425147] [2019-12-27 05:54:45,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 05:54:45,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:45,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 05:54:45,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:54:45,237 INFO L87 Difference]: Start difference. First operand 11914 states and 37265 transitions. Second operand 12 states. [2019-12-27 05:54:47,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:47,505 INFO L93 Difference]: Finished difference Result 25542 states and 76743 transitions. [2019-12-27 05:54:47,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 05:54:47,506 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 05:54:47,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:47,541 INFO L225 Difference]: With dead ends: 25542 [2019-12-27 05:54:47,542 INFO L226 Difference]: Without dead ends: 25278 [2019-12-27 05:54:47,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-12-27 05:54:47,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25278 states. [2019-12-27 05:54:48,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25278 to 18194. [2019-12-27 05:54:48,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18194 states. [2019-12-27 05:54:48,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18194 states to 18194 states and 55361 transitions. [2019-12-27 05:54:48,187 INFO L78 Accepts]: Start accepts. Automaton has 18194 states and 55361 transitions. Word has length 66 [2019-12-27 05:54:48,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:48,188 INFO L462 AbstractCegarLoop]: Abstraction has 18194 states and 55361 transitions. [2019-12-27 05:54:48,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 05:54:48,188 INFO L276 IsEmpty]: Start isEmpty. Operand 18194 states and 55361 transitions. [2019-12-27 05:54:48,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:54:48,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:48,207 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 05:54:48,207 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 05:54:48,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:48,207 INFO L82 PathProgramCache]: Analyzing trace with hash 654181681, now seen corresponding path program 7 times [2019-12-27 05:54:48,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:48,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911295972] [2019-12-27 05:54:48,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:54:48,266 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 05:54:48,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911295972] [2019-12-27 05:54:48,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:54:48,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:54:48,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144699259] [2019-12-27 05:54:48,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:54:48,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:54:48,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:54:48,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:54:48,267 INFO L87 Difference]: Start difference. First operand 18194 states and 55361 transitions. Second operand 3 states. [2019-12-27 05:54:48,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:54:48,340 INFO L93 Difference]: Finished difference Result 18194 states and 55360 transitions. [2019-12-27 05:54:48,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:54:48,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 05:54:48,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:54:48,377 INFO L225 Difference]: With dead ends: 18194 [2019-12-27 05:54:48,378 INFO L226 Difference]: Without dead ends: 18194 [2019-12-27 05:54:48,382 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 05:54:48,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18194 states. [2019-12-27 05:54:48,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18194 to 15999. [2019-12-27 05:54:48,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15999 states. [2019-12-27 05:54:48,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15999 states to 15999 states and 49292 transitions. [2019-12-27 05:54:48,899 INFO L78 Accepts]: Start accepts. Automaton has 15999 states and 49292 transitions. Word has length 66 [2019-12-27 05:54:48,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:54:48,899 INFO L462 AbstractCegarLoop]: Abstraction has 15999 states and 49292 transitions. [2019-12-27 05:54:48,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:54:48,899 INFO L276 IsEmpty]: Start isEmpty. Operand 15999 states and 49292 transitions. [2019-12-27 05:54:48,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:54:48,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:54:48,922 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 05:54:48,923 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 05:54:48,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:54:48,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1158921090, now seen corresponding path program 1 times [2019-12-27 05:54:48,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:54:48,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820404716] [2019-12-27 05:54:48,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:54:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:54:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:54:49,133 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:54:49,134 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:54:49,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= 0 v_~a$r_buff1_thd3~0_51) (= v_~z~0_13 0) (= v_~a$r_buff0_thd0~0_20 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_cnt~0_20) (= v_~main$tmp_guard0~0_9 0) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t654~0.base_19|) (= 0 v_~a$read_delayed~0_7) (= 0 v_~__unbuffered_p0_EAX~0_12) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t654~0.base_19| 4)) (= v_~a$read_delayed_var~0.offset_7 0) (= |v_ULTIMATE.start_main_~#t654~0.offset_16| 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~x~0_9) (= 0 v_~weak$$choice2~0_32) (= 0 v_~a$r_buff1_thd1~0_15) (= v_~a~0_28 0) (= 0 v_~a$w_buff1_used~0_73) (= v_~a$flush_delayed~0_13 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t654~0.base_19|)) (= 0 v_~a$w_buff0_used~0_112) (= 0 v_~__unbuffered_p2_EAX~0_11) (= v_~a$r_buff0_thd2~0_20 0) (= 0 |v_#NULL.base_6|) (= v_~__unbuffered_p2_EBX~0_13 0) (= 0 v_~weak$$choice0~0_7) (= v_~a$mem_tmp~0_10 0) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t654~0.base_19| 1)) (= v_~__unbuffered_p0_EBX~0_12 0) (= 0 v_~a$r_buff1_thd0~0_19) (= v_~a$r_buff0_thd3~0_75 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t654~0.base_19| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t654~0.base_19|) |v_ULTIMATE.start_main_~#t654~0.offset_16| 0)) |v_#memory_int_19|) (= 0 v_~a$r_buff1_thd2~0_17) (= 0 v_~a$w_buff0~0_26) (= v_~y~0_10 0) (= v_~a$r_buff0_thd1~0_26 0) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~a$w_buff1~0_25))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t655~0.offset=|v_ULTIMATE.start_main_~#t655~0.offset_16|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_10|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_20, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_10|, ~a~0=v_~a~0_28, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_16|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, ULTIMATE.start_main_~#t656~0.base=|v_ULTIMATE.start_main_~#t656~0.base_22|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_11, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_13, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_12, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_26, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_26, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_19, ULTIMATE.start_main_~#t656~0.offset=|v_ULTIMATE.start_main_~#t656~0.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_9, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~a$mem_tmp~0=v_~a$mem_tmp~0_10, ULTIMATE.start_main_~#t654~0.base=|v_ULTIMATE.start_main_~#t654~0.base_19|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_10|, ~a$w_buff1~0=v_~a$w_buff1~0_25, ULTIMATE.start_main_~#t654~0.offset=|v_ULTIMATE.start_main_~#t654~0.offset_16|, ~y~0=v_~y~0_10, ULTIMATE.start_main_~#t655~0.base=|v_ULTIMATE.start_main_~#t655~0.base_21|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_8|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_15, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_75, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_13, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_13, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_73, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t655~0.offset, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t656~0.base, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ULTIMATE.start_main_~#t656~0.offset, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_~#t654~0.base, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t654~0.offset, ~y~0, ULTIMATE.start_main_~#t655~0.base, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 05:54:49,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L835-1-->L837: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t655~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t655~0.base_10|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t655~0.base_10|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t655~0.base_10|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t655~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t655~0.base_10|) |v_ULTIMATE.start_main_~#t655~0.offset_9| 1)) |v_#memory_int_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t655~0.base_10| 4) |v_#length_17|) (= 0 |v_ULTIMATE.start_main_~#t655~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t655~0.base=|v_ULTIMATE.start_main_~#t655~0.base_10|, ULTIMATE.start_main_~#t655~0.offset=|v_ULTIMATE.start_main_~#t655~0.offset_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t655~0.base, ULTIMATE.start_main_~#t655~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 05:54:49,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L837-1-->L839: Formula: (and (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t656~0.base_13| 1) |v_#valid_31|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t656~0.base_13|) (= |v_ULTIMATE.start_main_~#t656~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t656~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t656~0.base_13|) |v_ULTIMATE.start_main_~#t656~0.offset_11| 2)) |v_#memory_int_11|) (not (= 0 |v_ULTIMATE.start_main_~#t656~0.base_13|)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t656~0.base_13|) 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t656~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t656~0.base=|v_ULTIMATE.start_main_~#t656~0.base_13|, ULTIMATE.start_main_~#t656~0.offset=|v_ULTIMATE.start_main_~#t656~0.offset_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t656~0.base, ULTIMATE.start_main_~#t656~0.offset, #length] because there is no mapped edge [2019-12-27 05:54:49,141 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_4 |v_P0Thread1of1ForFork1_#in~arg.base_4|) (= v_P0Thread1of1ForFork1_~arg.offset_4 |v_P0Thread1of1ForFork1_#in~arg.offset_4|) (= 1 v_~a$w_buff0~0_16) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8) (= v_~a$w_buff0~0_17 v_~a$w_buff1~0_17) (= v_~a$w_buff0_used~0_89 1) (= |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1) (= v_~a$w_buff0_used~0_90 v_~a$w_buff1_used~0_60) (= 0 (mod v_~a$w_buff1_used~0_60 256))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~a$w_buff0~0=v_~a$w_buff0~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_90, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_17, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_4|, ~a$w_buff0~0=v_~a$w_buff0~0_16, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_89, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_4, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_60, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_4|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_4} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 05:54:49,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L776-2-->L776-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In335969312 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In335969312 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out335969312| ~a$w_buff1~0_In335969312) (not .cse1)) (and (or .cse1 .cse0) (= ~a~0_In335969312 |P1Thread1of1ForFork2_#t~ite9_Out335969312|)))) InVars {~a~0=~a~0_In335969312, ~a$w_buff1~0=~a$w_buff1~0_In335969312, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In335969312, ~a$w_buff1_used~0=~a$w_buff1_used~0_In335969312} OutVars{~a~0=~a~0_In335969312, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out335969312|, ~a$w_buff1~0=~a$w_buff1~0_In335969312, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In335969312, ~a$w_buff1_used~0=~a$w_buff1_used~0_In335969312} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 05:54:49,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L757-->L757-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In602505607 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd1~0_In602505607 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out602505607| ~a$w_buff0_used~0_In602505607) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out602505607| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In602505607, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In602505607} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out602505607|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In602505607, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In602505607} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 05:54:49,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L758-->L758-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In-670000282 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In-670000282 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-670000282 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In-670000282 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In-670000282 |P0Thread1of1ForFork1_#t~ite6_Out-670000282|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-670000282|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-670000282, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-670000282, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-670000282, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-670000282} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-670000282|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-670000282, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-670000282, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-670000282, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-670000282} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 05:54:49,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L759-->L760: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd1~0_In-901255175 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-901255175 256)))) (or (and (= ~a$r_buff0_thd1~0_Out-901255175 0) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd1~0_Out-901255175 ~a$r_buff0_thd1~0_In-901255175) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-901255175, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-901255175} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-901255175|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-901255175, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-901255175} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:54:49,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L760-->L760-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In1787626736 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In1787626736 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In1787626736 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In1787626736 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out1787626736| ~a$r_buff1_thd1~0_In1787626736) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1787626736|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1787626736, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1787626736, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1787626736, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1787626736} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1787626736|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1787626736, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1787626736, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1787626736, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1787626736} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 05:54:49,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L760-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_12, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 05:54:49,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L776-4-->L777: Formula: (= v_~a~0_20 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{~a~0=v_~a~0_20, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 05:54:49,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-1379770585 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1379770585 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-1379770585|) (not .cse1)) (and (= ~a$w_buff0_used~0_In-1379770585 |P1Thread1of1ForFork2_#t~ite11_Out-1379770585|) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1379770585, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1379770585} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1379770585, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1379770585, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1379770585|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 05:54:49,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In-1504220102 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-1504220102 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In-1504220102 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In-1504220102 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1504220102| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite12_Out-1504220102| ~a$w_buff1_used~0_In-1504220102)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1504220102, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1504220102, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1504220102, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1504220102} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1504220102, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1504220102, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1504220102, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1504220102|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1504220102} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 05:54:49,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In435440121 256))) (.cse1 (= (mod ~a$r_buff0_thd2~0_In435440121 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out435440121| 0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out435440121| ~a$r_buff0_thd2~0_In435440121) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In435440121, ~a$w_buff0_used~0=~a$w_buff0_used~0_In435440121} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In435440121, ~a$w_buff0_used~0=~a$w_buff0_used~0_In435440121, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out435440121|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 05:54:49,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L780-->L780-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd2~0_In858567227 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In858567227 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In858567227 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In858567227 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out858567227|)) (and (or .cse2 .cse3) (= ~a$r_buff1_thd2~0_In858567227 |P1Thread1of1ForFork2_#t~ite14_Out858567227|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In858567227, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In858567227, ~a$w_buff0_used~0=~a$w_buff0_used~0_In858567227, ~a$w_buff1_used~0=~a$w_buff1_used~0_In858567227} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In858567227, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In858567227, ~a$w_buff0_used~0=~a$w_buff0_used~0_In858567227, ~a$w_buff1_used~0=~a$w_buff1_used~0_In858567227, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out858567227|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 05:54:49,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L780-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~a$r_buff1_thd2~0_13) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 05:54:49,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L801-->L801-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1653495013 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_In1653495013| |P2Thread1of1ForFork0_#t~ite20_Out1653495013|) (= |P2Thread1of1ForFork0_#t~ite21_Out1653495013| ~a$w_buff0~0_In1653495013) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1653495013 256)))) (or (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In1653495013 256))) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1653495013 256))) (= 0 (mod ~a$w_buff0_used~0_In1653495013 256)))) .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out1653495013| ~a$w_buff0~0_In1653495013) (= |P2Thread1of1ForFork0_#t~ite20_Out1653495013| |P2Thread1of1ForFork0_#t~ite21_Out1653495013|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In1653495013, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1653495013, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1653495013, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1653495013, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1653495013, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In1653495013|, ~weak$$choice2~0=~weak$$choice2~0_In1653495013} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out1653495013|, ~a$w_buff0~0=~a$w_buff0~0_In1653495013, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1653495013, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1653495013, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1653495013, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1653495013|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1653495013, ~weak$$choice2~0=~weak$$choice2~0_In1653495013} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 05:54:49,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L803-->L803-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In971447835 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out971447835| ~a$w_buff0_used~0_In971447835) (= |P2Thread1of1ForFork0_#t~ite26_In971447835| |P2Thread1of1ForFork0_#t~ite26_Out971447835|)) (and (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In971447835 256)))) (or (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In971447835 256))) (and .cse1 (= (mod ~a$w_buff1_used~0_In971447835 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In971447835 256)))) (= |P2Thread1of1ForFork0_#t~ite26_Out971447835| ~a$w_buff0_used~0_In971447835) (= |P2Thread1of1ForFork0_#t~ite27_Out971447835| |P2Thread1of1ForFork0_#t~ite26_Out971447835|) .cse0))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In971447835|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In971447835, ~a$w_buff0_used~0=~a$w_buff0_used~0_In971447835, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In971447835, ~a$w_buff1_used~0=~a$w_buff1_used~0_In971447835, ~weak$$choice2~0=~weak$$choice2~0_In971447835} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out971447835|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out971447835|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In971447835, ~a$w_buff0_used~0=~a$w_buff0_used~0_In971447835, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In971447835, ~a$w_buff1_used~0=~a$w_buff1_used~0_In971447835, ~weak$$choice2~0=~weak$$choice2~0_In971447835} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 05:54:49,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L804-->L804-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In493896588 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite29_In493896588| |P2Thread1of1ForFork0_#t~ite29_Out493896588|) (= ~a$w_buff1_used~0_In493896588 |P2Thread1of1ForFork0_#t~ite30_Out493896588|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite30_Out493896588| |P2Thread1of1ForFork0_#t~ite29_Out493896588|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In493896588 256) 0))) (or (and .cse1 (= (mod ~a$w_buff1_used~0_In493896588 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In493896588 256)) (and (= (mod ~a$r_buff1_thd3~0_In493896588 256) 0) .cse1))) (= ~a$w_buff1_used~0_In493896588 |P2Thread1of1ForFork0_#t~ite29_Out493896588|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In493896588, ~a$w_buff0_used~0=~a$w_buff0_used~0_In493896588, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In493896588, ~a$w_buff1_used~0=~a$w_buff1_used~0_In493896588, ~weak$$choice2~0=~weak$$choice2~0_In493896588, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In493896588|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In493896588, ~a$w_buff0_used~0=~a$w_buff0_used~0_In493896588, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In493896588, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out493896588|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In493896588, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out493896588|, ~weak$$choice2~0=~weak$$choice2~0_In493896588} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 05:54:49,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L805-->L806: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~a$r_buff0_thd3~0_48 v_~a$r_buff0_thd3~0_47)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_47, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 05:54:49,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L808-->L812: Formula: (and (not (= (mod v_~a$flush_delayed~0_7 256) 0)) (= v_~a$flush_delayed~0_6 0) (= v_~a~0_21 v_~a$mem_tmp~0_4)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_21, ~a$mem_tmp~0=v_~a$mem_tmp~0_4, ~a$flush_delayed~0=v_~a$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 05:54:49,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L812-2-->L812-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite39_Out50835319| |P2Thread1of1ForFork0_#t~ite38_Out50835319|)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In50835319 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In50835319 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out50835319| ~a~0_In50835319) (or .cse1 .cse2)) (and .cse0 (not .cse1) (= ~a$w_buff1~0_In50835319 |P2Thread1of1ForFork0_#t~ite38_Out50835319|) (not .cse2)))) InVars {~a~0=~a~0_In50835319, ~a$w_buff1~0=~a$w_buff1~0_In50835319, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In50835319, ~a$w_buff1_used~0=~a$w_buff1_used~0_In50835319} OutVars{~a~0=~a~0_In50835319, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out50835319|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out50835319|, ~a$w_buff1~0=~a$w_buff1~0_In50835319, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In50835319, ~a$w_buff1_used~0=~a$w_buff1_used~0_In50835319} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 05:54:49,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In811789828 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In811789828 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out811789828| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out811789828| ~a$w_buff0_used~0_In811789828)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In811789828, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In811789828} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out811789828|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In811789828, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In811789828} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 05:54:49,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L814-->L814-2: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd3~0_In-2035653268 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-2035653268 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-2035653268 256))) (.cse3 (= (mod ~a$r_buff0_thd3~0_In-2035653268 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out-2035653268| ~a$w_buff1_used~0_In-2035653268) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out-2035653268| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2035653268, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2035653268, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2035653268, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2035653268} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2035653268, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2035653268, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2035653268, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2035653268, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-2035653268|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 05:54:49,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-167754557 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-167754557 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-167754557| 0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-167754557| ~a$r_buff0_thd3~0_In-167754557) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-167754557, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-167754557} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-167754557, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-167754557, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-167754557|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 05:54:49,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1050655637 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1050655637 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd3~0_In-1050655637 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1050655637 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite43_Out-1050655637| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite43_Out-1050655637| ~a$r_buff1_thd3~0_In-1050655637) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1050655637, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1050655637, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1050655637, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1050655637} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1050655637|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1050655637, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1050655637, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1050655637, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1050655637} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 05:54:49,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_44 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 05:54:49,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L839-1-->L845: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 05:54:49,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L845-2-->L845-5: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In1164682312 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In1164682312 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite47_Out1164682312| |ULTIMATE.start_main_#t~ite48_Out1164682312|))) (or (and (not .cse0) .cse1 (= ~a$w_buff1~0_In1164682312 |ULTIMATE.start_main_#t~ite47_Out1164682312|) (not .cse2)) (and (or .cse2 .cse0) .cse1 (= ~a~0_In1164682312 |ULTIMATE.start_main_#t~ite47_Out1164682312|)))) InVars {~a~0=~a~0_In1164682312, ~a$w_buff1~0=~a$w_buff1~0_In1164682312, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1164682312, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1164682312} OutVars{~a~0=~a~0_In1164682312, ~a$w_buff1~0=~a$w_buff1~0_In1164682312, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1164682312|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1164682312, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1164682312|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1164682312} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 05:54:49,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In899938650 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In899938650 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out899938650|)) (and (= |ULTIMATE.start_main_#t~ite49_Out899938650| ~a$w_buff0_used~0_In899938650) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In899938650, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In899938650} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In899938650, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out899938650|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In899938650} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 05:54:49,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L847-->L847-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In1424622380 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd0~0_In1424622380 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In1424622380 256))) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In1424622380 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out1424622380|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$w_buff1_used~0_In1424622380 |ULTIMATE.start_main_#t~ite50_Out1424622380|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1424622380, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1424622380, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1424622380, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1424622380} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1424622380|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1424622380, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1424622380, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1424622380, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1424622380} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 05:54:49,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-250955567 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-250955567 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-250955567|) (not .cse1)) (and (= ~a$r_buff0_thd0~0_In-250955567 |ULTIMATE.start_main_#t~ite51_Out-250955567|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-250955567, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-250955567} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-250955567|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-250955567, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-250955567} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 05:54:49,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-1949103328 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1949103328 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1949103328 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-1949103328 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-1949103328| ~a$r_buff1_thd0~0_In-1949103328) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite52_Out-1949103328| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1949103328, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1949103328, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1949103328, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1949103328} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1949103328|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1949103328, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1949103328, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1949103328, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1949103328} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 05:54:49,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~z~0_9) (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EBX~0_9 0) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~__unbuffered_p0_EAX~0_9 1) (= v_~__unbuffered_p2_EAX~0_8 2) (= |v_ULTIMATE.start_main_#t~ite52_11| v_~a$r_buff1_thd0~0_15) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_11|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~z~0=v_~z~0_9} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_15, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~z~0=v_~z~0_9, 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, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:54:49,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:54:49 BasicIcfg [2019-12-27 05:54:49,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:54:49,302 INFO L168 Benchmark]: Toolchain (without parser) took 105565.74 ms. Allocated memory was 144.2 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 05:54:49,304 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 05:54:49,305 INFO L168 Benchmark]: CACSL2BoogieTranslator took 766.83 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.3 MB in the beginning and 154.6 MB in the end (delta: -54.3 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-27 05:54:49,305 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.39 ms. Allocated memory is still 201.3 MB. Free memory was 154.6 MB in the beginning and 151.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 05:54:49,305 INFO L168 Benchmark]: Boogie Preprocessor took 39.87 ms. Allocated memory is still 201.3 MB. Free memory was 151.8 MB in the beginning and 149.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 05:54:49,306 INFO L168 Benchmark]: RCFGBuilder took 900.25 ms. Allocated memory is still 201.3 MB. Free memory was 149.8 MB in the beginning and 99.1 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-27 05:54:49,306 INFO L168 Benchmark]: TraceAbstraction took 103784.34 ms. Allocated memory was 201.3 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 98.4 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 05:54:49,311 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.47 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 766.83 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.3 MB in the beginning and 154.6 MB in the end (delta: -54.3 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.39 ms. Allocated memory is still 201.3 MB. Free memory was 154.6 MB in the beginning and 151.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.87 ms. Allocated memory is still 201.3 MB. Free memory was 151.8 MB in the beginning and 149.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 900.25 ms. Allocated memory is still 201.3 MB. Free memory was 149.8 MB in the beginning and 99.1 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 103784.34 ms. Allocated memory was 201.3 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 98.4 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 178 ProgramPointsBefore, 96 ProgramPointsAfterwards, 215 TransitionsBefore, 106 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 31 ChoiceCompositions, 6719 VarBasedMoverChecksPositive, 191 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 82648 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t654, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t655, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t656, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L740] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L741] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L742] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L743] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L744] 1 a$r_buff0_thd1 = (_Bool)1 [L747] 1 x = 1 [L750] 1 __unbuffered_p0_EAX = x [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L756] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L770] 2 y = 1 [L773] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L776] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L756] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L757] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L790] 3 z = 2 [L793] 3 __unbuffered_p2_EAX = z [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L800] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L758] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L800] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L777] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L801] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L802] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=2] [L802] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L803] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L804] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=2] [L806] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L812] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L845] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L845] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L848] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 103.4s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 27.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6432 SDtfs, 10908 SDslu, 21297 SDs, 0 SdLazy, 9914 SolverSat, 547 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 397 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1471 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170989occurred 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: 44.6s AutomataMinimizationTime, 29 MinimizatonAttempts, 203073 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1482 NumberOfCodeBlocks, 1482 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1386 ConstructedInterpolants, 0 QuantifiedInterpolants, 259163 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...