/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:30:02,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:30:02,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:30:02,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:30:02,499 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:30:02,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:30:02,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:30:02,503 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:30:02,505 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:30:02,506 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:30:02,507 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:30:02,508 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:30:02,508 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:30:02,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:30:02,510 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:30:02,511 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:30:02,512 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:30:02,513 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:30:02,514 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:30:02,516 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:30:02,518 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:30:02,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:30:02,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:30:02,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:30:02,523 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:30:02,523 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:30:02,524 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:30:02,525 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:30:02,525 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:30:02,526 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:30:02,526 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:30:02,527 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:30:02,528 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:30:02,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:30:02,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:30:02,530 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:30:02,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:30:02,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:30:02,531 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:30:02,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:30:02,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:30:02,533 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 18:30:02,547 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:30:02,547 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:30:02,548 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:30:02,549 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:30:02,549 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:30:02,549 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:30:02,549 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:30:02,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:30:02,550 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:30:02,550 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:30:02,550 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:30:02,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:30:02,550 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:30:02,550 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:30:02,551 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:30:02,551 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:30:02,551 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:30:02,551 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:30:02,551 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:30:02,552 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:30:02,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:30:02,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:30:02,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:30:02,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:30:02,553 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:30:02,553 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:30:02,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:30:02,553 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:30:02,553 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:30:02,805 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:30:02,827 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:30:02,830 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:30:02,832 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:30:02,832 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:30:02,833 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_pso.oepc.i [2019-12-18 18:30:02,899 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7b4920f0/75cc05a1782c4f6aadeba449ca46df4f/FLAG4d6ace76a [2019-12-18 18:30:03,433 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:30:03,434 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_pso.oepc.i [2019-12-18 18:30:03,448 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7b4920f0/75cc05a1782c4f6aadeba449ca46df4f/FLAG4d6ace76a [2019-12-18 18:30:03,709 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7b4920f0/75cc05a1782c4f6aadeba449ca46df4f [2019-12-18 18:30:03,718 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:30:03,720 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:30:03,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:30:03,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:30:03,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:30:03,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:30:03" (1/1) ... [2019-12-18 18:30:03,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@115225be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:30:03, skipping insertion in model container [2019-12-18 18:30:03,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:30:03" (1/1) ... [2019-12-18 18:30:03,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:30:03,809 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:30:04,375 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:30:04,398 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:30:04,468 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:30:04,544 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:30:04,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:30:04 WrapperNode [2019-12-18 18:30:04,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:30:04,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:30:04,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:30:04,546 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:30:04,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:30:04" (1/1) ... [2019-12-18 18:30:04,576 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:30:04" (1/1) ... [2019-12-18 18:30:04,616 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:30:04,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:30:04,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:30:04,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:30:04,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:30:04" (1/1) ... [2019-12-18 18:30:04,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:30:04" (1/1) ... [2019-12-18 18:30:04,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:30:04" (1/1) ... [2019-12-18 18:30:04,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:30:04" (1/1) ... [2019-12-18 18:30:04,644 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:30:04" (1/1) ... [2019-12-18 18:30:04,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:30:04" (1/1) ... [2019-12-18 18:30:04,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:30:04" (1/1) ... [2019-12-18 18:30:04,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:30:04,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:30:04,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:30:04,659 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:30:04,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:30: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-18 18:30:04,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:30:04,720 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:30:04,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:30:04,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:30:04,721 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:30:04,721 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:30:04,721 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:30:04,721 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:30:04,721 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 18:30:04,721 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 18:30:04,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:30:04,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:30:04,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:30:04,724 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 18:30:05,493 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:30:05,493 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:30:05,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:30:05 BoogieIcfgContainer [2019-12-18 18:30:05,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:30:05,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:30:05,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:30:05,500 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:30:05,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:30:03" (1/3) ... [2019-12-18 18:30:05,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226c635e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:30:05, skipping insertion in model container [2019-12-18 18:30:05,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:30:04" (2/3) ... [2019-12-18 18:30:05,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@226c635e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:30:05, skipping insertion in model container [2019-12-18 18:30:05,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:30:05" (3/3) ... [2019-12-18 18:30:05,504 INFO L109 eAbstractionObserver]: Analyzing ICFG safe008_pso.oepc.i [2019-12-18 18:30:05,515 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:30:05,516 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:30:05,524 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:30:05,525 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:30:05,565 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,566 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,566 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,567 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,567 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,568 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,576 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,576 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,614 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,614 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,625 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,626 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,626 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,629 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,630 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,636 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,636 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:30:05,653 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 18:30:05,673 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:30:05,673 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:30:05,673 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:30:05,673 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:30:05,673 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:30:05,673 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:30:05,673 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:30:05,674 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:30:05,691 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 18:30:05,693 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 18:30:05,784 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 18:30:05,784 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:30:05,805 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 18:30:05,831 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 18:30:05,878 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 18:30:05,878 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:30:05,887 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 18:30:05,907 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-18 18:30:05,909 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:30:10,399 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-12-18 18:30:10,758 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 18:30:10,911 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 18:30:10,938 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80053 [2019-12-18 18:30:10,938 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 18:30:10,942 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 106 transitions [2019-12-18 18:30:29,163 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115670 states. [2019-12-18 18:30:29,165 INFO L276 IsEmpty]: Start isEmpty. Operand 115670 states. [2019-12-18 18:30:29,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 18:30:29,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:30:29,172 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 18:30:29,173 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-18 18:30:29,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:30:29,178 INFO L82 PathProgramCache]: Analyzing trace with hash 846448, now seen corresponding path program 1 times [2019-12-18 18:30:29,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:30:29,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898720136] [2019-12-18 18:30:29,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:30:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:30:29,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:30:29,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898720136] [2019-12-18 18:30:29,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:30:29,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:30:29,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600173785] [2019-12-18 18:30:29,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:30:29,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:30:29,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:30:29,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:30:29,491 INFO L87 Difference]: Start difference. First operand 115670 states. Second operand 3 states. [2019-12-18 18:30:30,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:30:30,527 INFO L93 Difference]: Finished difference Result 115182 states and 492924 transitions. [2019-12-18 18:30:30,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:30:30,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 18:30:30,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:30:34,257 INFO L225 Difference]: With dead ends: 115182 [2019-12-18 18:30:34,258 INFO L226 Difference]: Without dead ends: 112830 [2019-12-18 18:30:34,259 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-18 18:30:38,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112830 states. [2019-12-18 18:30:40,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112830 to 112830. [2019-12-18 18:30:40,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112830 states. [2019-12-18 18:30:41,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112830 states to 112830 states and 483320 transitions. [2019-12-18 18:30:41,294 INFO L78 Accepts]: Start accepts. Automaton has 112830 states and 483320 transitions. Word has length 3 [2019-12-18 18:30:41,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:30:41,295 INFO L462 AbstractCegarLoop]: Abstraction has 112830 states and 483320 transitions. [2019-12-18 18:30:41,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:30:41,295 INFO L276 IsEmpty]: Start isEmpty. Operand 112830 states and 483320 transitions. [2019-12-18 18:30:41,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:30:41,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:30:41,299 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:30:41,300 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-18 18:30:41,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:30:41,300 INFO L82 PathProgramCache]: Analyzing trace with hash -939919620, now seen corresponding path program 1 times [2019-12-18 18:30:41,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:30:41,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710031716] [2019-12-18 18:30:41,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:30:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:30:41,432 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-18 18:30:41,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710031716] [2019-12-18 18:30:41,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:30:41,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:30:41,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610175506] [2019-12-18 18:30:41,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:30:41,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:30:41,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:30:41,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:30:41,437 INFO L87 Difference]: Start difference. First operand 112830 states and 483320 transitions. Second operand 4 states. [2019-12-18 18:30:46,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:30:46,703 INFO L93 Difference]: Finished difference Result 176302 states and 727515 transitions. [2019-12-18 18:30:46,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:30:46,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:30:46,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:30:47,498 INFO L225 Difference]: With dead ends: 176302 [2019-12-18 18:30:47,498 INFO L226 Difference]: Without dead ends: 176253 [2019-12-18 18:30:47,499 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-18 18:30:52,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176253 states. [2019-12-18 18:30:55,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176253 to 159436. [2019-12-18 18:30:55,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159436 states. [2019-12-18 18:31:03,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159436 states to 159436 states and 665691 transitions. [2019-12-18 18:31:03,157 INFO L78 Accepts]: Start accepts. Automaton has 159436 states and 665691 transitions. Word has length 11 [2019-12-18 18:31:03,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:31:03,158 INFO L462 AbstractCegarLoop]: Abstraction has 159436 states and 665691 transitions. [2019-12-18 18:31:03,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:31:03,158 INFO L276 IsEmpty]: Start isEmpty. Operand 159436 states and 665691 transitions. [2019-12-18 18:31:03,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:31:03,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:31:03,164 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:31:03,165 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-18 18:31:03,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:31:03,165 INFO L82 PathProgramCache]: Analyzing trace with hash 670018080, now seen corresponding path program 1 times [2019-12-18 18:31:03,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:31:03,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391147636] [2019-12-18 18:31:03,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:31:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:31:03,272 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-18 18:31:03,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391147636] [2019-12-18 18:31:03,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:31:03,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:31:03,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220133825] [2019-12-18 18:31:03,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:31:03,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:31:03,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:31:03,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:31:03,274 INFO L87 Difference]: Start difference. First operand 159436 states and 665691 transitions. Second operand 4 states. [2019-12-18 18:31:11,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:31:11,861 INFO L93 Difference]: Finished difference Result 228428 states and 932375 transitions. [2019-12-18 18:31:11,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:31:11,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 18:31:11,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:31:12,504 INFO L225 Difference]: With dead ends: 228428 [2019-12-18 18:31:12,505 INFO L226 Difference]: Without dead ends: 228365 [2019-12-18 18:31:12,505 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-18 18:31:17,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228365 states. [2019-12-18 18:31:21,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228365 to 192396. [2019-12-18 18:31:21,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192396 states. [2019-12-18 18:31:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192396 states to 192396 states and 797806 transitions. [2019-12-18 18:31:22,001 INFO L78 Accepts]: Start accepts. Automaton has 192396 states and 797806 transitions. Word has length 13 [2019-12-18 18:31:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:31:22,003 INFO L462 AbstractCegarLoop]: Abstraction has 192396 states and 797806 transitions. [2019-12-18 18:31:22,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:31:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 192396 states and 797806 transitions. [2019-12-18 18:31:22,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:31:22,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:31:22,007 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:31:22,007 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-18 18:31:22,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:31:22,008 INFO L82 PathProgramCache]: Analyzing trace with hash -293312110, now seen corresponding path program 1 times [2019-12-18 18:31:22,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:31:22,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170732190] [2019-12-18 18:31:22,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:31:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:31:22,056 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-18 18:31:22,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170732190] [2019-12-18 18:31:22,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:31:22,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:31:22,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570114837] [2019-12-18 18:31:22,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:31:22,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:31:22,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:31:22,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:31:22,061 INFO L87 Difference]: Start difference. First operand 192396 states and 797806 transitions. Second operand 3 states. [2019-12-18 18:31:22,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:31:22,211 INFO L93 Difference]: Finished difference Result 38255 states and 124332 transitions. [2019-12-18 18:31:22,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:31:22,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 18:31:22,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:31:22,272 INFO L225 Difference]: With dead ends: 38255 [2019-12-18 18:31:22,272 INFO L226 Difference]: Without dead ends: 38255 [2019-12-18 18:31:22,273 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-18 18:31:22,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38255 states. [2019-12-18 18:31:24,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38255 to 38255. [2019-12-18 18:31:24,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38255 states. [2019-12-18 18:31:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38255 states to 38255 states and 124332 transitions. [2019-12-18 18:31:24,212 INFO L78 Accepts]: Start accepts. Automaton has 38255 states and 124332 transitions. Word has length 13 [2019-12-18 18:31:24,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:31:24,212 INFO L462 AbstractCegarLoop]: Abstraction has 38255 states and 124332 transitions. [2019-12-18 18:31:24,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:31:24,212 INFO L276 IsEmpty]: Start isEmpty. Operand 38255 states and 124332 transitions. [2019-12-18 18:31:24,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 18:31:24,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:31:24,217 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:31:24,217 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-18 18:31:24,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:31:24,217 INFO L82 PathProgramCache]: Analyzing trace with hash -2105368373, now seen corresponding path program 1 times [2019-12-18 18:31:24,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:31:24,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039168885] [2019-12-18 18:31:24,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:31:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:31:24,329 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-18 18:31:24,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039168885] [2019-12-18 18:31:24,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:31:24,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:31:24,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372661193] [2019-12-18 18:31:24,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:31:24,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:31:24,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:31:24,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:31:24,331 INFO L87 Difference]: Start difference. First operand 38255 states and 124332 transitions. Second operand 5 states. [2019-12-18 18:31:25,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:31:25,138 INFO L93 Difference]: Finished difference Result 51712 states and 164813 transitions. [2019-12-18 18:31:25,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:31:25,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 18:31:25,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:31:25,220 INFO L225 Difference]: With dead ends: 51712 [2019-12-18 18:31:25,221 INFO L226 Difference]: Without dead ends: 51699 [2019-12-18 18:31:25,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:31:25,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51699 states. [2019-12-18 18:31:25,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51699 to 38713. [2019-12-18 18:31:25,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38713 states. [2019-12-18 18:31:25,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38713 states to 38713 states and 125630 transitions. [2019-12-18 18:31:25,951 INFO L78 Accepts]: Start accepts. Automaton has 38713 states and 125630 transitions. Word has length 19 [2019-12-18 18:31:25,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:31:25,952 INFO L462 AbstractCegarLoop]: Abstraction has 38713 states and 125630 transitions. [2019-12-18 18:31:25,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:31:25,952 INFO L276 IsEmpty]: Start isEmpty. Operand 38713 states and 125630 transitions. [2019-12-18 18:31:25,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:31:25,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:31:25,966 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-18 18:31:25,966 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-18 18:31:25,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:31:25,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1240477865, now seen corresponding path program 1 times [2019-12-18 18:31:25,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:31:25,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479068463] [2019-12-18 18:31:25,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:31:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:31:26,026 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-18 18:31:26,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479068463] [2019-12-18 18:31:26,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:31:26,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:31:26,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303100506] [2019-12-18 18:31:26,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:31:26,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:31:26,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:31:26,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:31:26,028 INFO L87 Difference]: Start difference. First operand 38713 states and 125630 transitions. Second operand 4 states. [2019-12-18 18:31:26,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:31:26,074 INFO L93 Difference]: Finished difference Result 7422 states and 20312 transitions. [2019-12-18 18:31:26,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:31:26,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 18:31:26,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:31:26,086 INFO L225 Difference]: With dead ends: 7422 [2019-12-18 18:31:26,086 INFO L226 Difference]: Without dead ends: 7422 [2019-12-18 18:31:26,087 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-18 18:31:26,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7422 states. [2019-12-18 18:31:26,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7422 to 7310. [2019-12-18 18:31:26,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7310 states. [2019-12-18 18:31:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7310 states to 7310 states and 19992 transitions. [2019-12-18 18:31:26,197 INFO L78 Accepts]: Start accepts. Automaton has 7310 states and 19992 transitions. Word has length 25 [2019-12-18 18:31:26,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:31:26,197 INFO L462 AbstractCegarLoop]: Abstraction has 7310 states and 19992 transitions. [2019-12-18 18:31:26,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:31:26,197 INFO L276 IsEmpty]: Start isEmpty. Operand 7310 states and 19992 transitions. [2019-12-18 18:31:26,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 18:31:26,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:31:26,209 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] [2019-12-18 18:31:26,209 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-18 18:31:26,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:31:26,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1041968244, now seen corresponding path program 1 times [2019-12-18 18:31:26,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:31:26,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143600707] [2019-12-18 18:31:26,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:31:26,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:31:26,825 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-18 18:31:26,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143600707] [2019-12-18 18:31:26,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:31:26,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:31:26,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088564318] [2019-12-18 18:31:26,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:31:26,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:31:26,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:31:26,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:31:26,828 INFO L87 Difference]: Start difference. First operand 7310 states and 19992 transitions. Second operand 5 states. [2019-12-18 18:31:26,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:31:26,888 INFO L93 Difference]: Finished difference Result 5312 states and 15267 transitions. [2019-12-18 18:31:26,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:31:26,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 18:31:26,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:31:26,895 INFO L225 Difference]: With dead ends: 5312 [2019-12-18 18:31:26,895 INFO L226 Difference]: Without dead ends: 5312 [2019-12-18 18:31:26,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:31:26,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2019-12-18 18:31:26,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 4948. [2019-12-18 18:31:26,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4948 states. [2019-12-18 18:31:26,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 14283 transitions. [2019-12-18 18:31:26,977 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 14283 transitions. Word has length 37 [2019-12-18 18:31:26,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:31:26,978 INFO L462 AbstractCegarLoop]: Abstraction has 4948 states and 14283 transitions. [2019-12-18 18:31:26,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:31:26,978 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 14283 transitions. [2019-12-18 18:31:26,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:31:26,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:31:26,986 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-18 18:31:26,986 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-18 18:31:26,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:31:26,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1019045356, now seen corresponding path program 1 times [2019-12-18 18:31:26,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:31:26,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171212199] [2019-12-18 18:31:26,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:31:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:31:27,131 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-18 18:31:27,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171212199] [2019-12-18 18:31:27,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:31:27,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:31:27,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543625661] [2019-12-18 18:31:27,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:31:27,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:31:27,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:31:27,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:31:27,134 INFO L87 Difference]: Start difference. First operand 4948 states and 14283 transitions. Second operand 5 states. [2019-12-18 18:31:27,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:31:27,462 INFO L93 Difference]: Finished difference Result 7539 states and 21548 transitions. [2019-12-18 18:31:27,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:31:27,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 18:31:27,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:31:27,475 INFO L225 Difference]: With dead ends: 7539 [2019-12-18 18:31:27,475 INFO L226 Difference]: Without dead ends: 7539 [2019-12-18 18:31:27,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:31:27,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7539 states. [2019-12-18 18:31:27,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7539 to 6345. [2019-12-18 18:31:27,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6345 states. [2019-12-18 18:31:27,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6345 states to 6345 states and 18318 transitions. [2019-12-18 18:31:27,580 INFO L78 Accepts]: Start accepts. Automaton has 6345 states and 18318 transitions. Word has length 65 [2019-12-18 18:31:27,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:31:27,581 INFO L462 AbstractCegarLoop]: Abstraction has 6345 states and 18318 transitions. [2019-12-18 18:31:27,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:31:27,581 INFO L276 IsEmpty]: Start isEmpty. Operand 6345 states and 18318 transitions. [2019-12-18 18:31:27,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:31:27,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:31:27,590 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:31:27,591 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-18 18:31:27,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:31:27,591 INFO L82 PathProgramCache]: Analyzing trace with hash -613444874, now seen corresponding path program 2 times [2019-12-18 18:31:27,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:31:27,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366762754] [2019-12-18 18:31:27,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:31:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:31:27,700 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-18 18:31:27,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366762754] [2019-12-18 18:31:27,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:31:27,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:31:27,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857867515] [2019-12-18 18:31:27,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:31:27,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:31:27,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:31:27,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:31:27,705 INFO L87 Difference]: Start difference. First operand 6345 states and 18318 transitions. Second operand 3 states. [2019-12-18 18:31:27,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:31:27,737 INFO L93 Difference]: Finished difference Result 5975 states and 16977 transitions. [2019-12-18 18:31:27,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:31:27,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 18:31:27,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:31:27,747 INFO L225 Difference]: With dead ends: 5975 [2019-12-18 18:31:27,747 INFO L226 Difference]: Without dead ends: 5975 [2019-12-18 18:31:27,748 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-18 18:31:27,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2019-12-18 18:31:27,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 5819. [2019-12-18 18:31:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5819 states. [2019-12-18 18:31:27,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5819 states to 5819 states and 16547 transitions. [2019-12-18 18:31:27,827 INFO L78 Accepts]: Start accepts. Automaton has 5819 states and 16547 transitions. Word has length 65 [2019-12-18 18:31:27,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:31:27,828 INFO L462 AbstractCegarLoop]: Abstraction has 5819 states and 16547 transitions. [2019-12-18 18:31:27,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:31:27,828 INFO L276 IsEmpty]: Start isEmpty. Operand 5819 states and 16547 transitions. [2019-12-18 18:31:27,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:31:27,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:31:27,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:31:27,837 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-18 18:31:27,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:31:27,837 INFO L82 PathProgramCache]: Analyzing trace with hash 223341978, now seen corresponding path program 1 times [2019-12-18 18:31:27,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:31:27,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723482622] [2019-12-18 18:31:27,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:31:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:31:27,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-18 18:31:27,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723482622] [2019-12-18 18:31:27,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:31:27,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:31:27,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901485989] [2019-12-18 18:31:27,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:31:27,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:31:27,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:31:27,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:31:27,957 INFO L87 Difference]: Start difference. First operand 5819 states and 16547 transitions. Second operand 5 states. [2019-12-18 18:31:28,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:31:28,309 INFO L93 Difference]: Finished difference Result 8394 states and 23622 transitions. [2019-12-18 18:31:28,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:31:28,310 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-18 18:31:28,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:31:28,321 INFO L225 Difference]: With dead ends: 8394 [2019-12-18 18:31:28,321 INFO L226 Difference]: Without dead ends: 8394 [2019-12-18 18:31:28,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:31:28,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8394 states. [2019-12-18 18:31:28,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8394 to 6167. [2019-12-18 18:31:28,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6167 states. [2019-12-18 18:31:28,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6167 states to 6167 states and 17580 transitions. [2019-12-18 18:31:28,413 INFO L78 Accepts]: Start accepts. Automaton has 6167 states and 17580 transitions. Word has length 66 [2019-12-18 18:31:28,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:31:28,413 INFO L462 AbstractCegarLoop]: Abstraction has 6167 states and 17580 transitions. [2019-12-18 18:31:28,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:31:28,414 INFO L276 IsEmpty]: Start isEmpty. Operand 6167 states and 17580 transitions. [2019-12-18 18:31:28,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:31:28,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:31:28,423 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-18 18:31:28,423 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-18 18:31:28,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:31:28,423 INFO L82 PathProgramCache]: Analyzing trace with hash -446701502, now seen corresponding path program 2 times [2019-12-18 18:31:28,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:31:28,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069224255] [2019-12-18 18:31:28,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:31:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:31:28,554 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-18 18:31:28,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069224255] [2019-12-18 18:31:28,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:31:28,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:31:28,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923603562] [2019-12-18 18:31:28,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:31:28,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:31:28,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:31:28,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:31:28,557 INFO L87 Difference]: Start difference. First operand 6167 states and 17580 transitions. Second operand 6 states. [2019-12-18 18:31:28,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:31:28,643 INFO L93 Difference]: Finished difference Result 10724 states and 30575 transitions. [2019-12-18 18:31:28,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:31:28,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 18:31:28,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:31:28,653 INFO L225 Difference]: With dead ends: 10724 [2019-12-18 18:31:28,653 INFO L226 Difference]: Without dead ends: 5798 [2019-12-18 18:31:28,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:31:28,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5798 states. [2019-12-18 18:31:28,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5798 to 5798. [2019-12-18 18:31:28,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5798 states. [2019-12-18 18:31:28,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5798 states to 5798 states and 16476 transitions. [2019-12-18 18:31:28,758 INFO L78 Accepts]: Start accepts. Automaton has 5798 states and 16476 transitions. Word has length 66 [2019-12-18 18:31:28,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:31:28,759 INFO L462 AbstractCegarLoop]: Abstraction has 5798 states and 16476 transitions. [2019-12-18 18:31:28,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:31:28,759 INFO L276 IsEmpty]: Start isEmpty. Operand 5798 states and 16476 transitions. [2019-12-18 18:31:28,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:31:28,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:31:28,773 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-18 18:31:28,773 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-18 18:31:28,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:31:28,774 INFO L82 PathProgramCache]: Analyzing trace with hash -806353662, now seen corresponding path program 3 times [2019-12-18 18:31:28,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:31:28,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056742640] [2019-12-18 18:31:28,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:31:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:31:28,951 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-18 18:31:28,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056742640] [2019-12-18 18:31:28,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:31:28,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:31:28,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644090055] [2019-12-18 18:31:28,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:31:28,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:31:28,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:31:28,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:31:28,955 INFO L87 Difference]: Start difference. First operand 5798 states and 16476 transitions. Second operand 7 states. [2019-12-18 18:31:29,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:31:29,507 INFO L93 Difference]: Finished difference Result 8278 states and 23193 transitions. [2019-12-18 18:31:29,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 18:31:29,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 18:31:29,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:31:29,519 INFO L225 Difference]: With dead ends: 8278 [2019-12-18 18:31:29,519 INFO L226 Difference]: Without dead ends: 8278 [2019-12-18 18:31:29,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:31:29,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8278 states. [2019-12-18 18:31:29,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8278 to 5975. [2019-12-18 18:31:29,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5975 states. [2019-12-18 18:31:29,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5975 states to 5975 states and 16998 transitions. [2019-12-18 18:31:29,611 INFO L78 Accepts]: Start accepts. Automaton has 5975 states and 16998 transitions. Word has length 66 [2019-12-18 18:31:29,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:31:29,611 INFO L462 AbstractCegarLoop]: Abstraction has 5975 states and 16998 transitions. [2019-12-18 18:31:29,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:31:29,612 INFO L276 IsEmpty]: Start isEmpty. Operand 5975 states and 16998 transitions. [2019-12-18 18:31:29,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:31:29,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:31:29,620 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-18 18:31:29,620 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-18 18:31:29,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:31:29,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1549059410, now seen corresponding path program 4 times [2019-12-18 18:31:29,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:31:29,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080574425] [2019-12-18 18:31:29,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:31:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:31:29,779 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-18 18:31:29,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080574425] [2019-12-18 18:31:29,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:31:29,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:31:29,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831389412] [2019-12-18 18:31:29,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:31:29,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:31:29,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:31:29,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:31:29,781 INFO L87 Difference]: Start difference. First operand 5975 states and 16998 transitions. Second operand 9 states. [2019-12-18 18:31:30,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:31:30,738 INFO L93 Difference]: Finished difference Result 10497 states and 29367 transitions. [2019-12-18 18:31:30,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 18:31:30,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 18:31:30,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:31:30,751 INFO L225 Difference]: With dead ends: 10497 [2019-12-18 18:31:30,751 INFO L226 Difference]: Without dead ends: 10497 [2019-12-18 18:31:30,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:31:30,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10497 states. [2019-12-18 18:31:30,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10497 to 6396. [2019-12-18 18:31:30,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6396 states. [2019-12-18 18:31:30,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6396 states to 6396 states and 18177 transitions. [2019-12-18 18:31:30,857 INFO L78 Accepts]: Start accepts. Automaton has 6396 states and 18177 transitions. Word has length 66 [2019-12-18 18:31:30,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:31:30,858 INFO L462 AbstractCegarLoop]: Abstraction has 6396 states and 18177 transitions. [2019-12-18 18:31:30,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:31:30,858 INFO L276 IsEmpty]: Start isEmpty. Operand 6396 states and 18177 transitions. [2019-12-18 18:31:30,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:31:30,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:31:30,867 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-18 18:31:30,867 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-18 18:31:30,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:31:30,867 INFO L82 PathProgramCache]: Analyzing trace with hash 479477378, now seen corresponding path program 5 times [2019-12-18 18:31:30,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:31:30,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140470131] [2019-12-18 18:31:30,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:31:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:31:31,039 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-18 18:31:31,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140470131] [2019-12-18 18:31:31,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:31:31,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:31:31,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060028012] [2019-12-18 18:31:31,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:31:31,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:31:31,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:31:31,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:31:31,041 INFO L87 Difference]: Start difference. First operand 6396 states and 18177 transitions. Second operand 10 states. [2019-12-18 18:31:32,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:31:32,454 INFO L93 Difference]: Finished difference Result 10553 states and 29544 transitions. [2019-12-18 18:31:32,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 18:31:32,455 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 18:31:32,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:31:32,468 INFO L225 Difference]: With dead ends: 10553 [2019-12-18 18:31:32,468 INFO L226 Difference]: Without dead ends: 10553 [2019-12-18 18:31:32,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2019-12-18 18:31:32,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10553 states. [2019-12-18 18:31:32,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10553 to 7006. [2019-12-18 18:31:32,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7006 states. [2019-12-18 18:31:32,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7006 states to 7006 states and 19920 transitions. [2019-12-18 18:31:32,582 INFO L78 Accepts]: Start accepts. Automaton has 7006 states and 19920 transitions. Word has length 66 [2019-12-18 18:31:32,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:31:32,582 INFO L462 AbstractCegarLoop]: Abstraction has 7006 states and 19920 transitions. [2019-12-18 18:31:32,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:31:32,583 INFO L276 IsEmpty]: Start isEmpty. Operand 7006 states and 19920 transitions. [2019-12-18 18:31:32,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:31:32,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:31:32,593 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-18 18:31:32,593 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-18 18:31:32,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:31:32,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1795321204, now seen corresponding path program 6 times [2019-12-18 18:31:32,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:31:32,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799903897] [2019-12-18 18:31:32,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:31:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:31:32,753 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-18 18:31:32,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799903897] [2019-12-18 18:31:32,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:31:32,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:31:32,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621156276] [2019-12-18 18:31:32,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 18:31:32,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:31:32,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 18:31:32,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-18 18:31:32,755 INFO L87 Difference]: Start difference. First operand 7006 states and 19920 transitions. Second operand 10 states. [2019-12-18 18:31:34,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:31:34,409 INFO L93 Difference]: Finished difference Result 10795 states and 30225 transitions. [2019-12-18 18:31:34,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 18:31:34,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-18 18:31:34,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:31:34,422 INFO L225 Difference]: With dead ends: 10795 [2019-12-18 18:31:34,422 INFO L226 Difference]: Without dead ends: 10795 [2019-12-18 18:31:34,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2019-12-18 18:31:34,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10795 states. [2019-12-18 18:31:34,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10795 to 6382. [2019-12-18 18:31:34,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6382 states. [2019-12-18 18:31:34,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6382 states to 6382 states and 18176 transitions. [2019-12-18 18:31:34,533 INFO L78 Accepts]: Start accepts. Automaton has 6382 states and 18176 transitions. Word has length 66 [2019-12-18 18:31:34,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:31:34,533 INFO L462 AbstractCegarLoop]: Abstraction has 6382 states and 18176 transitions. [2019-12-18 18:31:34,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 18:31:34,533 INFO L276 IsEmpty]: Start isEmpty. Operand 6382 states and 18176 transitions. [2019-12-18 18:31:34,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:31:34,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:31:34,540 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-18 18:31:34,540 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-18 18:31:34,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:31:34,540 INFO L82 PathProgramCache]: Analyzing trace with hash 2091502336, now seen corresponding path program 7 times [2019-12-18 18:31:34,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:31:34,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081315481] [2019-12-18 18:31:34,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:31:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:31:34,688 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-18 18:31:34,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081315481] [2019-12-18 18:31:34,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:31:34,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:31:34,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358442468] [2019-12-18 18:31:34,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 18:31:34,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:31:34,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 18:31:34,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:31:34,693 INFO L87 Difference]: Start difference. First operand 6382 states and 18176 transitions. Second operand 9 states. [2019-12-18 18:31:36,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:31:36,164 INFO L93 Difference]: Finished difference Result 11599 states and 32705 transitions. [2019-12-18 18:31:36,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 18:31:36,164 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 18:31:36,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:31:36,180 INFO L225 Difference]: With dead ends: 11599 [2019-12-18 18:31:36,181 INFO L226 Difference]: Without dead ends: 11599 [2019-12-18 18:31:36,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2019-12-18 18:31:36,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11599 states. [2019-12-18 18:31:36,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11599 to 6463. [2019-12-18 18:31:36,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6463 states. [2019-12-18 18:31:36,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6463 states to 6463 states and 18407 transitions. [2019-12-18 18:31:36,347 INFO L78 Accepts]: Start accepts. Automaton has 6463 states and 18407 transitions. Word has length 66 [2019-12-18 18:31:36,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:31:36,347 INFO L462 AbstractCegarLoop]: Abstraction has 6463 states and 18407 transitions. [2019-12-18 18:31:36,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 18:31:36,348 INFO L276 IsEmpty]: Start isEmpty. Operand 6463 states and 18407 transitions. [2019-12-18 18:31:36,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:31:36,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:31:36,357 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:31:36,358 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-18 18:31:36,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:31:36,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1951217226, now seen corresponding path program 8 times [2019-12-18 18:31:36,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:31:36,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297990978] [2019-12-18 18:31:36,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:31:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:31:36,464 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-18 18:31:36,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297990978] [2019-12-18 18:31:36,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:31:36,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:31:36,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145212317] [2019-12-18 18:31:36,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:31:36,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:31:36,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:31:36,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:31:36,468 INFO L87 Difference]: Start difference. First operand 6463 states and 18407 transitions. Second operand 3 states. [2019-12-18 18:31:36,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:31:36,544 INFO L93 Difference]: Finished difference Result 6462 states and 18405 transitions. [2019-12-18 18:31:36,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:31:36,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 18:31:36,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:31:36,557 INFO L225 Difference]: With dead ends: 6462 [2019-12-18 18:31:36,557 INFO L226 Difference]: Without dead ends: 6462 [2019-12-18 18:31:36,558 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-18 18:31:36,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6462 states. [2019-12-18 18:31:36,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6462 to 3703. [2019-12-18 18:31:36,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3703 states. [2019-12-18 18:31:36,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3703 states to 3703 states and 10669 transitions. [2019-12-18 18:31:36,690 INFO L78 Accepts]: Start accepts. Automaton has 3703 states and 10669 transitions. Word has length 66 [2019-12-18 18:31:36,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:31:36,691 INFO L462 AbstractCegarLoop]: Abstraction has 3703 states and 10669 transitions. [2019-12-18 18:31:36,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:31:36,691 INFO L276 IsEmpty]: Start isEmpty. Operand 3703 states and 10669 transitions. [2019-12-18 18:31:36,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:31:36,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:31:36,698 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-18 18:31:36,699 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-18 18:31:36,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:31:36,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1374418208, now seen corresponding path program 1 times [2019-12-18 18:31:36,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:31:36,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639210718] [2019-12-18 18:31:36,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:31:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:31:36,779 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-18 18:31:36,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639210718] [2019-12-18 18:31:36,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:31:36,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:31:36,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009619890] [2019-12-18 18:31:36,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:31:36,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:31:36,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:31:36,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:31:36,786 INFO L87 Difference]: Start difference. First operand 3703 states and 10669 transitions. Second operand 3 states. [2019-12-18 18:31:36,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:31:36,809 INFO L93 Difference]: Finished difference Result 3503 states and 9871 transitions. [2019-12-18 18:31:36,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:31:36,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 18:31:36,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:31:36,815 INFO L225 Difference]: With dead ends: 3503 [2019-12-18 18:31:36,815 INFO L226 Difference]: Without dead ends: 3503 [2019-12-18 18:31:36,816 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-18 18:31:36,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3503 states. [2019-12-18 18:31:36,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3503 to 2810. [2019-12-18 18:31:36,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2810 states. [2019-12-18 18:31:36,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 7936 transitions. [2019-12-18 18:31:36,874 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 7936 transitions. Word has length 67 [2019-12-18 18:31:36,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:31:36,874 INFO L462 AbstractCegarLoop]: Abstraction has 2810 states and 7936 transitions. [2019-12-18 18:31:36,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:31:36,875 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 7936 transitions. [2019-12-18 18:31:36,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 18:31:36,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:31:36,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:31:36,879 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-18 18:31:36,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:31:36,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1090372922, now seen corresponding path program 1 times [2019-12-18 18:31:36,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:31:36,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585494284] [2019-12-18 18:31:36,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:31:36,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:31:37,157 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-18 18:31:37,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585494284] [2019-12-18 18:31:37,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:31:37,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 18:31:37,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513020538] [2019-12-18 18:31:37,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 18:31:37,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:31:37,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 18:31:37,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:31:37,159 INFO L87 Difference]: Start difference. First operand 2810 states and 7936 transitions. Second operand 14 states. [2019-12-18 18:31:37,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:31:37,830 INFO L93 Difference]: Finished difference Result 4966 states and 13960 transitions. [2019-12-18 18:31:37,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 18:31:37,831 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-18 18:31:37,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:31:37,839 INFO L225 Difference]: With dead ends: 4966 [2019-12-18 18:31:37,839 INFO L226 Difference]: Without dead ends: 4941 [2019-12-18 18:31:37,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2019-12-18 18:31:37,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4941 states. [2019-12-18 18:31:37,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4941 to 3941. [2019-12-18 18:31:37,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3941 states. [2019-12-18 18:31:37,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3941 states to 3941 states and 11030 transitions. [2019-12-18 18:31:37,906 INFO L78 Accepts]: Start accepts. Automaton has 3941 states and 11030 transitions. Word has length 68 [2019-12-18 18:31:37,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:31:37,906 INFO L462 AbstractCegarLoop]: Abstraction has 3941 states and 11030 transitions. [2019-12-18 18:31:37,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 18:31:37,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3941 states and 11030 transitions. [2019-12-18 18:31:37,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 18:31:37,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:31:37,910 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:31:37,911 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-18 18:31:37,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:31:37,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1311051616, now seen corresponding path program 2 times [2019-12-18 18:31:37,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:31:37,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903414450] [2019-12-18 18:31:37,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:31:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:31:38,415 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-18 18:31:38,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903414450] [2019-12-18 18:31:38,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:31:38,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 18:31:38,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450991476] [2019-12-18 18:31:38,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 18:31:38,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:31:38,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 18:31:38,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2019-12-18 18:31:38,418 INFO L87 Difference]: Start difference. First operand 3941 states and 11030 transitions. Second operand 18 states. [2019-12-18 18:31:40,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:31:40,551 INFO L93 Difference]: Finished difference Result 10519 states and 29125 transitions. [2019-12-18 18:31:40,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 18:31:40,551 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 68 [2019-12-18 18:31:40,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:31:40,565 INFO L225 Difference]: With dead ends: 10519 [2019-12-18 18:31:40,565 INFO L226 Difference]: Without dead ends: 10494 [2019-12-18 18:31:40,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=275, Invalid=1447, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 18:31:40,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10494 states. [2019-12-18 18:31:40,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10494 to 4118. [2019-12-18 18:31:40,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4118 states. [2019-12-18 18:31:40,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4118 states to 4118 states and 11512 transitions. [2019-12-18 18:31:40,691 INFO L78 Accepts]: Start accepts. Automaton has 4118 states and 11512 transitions. Word has length 68 [2019-12-18 18:31:40,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:31:40,691 INFO L462 AbstractCegarLoop]: Abstraction has 4118 states and 11512 transitions. [2019-12-18 18:31:40,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 18:31:40,692 INFO L276 IsEmpty]: Start isEmpty. Operand 4118 states and 11512 transitions. [2019-12-18 18:31:40,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 18:31:40,695 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:31:40,695 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:31:40,696 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-18 18:31:40,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:31:40,696 INFO L82 PathProgramCache]: Analyzing trace with hash 209870412, now seen corresponding path program 3 times [2019-12-18 18:31:40,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:31:40,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313726875] [2019-12-18 18:31:40,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:31:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:31:40,908 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-18 18:31:40,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313726875] [2019-12-18 18:31:40,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:31:40,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 18:31:40,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408239916] [2019-12-18 18:31:40,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 18:31:40,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:31:40,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 18:31:40,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:31:40,910 INFO L87 Difference]: Start difference. First operand 4118 states and 11512 transitions. Second operand 13 states. [2019-12-18 18:31:41,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:31:41,381 INFO L93 Difference]: Finished difference Result 6802 states and 18867 transitions. [2019-12-18 18:31:41,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 18:31:41,382 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-18 18:31:41,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:31:41,391 INFO L225 Difference]: With dead ends: 6802 [2019-12-18 18:31:41,392 INFO L226 Difference]: Without dead ends: 6777 [2019-12-18 18:31:41,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2019-12-18 18:31:41,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6777 states. [2019-12-18 18:31:41,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6777 to 4162. [2019-12-18 18:31:41,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4162 states. [2019-12-18 18:31:41,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4162 states to 4162 states and 11668 transitions. [2019-12-18 18:31:41,458 INFO L78 Accepts]: Start accepts. Automaton has 4162 states and 11668 transitions. Word has length 68 [2019-12-18 18:31:41,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:31:41,459 INFO L462 AbstractCegarLoop]: Abstraction has 4162 states and 11668 transitions. [2019-12-18 18:31:41,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 18:31:41,459 INFO L276 IsEmpty]: Start isEmpty. Operand 4162 states and 11668 transitions. [2019-12-18 18:31:41,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 18:31:41,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:31:41,463 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:31:41,463 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-18 18:31:41,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:31:41,463 INFO L82 PathProgramCache]: Analyzing trace with hash -526111866, now seen corresponding path program 4 times [2019-12-18 18:31:41,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:31:41,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908432338] [2019-12-18 18:31:41,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:31:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:31:42,025 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-18 18:31:42,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908432338] [2019-12-18 18:31:42,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:31:42,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-18 18:31:42,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517294005] [2019-12-18 18:31:42,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 18:31:42,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:31:42,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 18:31:42,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-12-18 18:31:42,027 INFO L87 Difference]: Start difference. First operand 4162 states and 11668 transitions. Second operand 20 states. [2019-12-18 18:31:44,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:31:44,958 INFO L93 Difference]: Finished difference Result 12283 states and 33999 transitions. [2019-12-18 18:31:44,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 18:31:44,958 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2019-12-18 18:31:44,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:31:44,974 INFO L225 Difference]: With dead ends: 12283 [2019-12-18 18:31:44,974 INFO L226 Difference]: Without dead ends: 12258 [2019-12-18 18:31:44,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=469, Invalid=2287, Unknown=0, NotChecked=0, Total=2756 [2019-12-18 18:31:45,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12258 states. [2019-12-18 18:31:45,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12258 to 4389. [2019-12-18 18:31:45,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4389 states. [2019-12-18 18:31:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4389 states to 4389 states and 12291 transitions. [2019-12-18 18:31:45,073 INFO L78 Accepts]: Start accepts. Automaton has 4389 states and 12291 transitions. Word has length 68 [2019-12-18 18:31:45,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:31:45,073 INFO L462 AbstractCegarLoop]: Abstraction has 4389 states and 12291 transitions. [2019-12-18 18:31:45,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 18:31:45,073 INFO L276 IsEmpty]: Start isEmpty. Operand 4389 states and 12291 transitions. [2019-12-18 18:31:45,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 18:31:45,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:31:45,078 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:31:45,078 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-18 18:31:45,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:31:45,078 INFO L82 PathProgramCache]: Analyzing trace with hash -450226916, now seen corresponding path program 5 times [2019-12-18 18:31:45,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:31:45,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405878162] [2019-12-18 18:31:45,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:31:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:31:45,797 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-18 18:31:45,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405878162] [2019-12-18 18:31:45,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:31:45,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 18:31:45,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039416036] [2019-12-18 18:31:45,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 18:31:45,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:31:45,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 18:31:45,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-12-18 18:31:45,804 INFO L87 Difference]: Start difference. First operand 4389 states and 12291 transitions. Second operand 18 states. [2019-12-18 18:31:49,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:31:49,123 INFO L93 Difference]: Finished difference Result 12857 states and 35721 transitions. [2019-12-18 18:31:49,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 18:31:49,124 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 68 [2019-12-18 18:31:49,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:31:49,141 INFO L225 Difference]: With dead ends: 12857 [2019-12-18 18:31:49,141 INFO L226 Difference]: Without dead ends: 12832 [2019-12-18 18:31:49,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=428, Invalid=2542, Unknown=0, NotChecked=0, Total=2970 [2019-12-18 18:31:49,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12832 states. [2019-12-18 18:31:49,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12832 to 4599. [2019-12-18 18:31:49,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4599 states. [2019-12-18 18:31:49,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4599 states to 4599 states and 12919 transitions. [2019-12-18 18:31:49,244 INFO L78 Accepts]: Start accepts. Automaton has 4599 states and 12919 transitions. Word has length 68 [2019-12-18 18:31:49,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:31:49,244 INFO L462 AbstractCegarLoop]: Abstraction has 4599 states and 12919 transitions. [2019-12-18 18:31:49,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 18:31:49,244 INFO L276 IsEmpty]: Start isEmpty. Operand 4599 states and 12919 transitions. [2019-12-18 18:31:49,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 18:31:49,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:31:49,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:31:49,249 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-18 18:31:49,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:31:49,250 INFO L82 PathProgramCache]: Analyzing trace with hash 932771090, now seen corresponding path program 6 times [2019-12-18 18:31:49,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:31:49,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992958705] [2019-12-18 18:31:49,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:31:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:31:49,765 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-18 18:31:49,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992958705] [2019-12-18 18:31:49,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:31:49,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 18:31:49,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870225782] [2019-12-18 18:31:49,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 18:31:49,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:31:49,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 18:31:49,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-12-18 18:31:49,767 INFO L87 Difference]: Start difference. First operand 4599 states and 12919 transitions. Second operand 21 states. [2019-12-18 18:31:53,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:31:53,483 INFO L93 Difference]: Finished difference Result 14292 states and 39399 transitions. [2019-12-18 18:31:53,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-18 18:31:53,484 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-12-18 18:31:53,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:31:53,502 INFO L225 Difference]: With dead ends: 14292 [2019-12-18 18:31:53,502 INFO L226 Difference]: Without dead ends: 14267 [2019-12-18 18:31:53,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1147 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=656, Invalid=3634, Unknown=0, NotChecked=0, Total=4290 [2019-12-18 18:31:53,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14267 states. [2019-12-18 18:31:53,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14267 to 4524. [2019-12-18 18:31:53,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4524 states. [2019-12-18 18:31:53,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4524 states to 4524 states and 12693 transitions. [2019-12-18 18:31:53,611 INFO L78 Accepts]: Start accepts. Automaton has 4524 states and 12693 transitions. Word has length 68 [2019-12-18 18:31:53,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:31:53,611 INFO L462 AbstractCegarLoop]: Abstraction has 4524 states and 12693 transitions. [2019-12-18 18:31:53,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-18 18:31:53,611 INFO L276 IsEmpty]: Start isEmpty. Operand 4524 states and 12693 transitions. [2019-12-18 18:31:53,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 18:31:53,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:31:53,616 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:31:53,616 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-18 18:31:53,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:31:53,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1425961288, now seen corresponding path program 7 times [2019-12-18 18:31:53,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:31:53,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707323414] [2019-12-18 18:31:53,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:31:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:31:53,913 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-18 18:31:53,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707323414] [2019-12-18 18:31:53,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:31:53,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 18:31:53,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613615960] [2019-12-18 18:31:53,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 18:31:53,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:31:53,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 18:31:53,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-12-18 18:31:53,915 INFO L87 Difference]: Start difference. First operand 4524 states and 12693 transitions. Second operand 16 states. [2019-12-18 18:31:55,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:31:55,001 INFO L93 Difference]: Finished difference Result 6480 states and 17981 transitions. [2019-12-18 18:31:55,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 18:31:55,002 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2019-12-18 18:31:55,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:31:55,011 INFO L225 Difference]: With dead ends: 6480 [2019-12-18 18:31:55,011 INFO L226 Difference]: Without dead ends: 6455 [2019-12-18 18:31:55,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=311, Invalid=1095, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 18:31:55,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6455 states. [2019-12-18 18:31:55,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6455 to 4062. [2019-12-18 18:31:55,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4062 states. [2019-12-18 18:31:55,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 11322 transitions. [2019-12-18 18:31:55,076 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 11322 transitions. Word has length 68 [2019-12-18 18:31:55,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:31:55,076 INFO L462 AbstractCegarLoop]: Abstraction has 4062 states and 11322 transitions. [2019-12-18 18:31:55,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 18:31:55,076 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 11322 transitions. [2019-12-18 18:31:55,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 18:31:55,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:31:55,082 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:31:55,082 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-18 18:31:55,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:31:55,083 INFO L82 PathProgramCache]: Analyzing trace with hash 2056032048, now seen corresponding path program 8 times [2019-12-18 18:31:55,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:31:55,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340816942] [2019-12-18 18:31:55,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:31:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:31:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:31:55,193 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:31:55,194 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:31:55,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] ULTIMATE.startENTRY-->L807: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_40) (= v_~z$r_buff1_thd0~0_289 0) (= v_~z$r_buff0_thd1~0_194 0) (= v_~z$mem_tmp~0_22 0) (= v_~z$w_buff0~0_192 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_201 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= v_~y~0_14 0) (= v_~main$tmp_guard1~0_48 0) (= |v_#NULL.offset_3| 0) (= v_~z$w_buff0_used~0_745 0) (= v_~z$r_buff0_thd0~0_352 0) (= 0 v_~z$r_buff0_thd3~0_106) (= 0 |v_ULTIMATE.start_main_~#t1967~0.offset_17|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1967~0.base_23| 4)) (= v_~z$w_buff1_used~0_381 0) (= v_~main$tmp_guard0~0_23 0) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1967~0.base_23|)) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1967~0.base_23| 1)) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd1~0_172 0) (= v_~__unbuffered_cnt~0_156 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~z$flush_delayed~0_41) (= v_~z$w_buff1~0_171 0) (= 0 v_~x~0_113) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_111 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1967~0.base_23| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1967~0.base_23|) |v_ULTIMATE.start_main_~#t1967~0.offset_17| 0)) |v_#memory_int_23|) (= v_~z$r_buff0_thd2~0_100 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1967~0.base_23|) (= v_~z$r_buff1_thd2~0_185 0) (= 0 v_~z$r_buff1_thd3~0_186))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_20|, ULTIMATE.start_main_~#t1967~0.offset=|v_ULTIMATE.start_main_~#t1967~0.offset_17|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_26|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_34|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_27|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_24|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_72|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_72|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_352, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~z$mem_tmp~0=v_~z$mem_tmp~0_22, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_381, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_39|, ~z$flush_delayed~0=v_~z$flush_delayed~0_41, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_74|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_149|, ULTIMATE.start_main_~#t1969~0.base=|v_ULTIMATE.start_main_~#t1969~0.base_20|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_172, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_106, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_156, ~x~0=v_~x~0_113, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_20|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_32|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_25|, ~z$w_buff1~0=v_~z$w_buff1~0_171, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_32|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_28|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_260|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_~#t1968~0.offset=|v_ULTIMATE.start_main_~#t1968~0.offset_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_74|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_289, ULTIMATE.start_main_~#t1968~0.base=|v_ULTIMATE.start_main_~#t1968~0.base_21|, ~y~0=v_~y~0_14, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_100, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_8|, ULTIMATE.start_main_~#t1967~0.base=|v_ULTIMATE.start_main_~#t1967~0.base_23|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_745, ~z$w_buff0~0=v_~z$w_buff0~0_192, ULTIMATE.start_main_~#t1969~0.offset=|v_ULTIMATE.start_main_~#t1969~0.offset_16|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_186, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_24|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_44|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_41|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_149|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_201, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_194} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_~#t1967~0.offset, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1969~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1968~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1968~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1967~0.base, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t1969~0.offset, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 18:31:55,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L807-1-->L809: Formula: (and (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1968~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1968~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1968~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1968~0.base_11| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1968~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1968~0.base_11|) |v_ULTIMATE.start_main_~#t1968~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1968~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1968~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1968~0.offset=|v_ULTIMATE.start_main_~#t1968~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1968~0.base=|v_ULTIMATE.start_main_~#t1968~0.base_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1968~0.offset, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, ULTIMATE.start_main_~#t1968~0.base, #length] because there is no mapped edge [2019-12-18 18:31:55,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_42 v_~z$w_buff1~0_28) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_12 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_8|) (= 0 (mod v_~z$w_buff1_used~0_97 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_~z$w_buff0_used~0_207 v_~z$w_buff1_used~0_97) (= v_~z$w_buff0_used~0_206 1) (= 2 v_~z$w_buff0~0_41)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_207, ~z$w_buff0~0=v_~z$w_buff0~0_42, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_206, ~z$w_buff0~0=v_~z$w_buff0~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_12, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, ~z$w_buff1~0=v_~z$w_buff1~0_28, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 18:31:55,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-1-->L811: Formula: (and (= |v_ULTIMATE.start_main_~#t1969~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1969~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1969~0.base_12| 0)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1969~0.base_12| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1969~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1969~0.base_12|) |v_ULTIMATE.start_main_~#t1969~0.offset_10| 2)) |v_#memory_int_13|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1969~0.base_12|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1969~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1969~0.base=|v_ULTIMATE.start_main_~#t1969~0.base_12|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, ULTIMATE.start_main_~#t1969~0.offset=|v_ULTIMATE.start_main_~#t1969~0.offset_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1969~0.base, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_~#t1969~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 18:31:55,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L745-->L745-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1032737585 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1032737585 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1032737585| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1032737585| ~z$w_buff0_used~0_In1032737585)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1032737585, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1032737585} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1032737585|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1032737585, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1032737585} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 18:31:55,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L746-->L746-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In390620603 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In390620603 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In390620603 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In390620603 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out390620603| ~z$w_buff1_used~0_In390620603) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out390620603| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In390620603, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In390620603, ~z$w_buff1_used~0=~z$w_buff1_used~0_In390620603, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In390620603} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out390620603|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In390620603, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In390620603, ~z$w_buff1_used~0=~z$w_buff1_used~0_In390620603, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In390620603} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 18:31:55,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L747-->L748: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-2091472609 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-2091472609 256)))) (or (and (= ~z$r_buff0_thd1~0_In-2091472609 ~z$r_buff0_thd1~0_Out-2091472609) (or .cse0 .cse1)) (and (= 0 ~z$r_buff0_thd1~0_Out-2091472609) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2091472609, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2091472609} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2091472609, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2091472609|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-2091472609} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 18:31:55,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L748-->L748-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1016869467 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In1016869467 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1016869467 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In1016869467 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1016869467| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out1016869467| ~z$r_buff1_thd1~0_In1016869467) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1016869467, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1016869467, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1016869467, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1016869467} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1016869467, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1016869467|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1016869467, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1016869467, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1016869467} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 18:31:55,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L748-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_64 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_64, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 18:31:55,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L764-2-->L764-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In272861513 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In272861513 256)))) (or (and (= ~z~0_In272861513 |P1Thread1of1ForFork1_#t~ite9_Out272861513|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~z$w_buff1~0_In272861513 |P1Thread1of1ForFork1_#t~ite9_Out272861513|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In272861513, ~z$w_buff1_used~0=~z$w_buff1_used~0_In272861513, ~z$w_buff1~0=~z$w_buff1~0_In272861513, ~z~0=~z~0_In272861513} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out272861513|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In272861513, ~z$w_buff1_used~0=~z$w_buff1_used~0_In272861513, ~z$w_buff1~0=~z$w_buff1~0_In272861513, ~z~0=~z~0_In272861513} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 18:31:55,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L764-4-->L765: Formula: (= v_~z~0_33 |v_P1Thread1of1ForFork1_#t~ite9_16|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_16|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_15|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_21|, ~z~0=v_~z~0_33} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 18:31:55,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In659817505 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In659817505 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out659817505| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out659817505| ~z$w_buff0_used~0_In659817505) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In659817505, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In659817505} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In659817505, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out659817505|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In659817505} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 18:31:55,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L784-2-->L784-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In1042899313 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1042899313 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out1042899313| ~z$w_buff1~0_In1042899313) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out1042899313| ~z~0_In1042899313) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1042899313, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1042899313, ~z$w_buff1~0=~z$w_buff1~0_In1042899313, ~z~0=~z~0_In1042899313} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out1042899313|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1042899313, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1042899313, ~z$w_buff1~0=~z$w_buff1~0_In1042899313, ~z~0=~z~0_In1042899313} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 18:31:55,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L766-->L766-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-574903612 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-574903612 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-574903612 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-574903612 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-574903612|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-574903612 |P1Thread1of1ForFork1_#t~ite12_Out-574903612|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-574903612, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-574903612, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-574903612, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-574903612} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-574903612, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-574903612, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-574903612, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-574903612|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-574903612} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 18:31:55,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1673272085 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1673272085 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out1673272085| ~z$r_buff0_thd2~0_In1673272085)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out1673272085| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1673272085, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1673272085} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1673272085, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1673272085|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1673272085} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 18:31:55,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L784-4-->L785: Formula: (= v_~z~0_45 |v_P2Thread1of1ForFork2_#t~ite15_10|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_10|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_9|, ~z~0=v_~z~0_45, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_15|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 18:31:55,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-342317544 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-342317544 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-342317544|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out-342317544| ~z$w_buff0_used~0_In-342317544)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-342317544, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-342317544} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-342317544, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-342317544, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-342317544|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 18:31:55,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-939200672 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-939200672 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-939200672 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-939200672 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out-939200672|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-939200672 |P2Thread1of1ForFork2_#t~ite18_Out-939200672|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-939200672, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-939200672, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-939200672, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-939200672} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-939200672, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-939200672, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-939200672, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-939200672, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-939200672|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 18:31:55,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L787-->L787-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2047578069 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-2047578069 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_In-2047578069 |P2Thread1of1ForFork2_#t~ite19_Out-2047578069|)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out-2047578069| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2047578069, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2047578069} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2047578069, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2047578069, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-2047578069|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 18:31:55,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L788-->L788-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd3~0_In-1440947418 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1440947418 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1440947418 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-1440947418 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite20_Out-1440947418|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1440947418| ~z$r_buff1_thd3~0_In-1440947418) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1440947418, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1440947418, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1440947418, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1440947418} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1440947418, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1440947418|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1440947418, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1440947418, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1440947418} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 18:31:55,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_34| v_~z$r_buff1_thd3~0_66) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_73 1) v_~__unbuffered_cnt~0_72)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_33|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_66, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 18:31:55,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In2101605242 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In2101605242 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In2101605242 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In2101605242 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out2101605242| 0)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out2101605242| ~z$r_buff1_thd2~0_In2101605242) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2101605242, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2101605242, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2101605242, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2101605242} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2101605242, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2101605242, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2101605242, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out2101605242|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2101605242} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 18:31:55,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~z$r_buff1_thd2~0_54) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 18:31:55,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L811-1-->L817: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 18:31:55,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L817-2-->L817-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-2118703089 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-2118703089 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-2118703089 |ULTIMATE.start_main_#t~ite24_Out-2118703089|)) (and (= ~z~0_In-2118703089 |ULTIMATE.start_main_#t~ite24_Out-2118703089|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2118703089, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2118703089, ~z$w_buff1~0=~z$w_buff1~0_In-2118703089, ~z~0=~z~0_In-2118703089} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2118703089, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-2118703089|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2118703089, ~z$w_buff1~0=~z$w_buff1~0_In-2118703089, ~z~0=~z~0_In-2118703089} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 18:31:55,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L817-4-->L818: Formula: (= v_~z~0_21 |v_ULTIMATE.start_main_#t~ite24_9|) InVars {ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_9|} OutVars{ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_8|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_12|, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ~z~0] because there is no mapped edge [2019-12-18 18:31:55,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In228519162 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In228519162 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite26_Out228519162| ~z$w_buff0_used~0_In228519162)) (and (= 0 |ULTIMATE.start_main_#t~ite26_Out228519162|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In228519162, ~z$w_buff0_used~0=~z$w_buff0_used~0_In228519162} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In228519162, ~z$w_buff0_used~0=~z$w_buff0_used~0_In228519162, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out228519162|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 18:31:55,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1341590028 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1341590028 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1341590028 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1341590028 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite27_Out1341590028| 0)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1341590028 |ULTIMATE.start_main_#t~ite27_Out1341590028|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1341590028, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1341590028, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1341590028, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1341590028} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1341590028, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1341590028, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1341590028, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1341590028, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1341590028|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 18:31:55,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-618886049 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-618886049 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-618886049 |ULTIMATE.start_main_#t~ite28_Out-618886049|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite28_Out-618886049|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-618886049, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-618886049} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-618886049, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-618886049|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-618886049} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 18:31:55,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L821-->L821-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In815601890 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In815601890 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In815601890 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In815601890 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite29_Out815601890|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In815601890 |ULTIMATE.start_main_#t~ite29_Out815601890|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In815601890, ~z$w_buff0_used~0=~z$w_buff0_used~0_In815601890, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In815601890, ~z$w_buff1_used~0=~z$w_buff1_used~0_In815601890} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In815601890, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out815601890|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In815601890, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In815601890, ~z$w_buff1_used~0=~z$w_buff1_used~0_In815601890} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 18:31:55,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L833-->L834: Formula: (and (= v_~z$r_buff0_thd0~0_167 v_~z$r_buff0_thd0~0_166) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_167, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_166, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 18:31:55,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L836-->L4: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_134) (= 0 v_~z$flush_delayed~0_22) (= (mod v_~main$tmp_guard1~0_32 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (not (= (mod v_~z$flush_delayed~0_23 256) 0))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~z$flush_delayed~0=v_~z$flush_delayed~0_23} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_17|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~z$flush_delayed~0=v_~z$flush_delayed~0_22, ~z~0=v_~z~0_134, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:31:55,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 18:31:55,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:31:55 BasicIcfg [2019-12-18 18:31:55,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:31:55,344 INFO L168 Benchmark]: Toolchain (without parser) took 111624.07 ms. Allocated memory was 145.2 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 101.0 MB in the beginning and 757.5 MB in the end (delta: -656.5 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-18 18:31:55,344 INFO L168 Benchmark]: CDTParser took 0.71 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 18:31:55,346 INFO L168 Benchmark]: CACSL2BoogieTranslator took 824.39 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.6 MB in the beginning and 155.6 MB in the end (delta: -55.0 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-18 18:31:55,348 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.90 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 153.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:31:55,349 INFO L168 Benchmark]: Boogie Preprocessor took 41.37 ms. Allocated memory is still 202.4 MB. Free memory was 153.0 MB in the beginning and 150.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:31:55,349 INFO L168 Benchmark]: RCFGBuilder took 836.47 ms. Allocated memory is still 202.4 MB. Free memory was 150.3 MB in the beginning and 100.1 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-18 18:31:55,350 INFO L168 Benchmark]: TraceAbstraction took 109844.96 ms. Allocated memory was 202.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 100.1 MB in the beginning and 757.5 MB in the end (delta: -657.4 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 18:31:55,359 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.71 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 824.39 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.6 MB in the beginning and 155.6 MB in the end (delta: -55.0 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.90 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 153.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.37 ms. Allocated memory is still 202.4 MB. Free memory was 153.0 MB in the beginning and 150.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 836.47 ms. Allocated memory is still 202.4 MB. Free memory was 150.3 MB in the beginning and 100.1 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 109844.96 ms. Allocated memory was 202.4 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 100.1 MB in the beginning and 757.5 MB in the end (delta: -657.4 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 175 ProgramPointsBefore, 95 ProgramPointsAfterwards, 212 TransitionsBefore, 106 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 5490 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 239 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 80053 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L807] FCALL, FORK 0 pthread_create(&t1967, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK 0 pthread_create(&t1968, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L811] FCALL, FORK 0 pthread_create(&t1969, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 __unbuffered_p1_EAX = x [L761] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=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=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 __unbuffered_p2_EAX = y [L781] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0: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, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L784] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0: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=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 0 z$flush_delayed = weak$$choice2 [L827] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L829] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L831] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L832] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 109.5s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 42.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4208 SDtfs, 6330 SDslu, 17107 SDs, 0 SdLazy, 17077 SolverSat, 519 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 514 GetRequests, 55 SyntacticMatches, 33 SemanticMatches, 426 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3812 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192396occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 36.8s AutomataMinimizationTime, 25 MinimizatonAttempts, 131006 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 1390 NumberOfCodeBlocks, 1390 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1297 ConstructedInterpolants, 0 QuantifiedInterpolants, 470694 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...