/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix022_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:47:01,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:47:01,575 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:47:01,592 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:47:01,593 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:47:01,595 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:47:01,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:47:01,606 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:47:01,610 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:47:01,613 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:47:01,615 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:47:01,616 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:47:01,617 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:47:01,618 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:47:01,621 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:47:01,622 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:47:01,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:47:01,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:47:01,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:47:01,630 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:47:01,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:47:01,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:47:01,641 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:47:01,642 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:47:01,644 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:47:01,644 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:47:01,645 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:47:01,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:47:01,648 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:47:01,649 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:47:01,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:47:01,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:47:01,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:47:01,653 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:47:01,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:47:01,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:47:01,655 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:47:01,656 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:47:01,656 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:47:01,657 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:47:01,658 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:47:01,659 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 05:47:01,682 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:47:01,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:47:01,687 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:47:01,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:47:01,688 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:47:01,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:47:01,688 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:47:01,689 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:47:01,689 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:47:01,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:47:01,689 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:47:01,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:47:01,690 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:47:01,691 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:47:01,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:47:01,691 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:47:01,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:47:01,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:47:01,692 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:47:01,692 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:47:01,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:47:01,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:47:01,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:47:01,696 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:47:01,696 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:47:01,696 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:47:01,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:47:01,696 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:47:01,697 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:47:01,697 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:47:01,979 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:47:01,996 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:47:01,999 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:47:02,000 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:47:02,000 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:47:02,001 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_pso.opt.i [2019-12-27 05:47:02,062 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/230eb3021/90e5e655af7847b0938c45b5dd8dafee/FLAG3b7e806cb [2019-12-27 05:47:02,568 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:47:02,569 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_pso.opt.i [2019-12-27 05:47:02,598 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/230eb3021/90e5e655af7847b0938c45b5dd8dafee/FLAG3b7e806cb [2019-12-27 05:47:02,892 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/230eb3021/90e5e655af7847b0938c45b5dd8dafee [2019-12-27 05:47:02,900 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:47:02,902 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:47:02,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:47:02,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:47:02,907 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:47:02,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:47:02" (1/1) ... [2019-12-27 05:47:02,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@580b0a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:02, skipping insertion in model container [2019-12-27 05:47:02,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:47:02" (1/1) ... [2019-12-27 05:47:02,919 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:47:02,961 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:47:03,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:47:03,544 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:47:03,605 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:47:03,692 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:47:03,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:03 WrapperNode [2019-12-27 05:47:03,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:47:03,693 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:47:03,693 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:47:03,694 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:47:03,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:03" (1/1) ... [2019-12-27 05:47:03,727 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:03" (1/1) ... [2019-12-27 05:47:03,766 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:47:03,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:47:03,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:47:03,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:47:03,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:03" (1/1) ... [2019-12-27 05:47:03,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:03" (1/1) ... [2019-12-27 05:47:03,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:03" (1/1) ... [2019-12-27 05:47:03,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:03" (1/1) ... [2019-12-27 05:47:03,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:03" (1/1) ... [2019-12-27 05:47:03,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:03" (1/1) ... [2019-12-27 05:47:03,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:03" (1/1) ... [2019-12-27 05:47:03,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:47:03,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:47:03,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:47:03,810 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:47:03,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:47:03,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:47:03,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:47:03,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:47:03,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:47:03,894 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:47:03,895 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:47:03,895 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:47:03,896 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:47:03,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:47:03,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:47:03,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:47:03,898 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 05:47:04,629 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:47:04,630 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:47:04,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:47:04 BoogieIcfgContainer [2019-12-27 05:47:04,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:47:04,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:47:04,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:47:04,636 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:47:04,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:47:02" (1/3) ... [2019-12-27 05:47:04,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4491c352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:47:04, skipping insertion in model container [2019-12-27 05:47:04,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:47:03" (2/3) ... [2019-12-27 05:47:04,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4491c352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:47:04, skipping insertion in model container [2019-12-27 05:47:04,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:47:04" (3/3) ... [2019-12-27 05:47:04,640 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_pso.opt.i [2019-12-27 05:47:04,651 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:47:04,651 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:47:04,661 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:47:04,662 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:47:04,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,700 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,700 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,700 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,701 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,701 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,711 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,712 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,760 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,761 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,761 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,766 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,769 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:47:04,785 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 05:47:04,803 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:47:04,803 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:47:04,803 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:47:04,803 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:47:04,803 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:47:04,804 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:47:04,804 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:47:04,804 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:47:04,821 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 05:47:04,824 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 05:47:04,914 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 05:47:04,914 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:47:04,928 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 05:47:04,947 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 05:47:04,991 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 05:47:04,992 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:47:04,999 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 05:47:05,015 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 05:47:05,017 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:47:08,406 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 05:47:08,512 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 05:47:08,537 INFO L206 etLargeBlockEncoding]: Checked pairs total: 55625 [2019-12-27 05:47:08,537 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-27 05:47:08,541 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 89 transitions [2019-12-27 05:47:09,044 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9482 states. [2019-12-27 05:47:09,047 INFO L276 IsEmpty]: Start isEmpty. Operand 9482 states. [2019-12-27 05:47:09,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 05:47:09,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:09,058 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 05:47:09,059 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:09,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:09,066 INFO L82 PathProgramCache]: Analyzing trace with hash 786448, now seen corresponding path program 1 times [2019-12-27 05:47:09,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:09,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671264218] [2019-12-27 05:47:09,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:47:09,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:47:09,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671264218] [2019-12-27 05:47:09,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:47:09,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:47:09,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843362455] [2019-12-27 05:47:09,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:47:09,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:47:09,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:47:09,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:47:09,377 INFO L87 Difference]: Start difference. First operand 9482 states. Second operand 3 states. [2019-12-27 05:47:09,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:47:09,762 INFO L93 Difference]: Finished difference Result 9196 states and 29676 transitions. [2019-12-27 05:47:09,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:47:09,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 05:47:09,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:47:09,933 INFO L225 Difference]: With dead ends: 9196 [2019-12-27 05:47:09,934 INFO L226 Difference]: Without dead ends: 8650 [2019-12-27 05:47:09,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:47:10,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8650 states. [2019-12-27 05:47:10,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8650 to 8650. [2019-12-27 05:47:10,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8650 states. [2019-12-27 05:47:10,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8650 states to 8650 states and 27866 transitions. [2019-12-27 05:47:10,421 INFO L78 Accepts]: Start accepts. Automaton has 8650 states and 27866 transitions. Word has length 3 [2019-12-27 05:47:10,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:47:10,421 INFO L462 AbstractCegarLoop]: Abstraction has 8650 states and 27866 transitions. [2019-12-27 05:47:10,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:47:10,422 INFO L276 IsEmpty]: Start isEmpty. Operand 8650 states and 27866 transitions. [2019-12-27 05:47:10,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 05:47:10,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:10,426 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:47:10,426 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:10,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:10,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1848805564, now seen corresponding path program 1 times [2019-12-27 05:47:10,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:10,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567717728] [2019-12-27 05:47:10,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:47:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:47:10,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567717728] [2019-12-27 05:47:10,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:47:10,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:47:10,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152034574] [2019-12-27 05:47:10,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:47:10,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:47:10,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:47:10,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:47:10,560 INFO L87 Difference]: Start difference. First operand 8650 states and 27866 transitions. Second operand 4 states. [2019-12-27 05:47:11,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:47:11,067 INFO L93 Difference]: Finished difference Result 13062 states and 40116 transitions. [2019-12-27 05:47:11,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:47:11,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 05:47:11,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:47:11,142 INFO L225 Difference]: With dead ends: 13062 [2019-12-27 05:47:11,142 INFO L226 Difference]: Without dead ends: 13055 [2019-12-27 05:47:11,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:47:11,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13055 states. [2019-12-27 05:47:11,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13055 to 11681. [2019-12-27 05:47:11,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11681 states. [2019-12-27 05:47:12,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11681 states to 11681 states and 36573 transitions. [2019-12-27 05:47:12,331 INFO L78 Accepts]: Start accepts. Automaton has 11681 states and 36573 transitions. Word has length 11 [2019-12-27 05:47:12,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:47:12,331 INFO L462 AbstractCegarLoop]: Abstraction has 11681 states and 36573 transitions. [2019-12-27 05:47:12,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:47:12,332 INFO L276 IsEmpty]: Start isEmpty. Operand 11681 states and 36573 transitions. [2019-12-27 05:47:12,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 05:47:12,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:12,337 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:47:12,338 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:12,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:12,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1479508104, now seen corresponding path program 1 times [2019-12-27 05:47:12,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:12,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177657456] [2019-12-27 05:47:12,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:47:12,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:47:12,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177657456] [2019-12-27 05:47:12,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:47:12,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:47:12,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882936575] [2019-12-27 05:47:12,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:47:12,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:47:12,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:47:12,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:47:12,422 INFO L87 Difference]: Start difference. First operand 11681 states and 36573 transitions. Second operand 4 states. [2019-12-27 05:47:12,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:47:12,686 INFO L93 Difference]: Finished difference Result 13877 states and 43308 transitions. [2019-12-27 05:47:12,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:47:12,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 05:47:12,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:47:12,734 INFO L225 Difference]: With dead ends: 13877 [2019-12-27 05:47:12,735 INFO L226 Difference]: Without dead ends: 13877 [2019-12-27 05:47:12,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:47:12,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13877 states. [2019-12-27 05:47:13,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13877 to 12389. [2019-12-27 05:47:13,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12389 states. [2019-12-27 05:47:13,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12389 states to 12389 states and 38882 transitions. [2019-12-27 05:47:13,284 INFO L78 Accepts]: Start accepts. Automaton has 12389 states and 38882 transitions. Word has length 14 [2019-12-27 05:47:13,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:47:13,285 INFO L462 AbstractCegarLoop]: Abstraction has 12389 states and 38882 transitions. [2019-12-27 05:47:13,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:47:13,285 INFO L276 IsEmpty]: Start isEmpty. Operand 12389 states and 38882 transitions. [2019-12-27 05:47:13,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:47:13,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:13,289 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:47:13,289 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:13,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:13,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1357739076, now seen corresponding path program 1 times [2019-12-27 05:47:13,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:13,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791501961] [2019-12-27 05:47:13,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:47:13,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:47:13,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791501961] [2019-12-27 05:47:13,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:47:13,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:47:13,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303555330] [2019-12-27 05:47:13,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:47:13,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:47:13,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:47:13,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:47:13,379 INFO L87 Difference]: Start difference. First operand 12389 states and 38882 transitions. Second operand 3 states. [2019-12-27 05:47:13,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:47:13,426 INFO L93 Difference]: Finished difference Result 12386 states and 38873 transitions. [2019-12-27 05:47:13,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:47:13,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 05:47:13,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:47:13,471 INFO L225 Difference]: With dead ends: 12386 [2019-12-27 05:47:13,472 INFO L226 Difference]: Without dead ends: 12386 [2019-12-27 05:47:13,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:47:13,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2019-12-27 05:47:13,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 12386. [2019-12-27 05:47:13,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12386 states. [2019-12-27 05:47:13,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12386 states to 12386 states and 38873 transitions. [2019-12-27 05:47:13,981 INFO L78 Accepts]: Start accepts. Automaton has 12386 states and 38873 transitions. Word has length 16 [2019-12-27 05:47:13,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:47:13,981 INFO L462 AbstractCegarLoop]: Abstraction has 12386 states and 38873 transitions. [2019-12-27 05:47:13,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:47:13,982 INFO L276 IsEmpty]: Start isEmpty. Operand 12386 states and 38873 transitions. [2019-12-27 05:47:13,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 05:47:13,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:13,986 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:47:13,986 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:13,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:13,987 INFO L82 PathProgramCache]: Analyzing trace with hash 865126068, now seen corresponding path program 1 times [2019-12-27 05:47:13,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:13,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480815783] [2019-12-27 05:47:13,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:47:14,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:47:14,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480815783] [2019-12-27 05:47:14,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:47:14,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:47:14,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732625306] [2019-12-27 05:47:14,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:47:14,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:47:14,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:47:14,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:47:14,109 INFO L87 Difference]: Start difference. First operand 12386 states and 38873 transitions. Second operand 4 states. [2019-12-27 05:47:14,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:47:14,148 INFO L93 Difference]: Finished difference Result 2361 states and 5903 transitions. [2019-12-27 05:47:14,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:47:14,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 05:47:14,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:47:14,153 INFO L225 Difference]: With dead ends: 2361 [2019-12-27 05:47:14,153 INFO L226 Difference]: Without dead ends: 1670 [2019-12-27 05:47:14,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:47:14,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2019-12-27 05:47:14,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1654. [2019-12-27 05:47:14,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2019-12-27 05:47:14,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 3696 transitions. [2019-12-27 05:47:14,188 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 3696 transitions. Word has length 17 [2019-12-27 05:47:14,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:47:14,188 INFO L462 AbstractCegarLoop]: Abstraction has 1654 states and 3696 transitions. [2019-12-27 05:47:14,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:47:14,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 3696 transitions. [2019-12-27 05:47:14,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 05:47:14,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:14,191 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:47:14,191 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:14,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:14,192 INFO L82 PathProgramCache]: Analyzing trace with hash 935036584, now seen corresponding path program 1 times [2019-12-27 05:47:14,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:14,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647003039] [2019-12-27 05:47:14,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:47:14,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:47:14,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647003039] [2019-12-27 05:47:14,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:47:14,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:47:14,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962165214] [2019-12-27 05:47:14,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:47:14,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:47:14,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:47:14,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:47:14,353 INFO L87 Difference]: Start difference. First operand 1654 states and 3696 transitions. Second operand 6 states. [2019-12-27 05:47:14,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:47:14,979 INFO L93 Difference]: Finished difference Result 4552 states and 10047 transitions. [2019-12-27 05:47:14,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:47:14,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 05:47:14,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:47:14,988 INFO L225 Difference]: With dead ends: 4552 [2019-12-27 05:47:14,988 INFO L226 Difference]: Without dead ends: 4517 [2019-12-27 05:47:14,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:47:15,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-12-27 05:47:15,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 2214. [2019-12-27 05:47:15,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2214 states. [2019-12-27 05:47:15,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 5000 transitions. [2019-12-27 05:47:15,056 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 5000 transitions. Word has length 25 [2019-12-27 05:47:15,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:47:15,057 INFO L462 AbstractCegarLoop]: Abstraction has 2214 states and 5000 transitions. [2019-12-27 05:47:15,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:47:15,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 5000 transitions. [2019-12-27 05:47:15,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 05:47:15,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:15,061 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] [2019-12-27 05:47:15,061 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:15,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:15,062 INFO L82 PathProgramCache]: Analyzing trace with hash -453087513, now seen corresponding path program 1 times [2019-12-27 05:47:15,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:15,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550978695] [2019-12-27 05:47:15,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:47:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:47:15,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550978695] [2019-12-27 05:47:15,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:47:15,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:47:15,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379847148] [2019-12-27 05:47:15,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:47:15,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:47:15,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:47:15,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:47:15,137 INFO L87 Difference]: Start difference. First operand 2214 states and 5000 transitions. Second operand 3 states. [2019-12-27 05:47:15,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:47:15,157 INFO L93 Difference]: Finished difference Result 3872 states and 8779 transitions. [2019-12-27 05:47:15,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:47:15,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 05:47:15,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:47:15,162 INFO L225 Difference]: With dead ends: 3872 [2019-12-27 05:47:15,162 INFO L226 Difference]: Without dead ends: 2030 [2019-12-27 05:47:15,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:47:15,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2019-12-27 05:47:15,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 2010. [2019-12-27 05:47:15,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2010 states. [2019-12-27 05:47:15,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 4452 transitions. [2019-12-27 05:47:15,197 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 4452 transitions. Word has length 26 [2019-12-27 05:47:15,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:47:15,198 INFO L462 AbstractCegarLoop]: Abstraction has 2010 states and 4452 transitions. [2019-12-27 05:47:15,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:47:15,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 4452 transitions. [2019-12-27 05:47:15,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 05:47:15,201 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:15,201 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] [2019-12-27 05:47:15,201 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:15,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:15,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1584123616, now seen corresponding path program 1 times [2019-12-27 05:47:15,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:15,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077464163] [2019-12-27 05:47:15,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:47:15,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:47:15,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077464163] [2019-12-27 05:47:15,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:47:15,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:47:15,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222248182] [2019-12-27 05:47:15,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:47:15,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:47:15,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:47:15,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:47:15,280 INFO L87 Difference]: Start difference. First operand 2010 states and 4452 transitions. Second operand 6 states. [2019-12-27 05:47:15,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:47:15,793 INFO L93 Difference]: Finished difference Result 3736 states and 7983 transitions. [2019-12-27 05:47:15,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:47:15,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 05:47:15,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:47:15,801 INFO L225 Difference]: With dead ends: 3736 [2019-12-27 05:47:15,801 INFO L226 Difference]: Without dead ends: 3707 [2019-12-27 05:47:15,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:47:15,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2019-12-27 05:47:15,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 1982. [2019-12-27 05:47:15,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2019-12-27 05:47:15,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 4405 transitions. [2019-12-27 05:47:15,847 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 4405 transitions. Word has length 26 [2019-12-27 05:47:15,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:47:15,848 INFO L462 AbstractCegarLoop]: Abstraction has 1982 states and 4405 transitions. [2019-12-27 05:47:15,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:47:15,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 4405 transitions. [2019-12-27 05:47:15,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:47:15,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:15,851 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:47:15,851 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:15,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:15,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1377848575, now seen corresponding path program 1 times [2019-12-27 05:47:15,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:15,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587671872] [2019-12-27 05:47:15,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:47:15,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:47:15,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587671872] [2019-12-27 05:47:15,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:47:15,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:47:15,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127257374] [2019-12-27 05:47:15,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:47:15,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:47:15,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:47:15,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:47:15,945 INFO L87 Difference]: Start difference. First operand 1982 states and 4405 transitions. Second operand 5 states. [2019-12-27 05:47:16,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:47:16,482 INFO L93 Difference]: Finished difference Result 2989 states and 6529 transitions. [2019-12-27 05:47:16,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:47:16,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 05:47:16,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:47:16,486 INFO L225 Difference]: With dead ends: 2989 [2019-12-27 05:47:16,487 INFO L226 Difference]: Without dead ends: 2989 [2019-12-27 05:47:16,487 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-27 05:47:16,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2019-12-27 05:47:16,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 2553. [2019-12-27 05:47:16,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2553 states. [2019-12-27 05:47:16,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 5641 transitions. [2019-12-27 05:47:16,535 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 5641 transitions. Word has length 27 [2019-12-27 05:47:16,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:47:16,535 INFO L462 AbstractCegarLoop]: Abstraction has 2553 states and 5641 transitions. [2019-12-27 05:47:16,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:47:16,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 5641 transitions. [2019-12-27 05:47:16,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 05:47:16,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:16,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] [2019-12-27 05:47:16,540 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:16,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:16,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1012801820, now seen corresponding path program 1 times [2019-12-27 05:47:16,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:16,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963326613] [2019-12-27 05:47:16,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:47:16,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:47:16,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963326613] [2019-12-27 05:47:16,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:47:16,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:47:16,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216396882] [2019-12-27 05:47:16,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:47:16,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:47:16,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:47:16,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:47:16,618 INFO L87 Difference]: Start difference. First operand 2553 states and 5641 transitions. Second operand 5 states. [2019-12-27 05:47:16,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:47:16,684 INFO L93 Difference]: Finished difference Result 1549 states and 3250 transitions. [2019-12-27 05:47:16,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:47:16,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 05:47:16,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:47:16,687 INFO L225 Difference]: With dead ends: 1549 [2019-12-27 05:47:16,688 INFO L226 Difference]: Without dead ends: 1302 [2019-12-27 05:47:16,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:47:16,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2019-12-27 05:47:16,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1207. [2019-12-27 05:47:16,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1207 states. [2019-12-27 05:47:16,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 2612 transitions. [2019-12-27 05:47:16,714 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 2612 transitions. Word has length 28 [2019-12-27 05:47:16,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:47:16,715 INFO L462 AbstractCegarLoop]: Abstraction has 1207 states and 2612 transitions. [2019-12-27 05:47:16,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:47:16,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 2612 transitions. [2019-12-27 05:47:16,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 05:47:16,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:16,720 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:47:16,720 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:16,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:16,720 INFO L82 PathProgramCache]: Analyzing trace with hash -257669256, now seen corresponding path program 1 times [2019-12-27 05:47:16,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:16,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422977889] [2019-12-27 05:47:16,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:47:16,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:47:16,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422977889] [2019-12-27 05:47:16,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:47:16,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:47:16,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434390049] [2019-12-27 05:47:16,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:47:16,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:47:16,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:47:16,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:47:16,860 INFO L87 Difference]: Start difference. First operand 1207 states and 2612 transitions. Second operand 7 states. [2019-12-27 05:47:17,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:47:17,044 INFO L93 Difference]: Finished difference Result 2115 states and 4473 transitions. [2019-12-27 05:47:17,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 05:47:17,044 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 05:47:17,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:47:17,046 INFO L225 Difference]: With dead ends: 2115 [2019-12-27 05:47:17,046 INFO L226 Difference]: Without dead ends: 1423 [2019-12-27 05:47:17,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:47:17,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2019-12-27 05:47:17,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1214. [2019-12-27 05:47:17,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2019-12-27 05:47:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 2602 transitions. [2019-12-27 05:47:17,073 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 2602 transitions. Word has length 51 [2019-12-27 05:47:17,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:47:17,073 INFO L462 AbstractCegarLoop]: Abstraction has 1214 states and 2602 transitions. [2019-12-27 05:47:17,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:47:17,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 2602 transitions. [2019-12-27 05:47:17,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 05:47:17,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:17,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] [2019-12-27 05:47:17,078 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:17,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:17,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1643045960, now seen corresponding path program 2 times [2019-12-27 05:47:17,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:17,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287675271] [2019-12-27 05:47:17,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:47:17,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:47:17,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287675271] [2019-12-27 05:47:17,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:47:17,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:47:17,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773865020] [2019-12-27 05:47:17,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:47:17,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:47:17,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:47:17,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:47:17,166 INFO L87 Difference]: Start difference. First operand 1214 states and 2602 transitions. Second operand 3 states. [2019-12-27 05:47:17,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:47:17,236 INFO L93 Difference]: Finished difference Result 1587 states and 3364 transitions. [2019-12-27 05:47:17,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:47:17,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 05:47:17,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:47:17,239 INFO L225 Difference]: With dead ends: 1587 [2019-12-27 05:47:17,239 INFO L226 Difference]: Without dead ends: 1587 [2019-12-27 05:47:17,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:47:17,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2019-12-27 05:47:17,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1262. [2019-12-27 05:47:17,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1262 states. [2019-12-27 05:47:17,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 2714 transitions. [2019-12-27 05:47:17,380 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 2714 transitions. Word has length 51 [2019-12-27 05:47:17,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:47:17,380 INFO L462 AbstractCegarLoop]: Abstraction has 1262 states and 2714 transitions. [2019-12-27 05:47:17,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:47:17,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 2714 transitions. [2019-12-27 05:47:17,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 05:47:17,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:17,384 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] [2019-12-27 05:47:17,384 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:17,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:17,385 INFO L82 PathProgramCache]: Analyzing trace with hash 730196883, now seen corresponding path program 1 times [2019-12-27 05:47:17,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:17,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103215994] [2019-12-27 05:47:17,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:47:17,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:47:17,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103215994] [2019-12-27 05:47:17,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:47:17,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:47:17,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716261226] [2019-12-27 05:47:17,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:47:17,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:47:17,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:47:17,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:47:17,515 INFO L87 Difference]: Start difference. First operand 1262 states and 2714 transitions. Second operand 8 states. [2019-12-27 05:47:19,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:47:19,036 INFO L93 Difference]: Finished difference Result 2653 states and 5478 transitions. [2019-12-27 05:47:19,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:47:19,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-27 05:47:19,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:47:19,041 INFO L225 Difference]: With dead ends: 2653 [2019-12-27 05:47:19,041 INFO L226 Difference]: Without dead ends: 2653 [2019-12-27 05:47:19,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2019-12-27 05:47:19,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2019-12-27 05:47:19,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 1286. [2019-12-27 05:47:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1286 states. [2019-12-27 05:47:19,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 2747 transitions. [2019-12-27 05:47:19,071 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 2747 transitions. Word has length 52 [2019-12-27 05:47:19,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:47:19,072 INFO L462 AbstractCegarLoop]: Abstraction has 1286 states and 2747 transitions. [2019-12-27 05:47:19,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:47:19,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 2747 transitions. [2019-12-27 05:47:19,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 05:47:19,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:19,076 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] [2019-12-27 05:47:19,076 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:19,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:19,076 INFO L82 PathProgramCache]: Analyzing trace with hash -539154384, now seen corresponding path program 1 times [2019-12-27 05:47:19,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:19,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194126841] [2019-12-27 05:47:19,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:47:19,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:47:19,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194126841] [2019-12-27 05:47:19,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:47:19,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:47:19,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403630588] [2019-12-27 05:47:19,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:47:19,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:47:19,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:47:19,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:47:19,136 INFO L87 Difference]: Start difference. First operand 1286 states and 2747 transitions. Second operand 4 states. [2019-12-27 05:47:19,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:47:19,351 INFO L93 Difference]: Finished difference Result 2096 states and 4397 transitions. [2019-12-27 05:47:19,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:47:19,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-27 05:47:19,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:47:19,355 INFO L225 Difference]: With dead ends: 2096 [2019-12-27 05:47:19,355 INFO L226 Difference]: Without dead ends: 2096 [2019-12-27 05:47:19,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:47:19,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2096 states. [2019-12-27 05:47:19,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2096 to 1235. [2019-12-27 05:47:19,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2019-12-27 05:47:19,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 2627 transitions. [2019-12-27 05:47:19,376 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 2627 transitions. Word has length 52 [2019-12-27 05:47:19,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:47:19,376 INFO L462 AbstractCegarLoop]: Abstraction has 1235 states and 2627 transitions. [2019-12-27 05:47:19,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:47:19,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 2627 transitions. [2019-12-27 05:47:19,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 05:47:19,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:19,379 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] [2019-12-27 05:47:19,379 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:19,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:19,380 INFO L82 PathProgramCache]: Analyzing trace with hash -930930685, now seen corresponding path program 2 times [2019-12-27 05:47:19,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:19,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040351819] [2019-12-27 05:47:19,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:47:19,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:47:19,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040351819] [2019-12-27 05:47:19,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:47:19,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:47:19,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002936296] [2019-12-27 05:47:19,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:47:19,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:47:19,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:47:19,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:47:19,451 INFO L87 Difference]: Start difference. First operand 1235 states and 2627 transitions. Second operand 3 states. [2019-12-27 05:47:19,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:47:19,464 INFO L93 Difference]: Finished difference Result 1234 states and 2625 transitions. [2019-12-27 05:47:19,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:47:19,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 05:47:19,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:47:19,466 INFO L225 Difference]: With dead ends: 1234 [2019-12-27 05:47:19,466 INFO L226 Difference]: Without dead ends: 1234 [2019-12-27 05:47:19,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:47:19,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2019-12-27 05:47:19,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 987. [2019-12-27 05:47:19,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 987 states. [2019-12-27 05:47:19,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 2130 transitions. [2019-12-27 05:47:19,484 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 2130 transitions. Word has length 52 [2019-12-27 05:47:19,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:47:19,484 INFO L462 AbstractCegarLoop]: Abstraction has 987 states and 2130 transitions. [2019-12-27 05:47:19,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:47:19,485 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 2130 transitions. [2019-12-27 05:47:19,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 05:47:19,487 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:47:19,487 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:47:19,488 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:47:19,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:47:19,488 INFO L82 PathProgramCache]: Analyzing trace with hash -87902062, now seen corresponding path program 1 times [2019-12-27 05:47:19,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:47:19,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334908484] [2019-12-27 05:47:19,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:47:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:47:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:47:19,617 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:47:19,619 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:47:19,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_46| 0 0))) (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t591~0.base_22| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t591~0.base_22|) |v_ULTIMATE.start_main_~#t591~0.offset_17| 0)) |v_#memory_int_17|) (= 0 v_~y$w_buff0~0_26) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd2~0_77 0) (= 0 v_~__unbuffered_cnt~0_13) (= 0 v_~__unbuffered_p1_EAX~0_12) (= 0 v_~y$r_buff1_thd2~0_53) (= 0 v_~y$r_buff1_thd0~0_22) (= 0 v_~weak$$choice0~0_5) (= v_~y$r_buff0_thd0~0_24 0) (= 0 v_~y$w_buff1~0_25) (= 0 v_~y$r_buff1_thd1~0_21) (= v_~y$w_buff0_used~0_103 0) (= 0 v_~y$flush_delayed~0_14) (= v_~y$read_delayed~0_6 0) (= v_~y$mem_tmp~0_11 0) (= v_~x~0_17 0) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~y$read_delayed_var~0.base_7) (= (store .cse0 |v_ULTIMATE.start_main_~#t591~0.base_22| 1) |v_#valid_44|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t591~0.base_22| 4) |v_#length_17|) (= v_~main$tmp_guard1~0_15 0) (= |v_#NULL.offset_4| 0) (= v_~y$w_buff1_used~0_67 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t591~0.base_22|)) (= v_~__unbuffered_p1_EBX~0_13 0) (= v_~main$tmp_guard0~0_11 0) (= v_~y~0_26 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t591~0.base_22|) (= 0 |v_ULTIMATE.start_main_~#t591~0.offset_17|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, ULTIMATE.start_main_~#t591~0.offset=|v_ULTIMATE.start_main_~#t591~0.offset_17|, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_20|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_~#t591~0.base=|v_ULTIMATE.start_main_~#t591~0.base_22|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_17|, ~y~0=v_~y~0_26, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_~#t592~0.base=|v_ULTIMATE.start_main_~#t592~0.base_18|, ULTIMATE.start_main_~#t592~0.offset=|v_ULTIMATE.start_main_~#t592~0.offset_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_24, #valid=|v_#valid_44|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_77, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_22, ~x~0=v_~x~0_17, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t591~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t591~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t592~0.base, ULTIMATE.start_main_~#t592~0.offset, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 05:47:19,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L797-1-->L799: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t592~0.base_12|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t592~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t592~0.base_12|) |v_ULTIMATE.start_main_~#t592~0.offset_10| 1)) |v_#memory_int_9|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t592~0.base_12| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t592~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t592~0.offset_10| 0) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t592~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t592~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t592~0.base=|v_ULTIMATE.start_main_~#t592~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, ULTIMATE.start_main_~#t592~0.offset=|v_ULTIMATE.start_main_~#t592~0.offset_10|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t592~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t592~0.offset, #length] because there is no mapped edge [2019-12-27 05:47:19,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_11) (= 1 v_~x~0_5) (= v_~y$r_buff0_thd2~0_55 v_~y$r_buff1_thd2~0_33) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= v_~y$r_buff0_thd1~0_16 1) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_10)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_16, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x~0=v_~x~0_5, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 05:47:19,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In347345645 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In347345645 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In347345645 |P0Thread1of1ForFork0_#t~ite5_Out347345645|)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out347345645|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In347345645, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In347345645} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out347345645|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In347345645, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In347345645} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 05:47:19,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-284010474 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-284010474 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-284010474 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-284010474 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-284010474| 0)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-284010474 |P0Thread1of1ForFork0_#t~ite6_Out-284010474|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-284010474, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-284010474, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-284010474, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-284010474} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-284010474|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-284010474, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-284010474, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-284010474, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-284010474} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 05:47:19,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-23097393 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-23097393 256)))) (or (and (= 0 ~y$r_buff0_thd1~0_Out-23097393) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd1~0_Out-23097393 ~y$r_buff0_thd1~0_In-23097393)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-23097393, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-23097393} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-23097393, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-23097393|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-23097393} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:47:19,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L763-->L763-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-395082709 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-395082709 256)))) (or (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-395082709 256))) (= 0 (mod ~y$w_buff0_used~0_In-395082709 256)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-395082709 256))))) .cse1 (= |P1Thread1of1ForFork1_#t~ite14_Out-395082709| ~y$w_buff0~0_In-395082709) (= |P1Thread1of1ForFork1_#t~ite14_Out-395082709| |P1Thread1of1ForFork1_#t~ite15_Out-395082709|)) (and (= |P1Thread1of1ForFork1_#t~ite14_In-395082709| |P1Thread1of1ForFork1_#t~ite14_Out-395082709|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite15_Out-395082709| ~y$w_buff0~0_In-395082709)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-395082709, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-395082709, ~y$w_buff0~0=~y$w_buff0~0_In-395082709, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-395082709, ~weak$$choice2~0=~weak$$choice2~0_In-395082709, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-395082709|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-395082709} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-395082709, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-395082709, ~y$w_buff0~0=~y$w_buff0~0_In-395082709, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-395082709, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-395082709|, ~weak$$choice2~0=~weak$$choice2~0_In-395082709, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-395082709|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-395082709} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 05:47:19,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1860584840 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out1860584840| |P1Thread1of1ForFork1_#t~ite17_Out1860584840|) (= ~y$w_buff1~0_In1860584840 |P1Thread1of1ForFork1_#t~ite17_Out1860584840|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1860584840 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In1860584840 256) 0)) (and (= (mod ~y$r_buff1_thd2~0_In1860584840 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In1860584840 256) 0)))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_In1860584840| |P1Thread1of1ForFork1_#t~ite17_Out1860584840|) (= |P1Thread1of1ForFork1_#t~ite18_Out1860584840| ~y$w_buff1~0_In1860584840)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1860584840, ~y$w_buff1~0=~y$w_buff1~0_In1860584840, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1860584840, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1860584840, ~weak$$choice2~0=~weak$$choice2~0_In1860584840, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1860584840|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1860584840} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1860584840, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1860584840|, ~y$w_buff1~0=~y$w_buff1~0_In1860584840, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1860584840, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1860584840, ~weak$$choice2~0=~weak$$choice2~0_In1860584840, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1860584840|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1860584840} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 05:47:19,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1562582470 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1562582470 |P1Thread1of1ForFork1_#t~ite21_Out-1562582470|) (= |P1Thread1of1ForFork1_#t~ite20_In-1562582470| |P1Thread1of1ForFork1_#t~ite20_Out-1562582470|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out-1562582470| ~y$w_buff0_used~0_In-1562582470) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1562582470 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-1562582470 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1562582470 256))) (and .cse1 (= (mod ~y$w_buff1_used~0_In-1562582470 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite20_Out-1562582470| |P1Thread1of1ForFork1_#t~ite21_Out-1562582470|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1562582470, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1562582470, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1562582470|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1562582470, ~weak$$choice2~0=~weak$$choice2~0_In-1562582470, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1562582470} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1562582470, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1562582470, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1562582470|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1562582470, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1562582470|, ~weak$$choice2~0=~weak$$choice2~0_In-1562582470, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1562582470} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 05:47:19,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_61 v_~y$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_60, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 05:47:19,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1293529921 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite30_Out-1293529921| ~y$r_buff1_thd2~0_In-1293529921) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-1293529921| |P1Thread1of1ForFork1_#t~ite29_Out-1293529921|)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-1293529921| ~y$r_buff1_thd2~0_In-1293529921) .cse0 (= |P1Thread1of1ForFork1_#t~ite30_Out-1293529921| |P1Thread1of1ForFork1_#t~ite29_Out-1293529921|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1293529921 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1293529921 256))) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1293529921 256))) (= 0 (mod ~y$w_buff0_used~0_In-1293529921 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1293529921, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1293529921|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1293529921, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1293529921, ~weak$$choice2~0=~weak$$choice2~0_In-1293529921, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1293529921} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1293529921, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1293529921|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1293529921|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1293529921, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1293529921, ~weak$$choice2~0=~weak$$choice2~0_In-1293529921, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1293529921} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 05:47:19,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1819621590 256))) (.cse3 (= (mod ~y$r_buff1_thd1~0_In1819621590 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1819621590 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1819621590 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out1819621590| ~y$r_buff1_thd1~0_In1819621590)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out1819621590| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1819621590, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1819621590, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1819621590, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1819621590} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1819621590, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1819621590, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1819621590|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1819621590, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1819621590} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 05:47:19,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L742-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_7 (+ v_~__unbuffered_cnt~0_8 1)) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_16, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 05:47:19,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_15 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 05:47:19,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In1434888566 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1434888566 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out1434888566| ~y$w_buff1~0_In1434888566)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out1434888566| ~y~0_In1434888566)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1434888566, ~y$w_buff1~0=~y$w_buff1~0_In1434888566, ~y~0=~y~0_In1434888566, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1434888566} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1434888566, ~y$w_buff1~0=~y$w_buff1~0_In1434888566, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1434888566|, ~y~0=~y~0_In1434888566, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1434888566} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 05:47:19,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_16 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 05:47:19,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In723492789 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In723492789 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out723492789| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out723492789| ~y$w_buff0_used~0_In723492789)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In723492789, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In723492789} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In723492789, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In723492789, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out723492789|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 05:47:19,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In901526130 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In901526130 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In901526130 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In901526130 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out901526130| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite35_Out901526130| ~y$w_buff1_used~0_In901526130) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In901526130, ~y$w_buff0_used~0=~y$w_buff0_used~0_In901526130, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In901526130, ~y$w_buff1_used~0=~y$w_buff1_used~0_In901526130} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In901526130, ~y$w_buff0_used~0=~y$w_buff0_used~0_In901526130, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In901526130, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out901526130|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In901526130} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 05:47:19,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1406914138 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1406914138 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In1406914138 |P1Thread1of1ForFork1_#t~ite36_Out1406914138|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1406914138|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1406914138, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1406914138} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1406914138, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1406914138, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1406914138|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 05:47:19,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In780062997 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In780062997 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In780062997 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In780062997 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out780062997|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$r_buff1_thd2~0_In780062997 |P1Thread1of1ForFork1_#t~ite37_Out780062997|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In780062997, ~y$w_buff0_used~0=~y$w_buff0_used~0_In780062997, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In780062997, ~y$w_buff1_used~0=~y$w_buff1_used~0_In780062997} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In780062997, ~y$w_buff0_used~0=~y$w_buff0_used~0_In780062997, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In780062997, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out780062997|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In780062997} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 05:47:19,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_45 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_45, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 05:47:19,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_82 256)) (= (mod v_~y$r_buff0_thd0~0_17 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 05:47:19,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In958380813 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In958380813 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out958380813| ~y$w_buff1~0_In958380813) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out958380813| ~y~0_In958380813) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In958380813, ~y~0=~y~0_In958380813, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In958380813, ~y$w_buff1_used~0=~y$w_buff1_used~0_In958380813} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out958380813|, ~y$w_buff1~0=~y$w_buff1~0_In958380813, ~y~0=~y~0_In958380813, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In958380813, ~y$w_buff1_used~0=~y$w_buff1_used~0_In958380813} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 05:47:19,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 05:47:19,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In580693653 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In580693653 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out580693653|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In580693653 |ULTIMATE.start_main_#t~ite42_Out580693653|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In580693653, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In580693653} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In580693653, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In580693653, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out580693653|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 05:47:19,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In768370385 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In768370385 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In768370385 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In768370385 256)))) (or (and (= ~y$w_buff1_used~0_In768370385 |ULTIMATE.start_main_#t~ite43_Out768370385|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite43_Out768370385| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In768370385, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In768370385, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In768370385, ~y$w_buff1_used~0=~y$w_buff1_used~0_In768370385} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In768370385, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In768370385, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out768370385|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In768370385, ~y$w_buff1_used~0=~y$w_buff1_used~0_In768370385} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 05:47:19,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1284070075 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1284070075 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1284070075| ~y$r_buff0_thd0~0_In-1284070075)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1284070075| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1284070075, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1284070075} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1284070075, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1284070075, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1284070075|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 05:47:19,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-112440402 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-112440402 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-112440402 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-112440402 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-112440402| 0)) (and (= |ULTIMATE.start_main_#t~ite45_Out-112440402| ~y$r_buff1_thd0~0_In-112440402) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-112440402, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-112440402, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-112440402, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-112440402} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-112440402, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-112440402, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-112440402, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-112440402|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-112440402} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 05:47:19,655 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite45_10| v_~y$r_buff1_thd0~0_14) (= 2 v_~__unbuffered_p1_EAX~0_7) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard1~0_7 0) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 2 v_~x~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~x~0=v_~x~0_9, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x~0=v_~x~0_9, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_14, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:47:19,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:47:19 BasicIcfg [2019-12-27 05:47:19,743 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:47:19,745 INFO L168 Benchmark]: Toolchain (without parser) took 16843.57 ms. Allocated memory was 140.0 MB in the beginning and 680.5 MB in the end (delta: 540.5 MB). Free memory was 101.7 MB in the beginning and 148.1 MB in the end (delta: -46.4 MB). Peak memory consumption was 494.1 MB. Max. memory is 7.1 GB. [2019-12-27 05:47:19,746 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 140.0 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 05:47:19,747 INFO L168 Benchmark]: CACSL2BoogieTranslator took 789.40 ms. Allocated memory was 140.0 MB in the beginning and 205.0 MB in the end (delta: 65.0 MB). Free memory was 101.2 MB in the beginning and 159.7 MB in the end (delta: -58.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-27 05:47:19,751 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.16 ms. Allocated memory is still 205.0 MB. Free memory was 159.7 MB in the beginning and 157.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 05:47:19,753 INFO L168 Benchmark]: Boogie Preprocessor took 42.45 ms. Allocated memory is still 205.0 MB. Free memory was 157.1 MB in the beginning and 154.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 05:47:19,754 INFO L168 Benchmark]: RCFGBuilder took 821.98 ms. Allocated memory is still 205.0 MB. Free memory was 154.6 MB in the beginning and 110.2 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-27 05:47:19,755 INFO L168 Benchmark]: TraceAbstraction took 15110.38 ms. Allocated memory was 205.0 MB in the beginning and 680.5 MB in the end (delta: 475.5 MB). Free memory was 110.2 MB in the beginning and 148.1 MB in the end (delta: -37.9 MB). Peak memory consumption was 437.7 MB. Max. memory is 7.1 GB. [2019-12-27 05:47:19,759 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.15 ms. Allocated memory is still 140.0 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 789.40 ms. Allocated memory was 140.0 MB in the beginning and 205.0 MB in the end (delta: 65.0 MB). Free memory was 101.2 MB in the beginning and 159.7 MB in the end (delta: -58.5 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.16 ms. Allocated memory is still 205.0 MB. Free memory was 159.7 MB in the beginning and 157.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.45 ms. Allocated memory is still 205.0 MB. Free memory was 157.1 MB in the beginning and 154.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 821.98 ms. Allocated memory is still 205.0 MB. Free memory was 154.6 MB in the beginning and 110.2 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15110.38 ms. Allocated memory was 205.0 MB in the beginning and 680.5 MB in the end (delta: 475.5 MB). Free memory was 110.2 MB in the beginning and 148.1 MB in the end (delta: -37.9 MB). Peak memory consumption was 437.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 29 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 27 ChoiceCompositions, 4371 VarBasedMoverChecksPositive, 158 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 55625 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t591, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t592, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1985 SDtfs, 2174 SDslu, 3625 SDs, 0 SdLazy, 2727 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 28 SyntacticMatches, 8 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12389occurred 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: 3.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 10466 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 436 ConstructedInterpolants, 0 QuantifiedInterpolants, 48996 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...