/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/safe029_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 23:03:01,611 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 23:03:01,614 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 23:03:01,632 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 23:03:01,633 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 23:03:01,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 23:03:01,637 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 23:03:01,646 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 23:03:01,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 23:03:01,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 23:03:01,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 23:03:01,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 23:03:01,657 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 23:03:01,659 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 23:03:01,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 23:03:01,663 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 23:03:01,664 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 23:03:01,665 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 23:03:01,666 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 23:03:01,671 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 23:03:01,675 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 23:03:01,680 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 23:03:01,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 23:03:01,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 23:03:01,685 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 23:03:01,685 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 23:03:01,685 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 23:03:01,687 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 23:03:01,688 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 23:03:01,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 23:03:01,690 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 23:03:01,692 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 23:03:01,692 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 23:03:01,693 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 23:03:01,695 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 23:03:01,695 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 23:03:01,696 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 23:03:01,696 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 23:03:01,696 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 23:03:01,697 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 23:03:01,698 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 23:03:01,699 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-18 23:03:01,721 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 23:03:01,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 23:03:01,722 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 23:03:01,722 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 23:03:01,723 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 23:03:01,723 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 23:03:01,727 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 23:03:01,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 23:03:01,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 23:03:01,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 23:03:01,727 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 23:03:01,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 23:03:01,729 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 23:03:01,729 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 23:03:01,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 23:03:01,729 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 23:03:01,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 23:03:01,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 23:03:01,730 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 23:03:01,730 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 23:03:01,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 23:03:01,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:03:01,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 23:03:01,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 23:03:01,731 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 23:03:01,734 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 23:03:01,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 23:03:01,734 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 23:03:01,735 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 23:03:01,735 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 23:03:02,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 23:03:02,018 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 23:03:02,022 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 23:03:02,024 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 23:03:02,024 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 23:03:02,025 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i [2019-12-18 23:03:02,090 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94bfcd76b/1b180b45a0b04e69877eb17af6dae9b0/FLAG96eb204c5 [2019-12-18 23:03:02,641 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 23:03:02,642 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i [2019-12-18 23:03:02,655 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94bfcd76b/1b180b45a0b04e69877eb17af6dae9b0/FLAG96eb204c5 [2019-12-18 23:03:02,952 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94bfcd76b/1b180b45a0b04e69877eb17af6dae9b0 [2019-12-18 23:03:02,961 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 23:03:02,963 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 23:03:02,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 23:03:02,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 23:03:02,968 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 23:03:02,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:03:02" (1/1) ... [2019-12-18 23:03:02,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18316cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:02, skipping insertion in model container [2019-12-18 23:03:02,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:03:02" (1/1) ... [2019-12-18 23:03:02,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 23:03:03,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 23:03:03,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:03:03,556 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 23:03:03,636 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:03:03,716 INFO L208 MainTranslator]: Completed translation [2019-12-18 23:03:03,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:03 WrapperNode [2019-12-18 23:03:03,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 23:03:03,717 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 23:03:03,717 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 23:03:03,718 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 23:03:03,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:03" (1/1) ... [2019-12-18 23:03:03,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:03" (1/1) ... [2019-12-18 23:03:03,789 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 23:03:03,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 23:03:03,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 23:03:03,793 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 23:03:03,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:03" (1/1) ... [2019-12-18 23:03:03,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:03" (1/1) ... [2019-12-18 23:03:03,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:03" (1/1) ... [2019-12-18 23:03:03,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:03" (1/1) ... [2019-12-18 23:03:03,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:03" (1/1) ... [2019-12-18 23:03:03,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:03" (1/1) ... [2019-12-18 23:03:03,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:03" (1/1) ... [2019-12-18 23:03:03,833 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 23:03:03,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 23:03:03,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 23:03:03,833 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 23:03:03,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03: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-18 23:03:03,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 23:03:03,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 23:03:03,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 23:03:03,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 23:03:03,909 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 23:03:03,909 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 23:03:03,910 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 23:03:03,910 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 23:03:03,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 23:03:03,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 23:03:03,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 23:03:03,912 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 23:03:04,604 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 23:03:04,604 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 23:03:04,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:03:04 BoogieIcfgContainer [2019-12-18 23:03:04,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 23:03:04,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 23:03:04,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 23:03:04,612 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 23:03:04,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:03:02" (1/3) ... [2019-12-18 23:03:04,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cff2a69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:03:04, skipping insertion in model container [2019-12-18 23:03:04,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:03:03" (2/3) ... [2019-12-18 23:03:04,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cff2a69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:03:04, skipping insertion in model container [2019-12-18 23:03:04,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:03:04" (3/3) ... [2019-12-18 23:03:04,620 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_pso.oepc.i [2019-12-18 23:03:04,632 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 23:03:04,632 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 23:03:04,644 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 23:03:04,645 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 23:03:04,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,699 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,699 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,699 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,700 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,700 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,708 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,708 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,729 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,729 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,730 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,734 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,735 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:03:04,753 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 23:03:04,772 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:03:04,773 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:03:04,773 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:03:04,773 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:03:04,773 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:03:04,773 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:03:04,774 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:03:04,774 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:03:04,792 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 179 transitions [2019-12-18 23:03:04,794 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-18 23:03:04,903 INFO L126 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-18 23:03:04,903 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:03:04,921 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 250 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 23:03:04,939 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 145 places, 179 transitions [2019-12-18 23:03:05,014 INFO L126 PetriNetUnfolder]: 41/177 cut-off events. [2019-12-18 23:03:05,015 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:03:05,023 INFO L76 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 177 events. 41/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 250 event pairs. 6/140 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 23:03:05,040 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10418 [2019-12-18 23:03:05,041 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:03:08,020 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2019-12-18 23:03:08,131 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48987 [2019-12-18 23:03:08,131 INFO L214 etLargeBlockEncoding]: Total number of compositions: 94 [2019-12-18 23:03:08,135 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 93 transitions [2019-12-18 23:03:08,672 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9272 states. [2019-12-18 23:03:08,675 INFO L276 IsEmpty]: Start isEmpty. Operand 9272 states. [2019-12-18 23:03:08,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 23:03:08,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:08,682 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 23:03:08,683 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:08,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:08,689 INFO L82 PathProgramCache]: Analyzing trace with hash 713212, now seen corresponding path program 1 times [2019-12-18 23:03:08,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:08,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752997532] [2019-12-18 23:03:08,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:08,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:08,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752997532] [2019-12-18 23:03:08,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:08,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:03:08,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139881670] [2019-12-18 23:03:08,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:03:08,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:08,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:03:08,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:08,939 INFO L87 Difference]: Start difference. First operand 9272 states. Second operand 3 states. [2019-12-18 23:03:09,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:09,298 INFO L93 Difference]: Finished difference Result 9157 states and 30129 transitions. [2019-12-18 23:03:09,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:03:09,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 23:03:09,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:09,431 INFO L225 Difference]: With dead ends: 9157 [2019-12-18 23:03:09,431 INFO L226 Difference]: Without dead ends: 8975 [2019-12-18 23:03:09,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:09,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8975 states. [2019-12-18 23:03:09,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8975 to 8975. [2019-12-18 23:03:09,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8975 states. [2019-12-18 23:03:09,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8975 states to 8975 states and 29569 transitions. [2019-12-18 23:03:09,907 INFO L78 Accepts]: Start accepts. Automaton has 8975 states and 29569 transitions. Word has length 3 [2019-12-18 23:03:09,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:09,908 INFO L462 AbstractCegarLoop]: Abstraction has 8975 states and 29569 transitions. [2019-12-18 23:03:09,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:03:09,908 INFO L276 IsEmpty]: Start isEmpty. Operand 8975 states and 29569 transitions. [2019-12-18 23:03:09,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 23:03:09,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:09,911 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:09,911 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:09,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:09,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1430597214, now seen corresponding path program 1 times [2019-12-18 23:03:09,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:09,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406774519] [2019-12-18 23:03:09,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:10,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:10,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406774519] [2019-12-18 23:03:10,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:10,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:03:10,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124176854] [2019-12-18 23:03:10,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:03:10,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:10,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:03:10,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:03:10,100 INFO L87 Difference]: Start difference. First operand 8975 states and 29569 transitions. Second operand 4 states. [2019-12-18 23:03:10,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:10,576 INFO L93 Difference]: Finished difference Result 13878 states and 43543 transitions. [2019-12-18 23:03:10,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:03:10,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 23:03:10,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:10,665 INFO L225 Difference]: With dead ends: 13878 [2019-12-18 23:03:10,666 INFO L226 Difference]: Without dead ends: 13871 [2019-12-18 23:03:10,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:03:10,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13871 states. [2019-12-18 23:03:11,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13871 to 12673. [2019-12-18 23:03:11,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12673 states. [2019-12-18 23:03:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12673 states to 12673 states and 40347 transitions. [2019-12-18 23:03:11,228 INFO L78 Accepts]: Start accepts. Automaton has 12673 states and 40347 transitions. Word has length 11 [2019-12-18 23:03:11,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:11,229 INFO L462 AbstractCegarLoop]: Abstraction has 12673 states and 40347 transitions. [2019-12-18 23:03:11,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:03:11,229 INFO L276 IsEmpty]: Start isEmpty. Operand 12673 states and 40347 transitions. [2019-12-18 23:03:11,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 23:03:11,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:11,238 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:11,238 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:11,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:11,239 INFO L82 PathProgramCache]: Analyzing trace with hash 244087264, now seen corresponding path program 1 times [2019-12-18 23:03:11,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:11,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19363503] [2019-12-18 23:03:11,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:11,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:11,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19363503] [2019-12-18 23:03:11,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:11,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:03:11,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75294975] [2019-12-18 23:03:11,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:03:11,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:11,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:03:11,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:03:11,376 INFO L87 Difference]: Start difference. First operand 12673 states and 40347 transitions. Second operand 4 states. [2019-12-18 23:03:11,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:11,631 INFO L93 Difference]: Finished difference Result 15173 states and 47858 transitions. [2019-12-18 23:03:11,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:03:11,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 23:03:11,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:11,689 INFO L225 Difference]: With dead ends: 15173 [2019-12-18 23:03:11,689 INFO L226 Difference]: Without dead ends: 15173 [2019-12-18 23:03:11,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:03:11,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15173 states. [2019-12-18 23:03:12,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15173 to 13657. [2019-12-18 23:03:12,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13657 states. [2019-12-18 23:03:12,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13657 states to 13657 states and 43454 transitions. [2019-12-18 23:03:12,809 INFO L78 Accepts]: Start accepts. Automaton has 13657 states and 43454 transitions. Word has length 11 [2019-12-18 23:03:12,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:12,809 INFO L462 AbstractCegarLoop]: Abstraction has 13657 states and 43454 transitions. [2019-12-18 23:03:12,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:03:12,809 INFO L276 IsEmpty]: Start isEmpty. Operand 13657 states and 43454 transitions. [2019-12-18 23:03:12,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 23:03:12,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:12,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:12,814 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:12,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:12,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1210915997, now seen corresponding path program 1 times [2019-12-18 23:03:12,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:12,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987431944] [2019-12-18 23:03:12,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:12,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:12,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987431944] [2019-12-18 23:03:12,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:12,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:03:12,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971685706] [2019-12-18 23:03:12,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:03:12,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:12,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:03:12,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:03:12,949 INFO L87 Difference]: Start difference. First operand 13657 states and 43454 transitions. Second operand 5 states. [2019-12-18 23:03:13,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:13,417 INFO L93 Difference]: Finished difference Result 18000 states and 55976 transitions. [2019-12-18 23:03:13,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 23:03:13,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 23:03:13,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:13,475 INFO L225 Difference]: With dead ends: 18000 [2019-12-18 23:03:13,476 INFO L226 Difference]: Without dead ends: 17993 [2019-12-18 23:03:13,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:03:13,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17993 states. [2019-12-18 23:03:13,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17993 to 13513. [2019-12-18 23:03:13,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13513 states. [2019-12-18 23:03:14,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13513 states to 13513 states and 42886 transitions. [2019-12-18 23:03:14,044 INFO L78 Accepts]: Start accepts. Automaton has 13513 states and 42886 transitions. Word has length 17 [2019-12-18 23:03:14,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:14,045 INFO L462 AbstractCegarLoop]: Abstraction has 13513 states and 42886 transitions. [2019-12-18 23:03:14,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:03:14,045 INFO L276 IsEmpty]: Start isEmpty. Operand 13513 states and 42886 transitions. [2019-12-18 23:03:14,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:03:14,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:14,064 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:14,064 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:14,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:14,065 INFO L82 PathProgramCache]: Analyzing trace with hash 368877695, now seen corresponding path program 1 times [2019-12-18 23:03:14,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:14,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147149096] [2019-12-18 23:03:14,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:14,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:14,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147149096] [2019-12-18 23:03:14,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:14,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:03:14,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886515749] [2019-12-18 23:03:14,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:03:14,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:14,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:03:14,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:14,112 INFO L87 Difference]: Start difference. First operand 13513 states and 42886 transitions. Second operand 3 states. [2019-12-18 23:03:14,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:14,269 INFO L93 Difference]: Finished difference Result 16497 states and 51650 transitions. [2019-12-18 23:03:14,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:03:14,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-18 23:03:14,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:14,341 INFO L225 Difference]: With dead ends: 16497 [2019-12-18 23:03:14,341 INFO L226 Difference]: Without dead ends: 16497 [2019-12-18 23:03:14,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16497 states. [2019-12-18 23:03:14,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16497 to 14538. [2019-12-18 23:03:14,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14538 states. [2019-12-18 23:03:14,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14538 states to 14538 states and 46033 transitions. [2019-12-18 23:03:14,910 INFO L78 Accepts]: Start accepts. Automaton has 14538 states and 46033 transitions. Word has length 25 [2019-12-18 23:03:14,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:14,911 INFO L462 AbstractCegarLoop]: Abstraction has 14538 states and 46033 transitions. [2019-12-18 23:03:14,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:03:14,911 INFO L276 IsEmpty]: Start isEmpty. Operand 14538 states and 46033 transitions. [2019-12-18 23:03:14,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 23:03:14,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:14,925 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:14,925 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:14,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:14,925 INFO L82 PathProgramCache]: Analyzing trace with hash 276108521, now seen corresponding path program 1 times [2019-12-18 23:03:14,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:14,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248497332] [2019-12-18 23:03:14,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:15,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:15,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248497332] [2019-12-18 23:03:15,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:15,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:03:15,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139214610] [2019-12-18 23:03:15,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:03:15,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:15,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:03:15,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:03:15,015 INFO L87 Difference]: Start difference. First operand 14538 states and 46033 transitions. Second operand 6 states. [2019-12-18 23:03:15,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:15,528 INFO L93 Difference]: Finished difference Result 20241 states and 62761 transitions. [2019-12-18 23:03:15,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 23:03:15,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 23:03:15,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:15,567 INFO L225 Difference]: With dead ends: 20241 [2019-12-18 23:03:15,568 INFO L226 Difference]: Without dead ends: 20225 [2019-12-18 23:03:15,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:03:15,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20225 states. [2019-12-18 23:03:16,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20225 to 16589. [2019-12-18 23:03:16,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16589 states. [2019-12-18 23:03:16,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16589 states to 16589 states and 52200 transitions. [2019-12-18 23:03:16,248 INFO L78 Accepts]: Start accepts. Automaton has 16589 states and 52200 transitions. Word has length 25 [2019-12-18 23:03:16,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:16,248 INFO L462 AbstractCegarLoop]: Abstraction has 16589 states and 52200 transitions. [2019-12-18 23:03:16,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:03:16,249 INFO L276 IsEmpty]: Start isEmpty. Operand 16589 states and 52200 transitions. [2019-12-18 23:03:16,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 23:03:16,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:16,280 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] [2019-12-18 23:03:16,280 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:16,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:16,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1785185324, now seen corresponding path program 1 times [2019-12-18 23:03:16,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:16,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023961162] [2019-12-18 23:03:16,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:16,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:16,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023961162] [2019-12-18 23:03:16,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:16,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:03:16,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935161352] [2019-12-18 23:03:16,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:03:16,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:16,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:03:16,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:03:16,370 INFO L87 Difference]: Start difference. First operand 16589 states and 52200 transitions. Second operand 4 states. [2019-12-18 23:03:16,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:16,406 INFO L93 Difference]: Finished difference Result 2316 states and 5300 transitions. [2019-12-18 23:03:16,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 23:03:16,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-12-18 23:03:16,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:16,410 INFO L225 Difference]: With dead ends: 2316 [2019-12-18 23:03:16,411 INFO L226 Difference]: Without dead ends: 2039 [2019-12-18 23:03:16,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:03:16,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2019-12-18 23:03:16,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 2039. [2019-12-18 23:03:16,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2039 states. [2019-12-18 23:03:16,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 4534 transitions. [2019-12-18 23:03:16,443 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 4534 transitions. Word has length 31 [2019-12-18 23:03:16,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:16,443 INFO L462 AbstractCegarLoop]: Abstraction has 2039 states and 4534 transitions. [2019-12-18 23:03:16,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:03:16,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 4534 transitions. [2019-12-18 23:03:16,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 23:03:16,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:16,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:16,448 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:16,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:16,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1705539938, now seen corresponding path program 1 times [2019-12-18 23:03:16,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:16,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418666732] [2019-12-18 23:03:16,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:16,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:16,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418666732] [2019-12-18 23:03:16,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:16,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:03:16,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135500790] [2019-12-18 23:03:16,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 23:03:16,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:16,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 23:03:16,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 23:03:16,586 INFO L87 Difference]: Start difference. First operand 2039 states and 4534 transitions. Second operand 8 states. [2019-12-18 23:03:17,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:17,766 INFO L93 Difference]: Finished difference Result 2608 states and 5669 transitions. [2019-12-18 23:03:17,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 23:03:17,766 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-12-18 23:03:17,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:17,769 INFO L225 Difference]: With dead ends: 2608 [2019-12-18 23:03:17,769 INFO L226 Difference]: Without dead ends: 2606 [2019-12-18 23:03:17,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-12-18 23:03:17,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2606 states. [2019-12-18 23:03:17,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2606 to 2100. [2019-12-18 23:03:17,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-12-18 23:03:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 4675 transitions. [2019-12-18 23:03:17,799 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 4675 transitions. Word has length 37 [2019-12-18 23:03:17,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:17,799 INFO L462 AbstractCegarLoop]: Abstraction has 2100 states and 4675 transitions. [2019-12-18 23:03:17,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 23:03:17,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 4675 transitions. [2019-12-18 23:03:17,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 23:03:17,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:17,804 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] [2019-12-18 23:03:17,805 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:17,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:17,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1992807550, now seen corresponding path program 1 times [2019-12-18 23:03:17,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:17,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686882918] [2019-12-18 23:03:17,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:17,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:17,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686882918] [2019-12-18 23:03:17,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:17,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:03:17,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825163680] [2019-12-18 23:03:17,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:03:17,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:17,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:03:17,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:03:17,880 INFO L87 Difference]: Start difference. First operand 2100 states and 4675 transitions. Second operand 5 states. [2019-12-18 23:03:18,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:18,370 INFO L93 Difference]: Finished difference Result 2859 states and 6230 transitions. [2019-12-18 23:03:18,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 23:03:18,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-18 23:03:18,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:18,374 INFO L225 Difference]: With dead ends: 2859 [2019-12-18 23:03:18,374 INFO L226 Difference]: Without dead ends: 2859 [2019-12-18 23:03:18,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:03:18,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2019-12-18 23:03:18,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2524. [2019-12-18 23:03:18,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2524 states. [2019-12-18 23:03:18,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2524 states to 2524 states and 5561 transitions. [2019-12-18 23:03:18,414 INFO L78 Accepts]: Start accepts. Automaton has 2524 states and 5561 transitions. Word has length 41 [2019-12-18 23:03:18,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:18,414 INFO L462 AbstractCegarLoop]: Abstraction has 2524 states and 5561 transitions. [2019-12-18 23:03:18,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:03:18,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2524 states and 5561 transitions. [2019-12-18 23:03:18,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 23:03:18,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:18,422 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] [2019-12-18 23:03:18,422 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:18,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:18,422 INFO L82 PathProgramCache]: Analyzing trace with hash 621749952, now seen corresponding path program 1 times [2019-12-18 23:03:18,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:18,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642191700] [2019-12-18 23:03:18,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:18,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:18,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642191700] [2019-12-18 23:03:18,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:18,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:03:18,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18269177] [2019-12-18 23:03:18,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:03:18,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:18,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:03:18,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:03:18,506 INFO L87 Difference]: Start difference. First operand 2524 states and 5561 transitions. Second operand 5 states. [2019-12-18 23:03:19,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:19,015 INFO L93 Difference]: Finished difference Result 3398 states and 7362 transitions. [2019-12-18 23:03:19,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:03:19,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-18 23:03:19,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:19,020 INFO L225 Difference]: With dead ends: 3398 [2019-12-18 23:03:19,020 INFO L226 Difference]: Without dead ends: 3398 [2019-12-18 23:03:19,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 23:03:19,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-12-18 23:03:19,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 2821. [2019-12-18 23:03:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2821 states. [2019-12-18 23:03:19,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 6202 transitions. [2019-12-18 23:03:19,072 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 6202 transitions. Word has length 42 [2019-12-18 23:03:19,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:19,073 INFO L462 AbstractCegarLoop]: Abstraction has 2821 states and 6202 transitions. [2019-12-18 23:03:19,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:03:19,073 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 6202 transitions. [2019-12-18 23:03:19,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 23:03:19,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:19,080 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] [2019-12-18 23:03:19,081 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:19,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:19,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1119205876, now seen corresponding path program 1 times [2019-12-18 23:03:19,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:19,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298283704] [2019-12-18 23:03:19,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:19,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:19,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298283704] [2019-12-18 23:03:19,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:19,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 23:03:19,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182026104] [2019-12-18 23:03:19,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 23:03:19,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:19,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 23:03:19,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 23:03:19,296 INFO L87 Difference]: Start difference. First operand 2821 states and 6202 transitions. Second operand 8 states. [2019-12-18 23:03:19,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:19,515 INFO L93 Difference]: Finished difference Result 5545 states and 12366 transitions. [2019-12-18 23:03:19,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 23:03:19,516 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-12-18 23:03:19,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:19,519 INFO L225 Difference]: With dead ends: 5545 [2019-12-18 23:03:19,519 INFO L226 Difference]: Without dead ends: 2588 [2019-12-18 23:03:19,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-12-18 23:03:19,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2588 states. [2019-12-18 23:03:19,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2588 to 2427. [2019-12-18 23:03:19,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2427 states. [2019-12-18 23:03:19,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 5350 transitions. [2019-12-18 23:03:19,547 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 5350 transitions. Word has length 42 [2019-12-18 23:03:19,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:19,548 INFO L462 AbstractCegarLoop]: Abstraction has 2427 states and 5350 transitions. [2019-12-18 23:03:19,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 23:03:19,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 5350 transitions. [2019-12-18 23:03:19,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 23:03:19,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:19,553 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] [2019-12-18 23:03:19,553 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:19,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:19,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1922052399, now seen corresponding path program 1 times [2019-12-18 23:03:19,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:19,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510293701] [2019-12-18 23:03:19,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:19,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:19,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510293701] [2019-12-18 23:03:19,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:19,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 23:03:19,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725312763] [2019-12-18 23:03:19,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 23:03:19,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:19,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 23:03:19,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:03:19,644 INFO L87 Difference]: Start difference. First operand 2427 states and 5350 transitions. Second operand 5 states. [2019-12-18 23:03:19,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:19,686 INFO L93 Difference]: Finished difference Result 561 states and 1018 transitions. [2019-12-18 23:03:19,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:03:19,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-18 23:03:19,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:19,687 INFO L225 Difference]: With dead ends: 561 [2019-12-18 23:03:19,687 INFO L226 Difference]: Without dead ends: 459 [2019-12-18 23:03:19,687 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-18 23:03:19,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-12-18 23:03:19,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 388. [2019-12-18 23:03:19,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-12-18 23:03:19,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 719 transitions. [2019-12-18 23:03:19,694 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 719 transitions. Word has length 43 [2019-12-18 23:03:19,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:19,694 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 719 transitions. [2019-12-18 23:03:19,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 23:03:19,694 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 719 transitions. [2019-12-18 23:03:19,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 23:03:19,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:19,696 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-18 23:03:19,696 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:19,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:19,696 INFO L82 PathProgramCache]: Analyzing trace with hash -302310553, now seen corresponding path program 1 times [2019-12-18 23:03:19,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:19,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153730823] [2019-12-18 23:03:19,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:19,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:19,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153730823] [2019-12-18 23:03:19,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:19,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:03:19,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215215266] [2019-12-18 23:03:19,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:03:19,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:19,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:03:19,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:19,797 INFO L87 Difference]: Start difference. First operand 388 states and 719 transitions. Second operand 3 states. [2019-12-18 23:03:19,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:19,836 INFO L93 Difference]: Finished difference Result 387 states and 717 transitions. [2019-12-18 23:03:19,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:03:19,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 23:03:19,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:19,838 INFO L225 Difference]: With dead ends: 387 [2019-12-18 23:03:19,838 INFO L226 Difference]: Without dead ends: 387 [2019-12-18 23:03:19,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:19,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-12-18 23:03:19,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 276. [2019-12-18 23:03:19,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-12-18 23:03:19,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 514 transitions. [2019-12-18 23:03:19,843 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 514 transitions. Word has length 52 [2019-12-18 23:03:19,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:19,843 INFO L462 AbstractCegarLoop]: Abstraction has 276 states and 514 transitions. [2019-12-18 23:03:19,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:03:19,843 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 514 transitions. [2019-12-18 23:03:19,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 23:03:19,844 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:19,844 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-18 23:03:19,844 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:19,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:19,845 INFO L82 PathProgramCache]: Analyzing trace with hash -936120261, now seen corresponding path program 1 times [2019-12-18 23:03:19,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:19,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954326516] [2019-12-18 23:03:19,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:19,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:19,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954326516] [2019-12-18 23:03:19,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:19,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:03:19,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673233551] [2019-12-18 23:03:19,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:03:19,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:19,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:03:19,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:19,901 INFO L87 Difference]: Start difference. First operand 276 states and 514 transitions. Second operand 3 states. [2019-12-18 23:03:19,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:19,911 INFO L93 Difference]: Finished difference Result 256 states and 459 transitions. [2019-12-18 23:03:19,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:03:19,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-18 23:03:19,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:19,912 INFO L225 Difference]: With dead ends: 256 [2019-12-18 23:03:19,912 INFO L226 Difference]: Without dead ends: 256 [2019-12-18 23:03:19,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:03:19,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-12-18 23:03:19,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 220. [2019-12-18 23:03:19,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-12-18 23:03:19,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 391 transitions. [2019-12-18 23:03:19,916 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 391 transitions. Word has length 53 [2019-12-18 23:03:19,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:19,917 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 391 transitions. [2019-12-18 23:03:19,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:03:19,917 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 391 transitions. [2019-12-18 23:03:19,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:03:19,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:19,918 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:19,918 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:19,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:19,919 INFO L82 PathProgramCache]: Analyzing trace with hash 10303747, now seen corresponding path program 1 times [2019-12-18 23:03:19,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:19,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439915684] [2019-12-18 23:03:19,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:20,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:20,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439915684] [2019-12-18 23:03:20,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:20,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 23:03:20,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561066198] [2019-12-18 23:03:20,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 23:03:20,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:20,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 23:03:20,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-18 23:03:20,746 INFO L87 Difference]: Start difference. First operand 220 states and 391 transitions. Second operand 23 states. [2019-12-18 23:03:22,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:22,509 INFO L93 Difference]: Finished difference Result 578 states and 1013 transitions. [2019-12-18 23:03:22,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 23:03:22,510 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2019-12-18 23:03:22,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:22,511 INFO L225 Difference]: With dead ends: 578 [2019-12-18 23:03:22,511 INFO L226 Difference]: Without dead ends: 546 [2019-12-18 23:03:22,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=356, Invalid=1714, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 23:03:22,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-12-18 23:03:22,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 304. [2019-12-18 23:03:22,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-12-18 23:03:22,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 535 transitions. [2019-12-18 23:03:22,517 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 535 transitions. Word has length 54 [2019-12-18 23:03:22,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:22,518 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 535 transitions. [2019-12-18 23:03:22,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 23:03:22,518 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 535 transitions. [2019-12-18 23:03:22,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:03:22,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:22,519 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:22,519 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:22,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:22,519 INFO L82 PathProgramCache]: Analyzing trace with hash 676099575, now seen corresponding path program 2 times [2019-12-18 23:03:22,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:22,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67050002] [2019-12-18 23:03:22,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:22,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:22,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67050002] [2019-12-18 23:03:22,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:22,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 23:03:22,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207892052] [2019-12-18 23:03:22,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 23:03:22,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:22,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 23:03:22,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 23:03:22,699 INFO L87 Difference]: Start difference. First operand 304 states and 535 transitions. Second operand 12 states. [2019-12-18 23:03:23,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:23,091 INFO L93 Difference]: Finished difference Result 470 states and 809 transitions. [2019-12-18 23:03:23,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 23:03:23,092 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-12-18 23:03:23,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:23,093 INFO L225 Difference]: With dead ends: 470 [2019-12-18 23:03:23,093 INFO L226 Difference]: Without dead ends: 438 [2019-12-18 23:03:23,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-12-18 23:03:23,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-18 23:03:23,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 320. [2019-12-18 23:03:23,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-18 23:03:23,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 562 transitions. [2019-12-18 23:03:23,098 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 562 transitions. Word has length 54 [2019-12-18 23:03:23,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:23,098 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 562 transitions. [2019-12-18 23:03:23,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 23:03:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 562 transitions. [2019-12-18 23:03:23,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:03:23,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:23,100 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:23,100 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:23,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:23,100 INFO L82 PathProgramCache]: Analyzing trace with hash 691777001, now seen corresponding path program 3 times [2019-12-18 23:03:23,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:23,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784351102] [2019-12-18 23:03:23,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:23,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:23,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784351102] [2019-12-18 23:03:23,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:23,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 23:03:23,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702779422] [2019-12-18 23:03:23,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 23:03:23,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:23,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 23:03:23,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-12-18 23:03:23,647 INFO L87 Difference]: Start difference. First operand 320 states and 562 transitions. Second operand 18 states. [2019-12-18 23:03:24,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:24,975 INFO L93 Difference]: Finished difference Result 580 states and 986 transitions. [2019-12-18 23:03:24,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 23:03:24,975 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 54 [2019-12-18 23:03:24,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:24,976 INFO L225 Difference]: With dead ends: 580 [2019-12-18 23:03:24,977 INFO L226 Difference]: Without dead ends: 548 [2019-12-18 23:03:24,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=1099, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 23:03:24,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-12-18 23:03:24,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 330. [2019-12-18 23:03:24,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-12-18 23:03:24,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 580 transitions. [2019-12-18 23:03:24,984 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 580 transitions. Word has length 54 [2019-12-18 23:03:24,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:24,984 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 580 transitions. [2019-12-18 23:03:24,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 23:03:24,984 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 580 transitions. [2019-12-18 23:03:24,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:03:24,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:24,985 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:24,985 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:24,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:24,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1825034455, now seen corresponding path program 4 times [2019-12-18 23:03:24,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:24,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401930367] [2019-12-18 23:03:24,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:03:25,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:03:25,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401930367] [2019-12-18 23:03:25,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:03:25,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 23:03:25,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075939451] [2019-12-18 23:03:25,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 23:03:25,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:03:25,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 23:03:25,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-18 23:03:25,178 INFO L87 Difference]: Start difference. First operand 330 states and 580 transitions. Second operand 13 states. [2019-12-18 23:03:25,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:03:25,461 INFO L93 Difference]: Finished difference Result 432 states and 734 transitions. [2019-12-18 23:03:25,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 23:03:25,462 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-18 23:03:25,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:03:25,462 INFO L225 Difference]: With dead ends: 432 [2019-12-18 23:03:25,463 INFO L226 Difference]: Without dead ends: 400 [2019-12-18 23:03:25,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-12-18 23:03:25,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-12-18 23:03:25,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 328. [2019-12-18 23:03:25,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-18 23:03:25,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 576 transitions. [2019-12-18 23:03:25,470 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 576 transitions. Word has length 54 [2019-12-18 23:03:25,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:03:25,470 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 576 transitions. [2019-12-18 23:03:25,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 23:03:25,470 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 576 transitions. [2019-12-18 23:03:25,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 23:03:25,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:03:25,474 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:03:25,474 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:03:25,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:03:25,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1943788027, now seen corresponding path program 5 times [2019-12-18 23:03:25,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:03:25,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629654551] [2019-12-18 23:03:25,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:03:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:03:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:03:25,657 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 23:03:25,658 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 23:03:25,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] ULTIMATE.startENTRY-->L777: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~x~0_11 0) (= v_~y$r_buff0_thd1~0_24 0) (= 0 v_~y$r_buff1_thd0~0_45) (= 0 v_~__unbuffered_cnt~0_15) (= 0 v_~y$w_buff1~0_24) (= v_~main$tmp_guard0~0_9 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2477~0.base_19|) 0) (= v_~y$r_buff0_thd2~0_19 0) (= v_~y$w_buff0_used~0_108 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2477~0.base_19|) (= v_~y$mem_tmp~0_11 0) (= 0 v_~y$w_buff0~0_29) (= v_~y~0_28 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2477~0.base_19| 1) |v_#valid_38|) (= 0 |v_#NULL.base_6|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2477~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2477~0.base_19|) |v_ULTIMATE.start_main_~#t2477~0.offset_16| 0)) |v_#memory_int_15|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2477~0.base_19| 4)) (= v_~y$w_buff1_used~0_62 0) (= 0 v_~y$r_buff1_thd2~0_17) (= 0 |v_ULTIMATE.start_main_~#t2477~0.offset_16|) (= v_~y$r_buff0_thd0~0_81 0) (= 0 v_~weak$$choice0~0_6) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~y$r_buff1_thd1~0_17) (= 0 v_~weak$$choice2~0_31) (< 0 |v_#StackHeapBarrier_13|) (= 0 v_~y$flush_delayed~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_15|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_12|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_10|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_15|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_15|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_24, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_15|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_8|, ULTIMATE.start_main_~#t2477~0.base=|v_ULTIMATE.start_main_~#t2477~0.base_19|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_15|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_15|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t2478~0.base=|v_ULTIMATE.start_main_~#t2478~0.base_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_19, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_45, ~x~0=v_~x~0_11, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_12|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_12|, ULTIMATE.start_main_~#t2478~0.offset=|v_ULTIMATE.start_main_~#t2478~0.offset_15|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_13|, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_28, ULTIMATE.start_main_~#t2477~0.offset=|v_ULTIMATE.start_main_~#t2477~0.offset_16|, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_12|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_10|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_12|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_12|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_15|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_15|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_81, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_7|, ~weak$$choice2~0=v_~weak$$choice2~0_31, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_62} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_~#t2477~0.base, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_~#t2478~0.base, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2478~0.offset, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t2477~0.offset, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 23:03:25,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L777-1-->L779: Formula: (and (= |v_#valid_21| (store |v_#valid_22| |v_ULTIMATE.start_main_~#t2478~0.base_11| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2478~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2478~0.base_11|) |v_ULTIMATE.start_main_~#t2478~0.offset_10| 1))) (= 0 (select |v_#valid_22| |v_ULTIMATE.start_main_~#t2478~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t2478~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t2478~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2478~0.base_11|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2478~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2478~0.offset=|v_ULTIMATE.start_main_~#t2478~0.offset_10|, ULTIMATE.start_main_~#t2478~0.base=|v_ULTIMATE.start_main_~#t2478~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2478~0.offset, ULTIMATE.start_main_~#t2478~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-18 23:03:25,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|) (= 2 v_~y$w_buff0~0_21) (= v_~y$w_buff1_used~0_52 v_~y$w_buff0_used~0_89) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_~y$w_buff0~0_22 v_~y$w_buff1~0_18) (= 0 (mod v_~y$w_buff1_used~0_52 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= 1 v_~y$w_buff0_used~0_88)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_22, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_88, ~y$w_buff1~0=v_~y$w_buff1~0_18, ~y$w_buff0~0=v_~y$w_buff0~0_21, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_7, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_52} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 23:03:25,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1176547883 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-1176547883 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1176547883|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1176547883 |P0Thread1of1ForFork0_#t~ite5_Out-1176547883|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1176547883, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1176547883} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1176547883|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1176547883, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1176547883} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 23:03:25,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L754-2-->L754-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1775866005 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1775866005 256)))) (or (and (= ~y~0_In1775866005 |P1Thread1of1ForFork1_#t~ite9_Out1775866005|) (or .cse0 .cse1)) (and (= ~y$w_buff1~0_In1775866005 |P1Thread1of1ForFork1_#t~ite9_Out1775866005|) (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1775866005, ~y$w_buff1~0=~y$w_buff1~0_In1775866005, ~y~0=~y~0_In1775866005, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1775866005} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1775866005, ~y$w_buff1~0=~y$w_buff1~0_In1775866005, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1775866005|, ~y~0=~y~0_In1775866005, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1775866005} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 23:03:25,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L754-4-->L755: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_21) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-18 23:03:25,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L755-->L755-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2120142901 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-2120142901 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out-2120142901| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-2120142901| ~y$w_buff0_used~0_In-2120142901) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120142901, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2120142901} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120142901, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2120142901, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-2120142901|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 23:03:25,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L736-->L736-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd1~0_In1476329014 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1476329014 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1476329014 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In1476329014 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1476329014 |P0Thread1of1ForFork0_#t~ite6_Out1476329014|)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out1476329014| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1476329014, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1476329014, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1476329014, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1476329014} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1476329014|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1476329014, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1476329014, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1476329014, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1476329014} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 23:03:25,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L737-->L738: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-1745349559 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1745349559 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In-1745349559 ~y$r_buff0_thd1~0_Out-1745349559)) (and (= ~y$r_buff0_thd1~0_Out-1745349559 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1745349559, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1745349559} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1745349559, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1745349559|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1745349559} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 23:03:25,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L756-->L756-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-636586282 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-636586282 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-636586282 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-636586282 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite12_Out-636586282| ~y$w_buff1_used~0_In-636586282) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite12_Out-636586282| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-636586282, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-636586282, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-636586282, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-636586282} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-636586282, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-636586282, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-636586282, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-636586282|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-636586282} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 23:03:25,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L757-->L757-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In903224403 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In903224403 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out903224403| ~y$r_buff0_thd2~0_In903224403) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out903224403| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In903224403, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In903224403} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In903224403, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In903224403, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out903224403|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 23:03:25,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L758-->L758-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In2116715873 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In2116715873 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In2116715873 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In2116715873 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out2116715873|)) (and (= ~y$r_buff1_thd2~0_In2116715873 |P1Thread1of1ForFork1_#t~ite14_Out2116715873|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2116715873, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2116715873, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2116715873, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2116715873} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2116715873, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2116715873, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2116715873, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out2116715873|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2116715873} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 23:03:25,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L758-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_13, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 23:03:25,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L738-->L738-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-447521614 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-447521614 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-447521614 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-447521614 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-447521614| ~y$r_buff1_thd1~0_In-447521614) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-447521614| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-447521614, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-447521614, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-447521614, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-447521614} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-447521614, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-447521614, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-447521614|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-447521614, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-447521614} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 23:03:25,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L738-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_13) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, 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_8} 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-18 23:03:25,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [592] [592] L783-->L785-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~y$r_buff0_thd0~0_51 256)) (= (mod v_~y$w_buff0_used~0_75 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_75, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_75, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 23:03:25,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L785-2-->L785-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-112206852 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-112206852 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite17_Out-112206852| ~y~0_In-112206852)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite17_Out-112206852| ~y$w_buff1~0_In-112206852) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-112206852, ~y~0=~y~0_In-112206852, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-112206852, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-112206852} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-112206852|, ~y$w_buff1~0=~y$w_buff1~0_In-112206852, ~y~0=~y~0_In-112206852, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-112206852, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-112206852} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-18 23:03:25,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L785-4-->L786: Formula: (= v_~y~0_20 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_8|, ~y~0=v_~y~0_20} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-12-18 23:03:25,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1938615775 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1938615775 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite19_Out-1938615775| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1938615775 |ULTIMATE.start_main_#t~ite19_Out-1938615775|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1938615775, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1938615775} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1938615775, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1938615775|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1938615775} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 23:03:25,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L787-->L787-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-310628389 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-310628389 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-310628389 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-310628389 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-310628389 |ULTIMATE.start_main_#t~ite20_Out-310628389|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite20_Out-310628389|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-310628389, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-310628389, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-310628389, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-310628389} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-310628389, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-310628389, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-310628389|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-310628389, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-310628389} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 23:03:25,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In476566278 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In476566278 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out476566278| ~y$r_buff0_thd0~0_In476566278)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out476566278| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In476566278, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In476566278} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In476566278, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In476566278, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out476566278|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 23:03:25,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L789-->L789-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1902665882 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1902665882 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1902665882 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1902665882 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out1902665882| ~y$r_buff1_thd0~0_In1902665882) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite22_Out1902665882|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1902665882, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1902665882, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1902665882, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1902665882} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1902665882, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1902665882, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1902665882, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1902665882|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1902665882} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 23:03:25,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L799-->L799-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-616914961 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite35_Out-616914961| ~y$w_buff0_used~0_In-616914961) (= |ULTIMATE.start_main_#t~ite34_In-616914961| |ULTIMATE.start_main_#t~ite34_Out-616914961|)) (and .cse0 (= |ULTIMATE.start_main_#t~ite34_Out-616914961| |ULTIMATE.start_main_#t~ite35_Out-616914961|) (= |ULTIMATE.start_main_#t~ite34_Out-616914961| ~y$w_buff0_used~0_In-616914961) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-616914961 256)))) (or (= (mod ~y$w_buff0_used~0_In-616914961 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd0~0_In-616914961 256) 0)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-616914961 256) 0))))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-616914961, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-616914961, ~weak$$choice2~0=~weak$$choice2~0_In-616914961, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-616914961, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-616914961, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_In-616914961|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-616914961, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-616914961, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-616914961|, ~weak$$choice2~0=~weak$$choice2~0_In-616914961, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-616914961, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-616914961|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-616914961} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 23:03:25,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [597] [597] L801-->L802: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~y$r_buff0_thd0~0_54 v_~y$r_buff0_thd0~0_53)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_54, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-18 23:03:25,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L804-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_8 256)) (= v_~y~0_24 v_~y$mem_tmp~0_7) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_24, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 23:03:25,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 23:03:25,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:03:25 BasicIcfg [2019-12-18 23:03:25,785 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 23:03:25,787 INFO L168 Benchmark]: Toolchain (without parser) took 22824.56 ms. Allocated memory was 138.9 MB in the beginning and 879.2 MB in the end (delta: 740.3 MB). Free memory was 100.6 MB in the beginning and 461.4 MB in the end (delta: -360.8 MB). Peak memory consumption was 379.5 MB. Max. memory is 7.1 GB. [2019-12-18 23:03:25,788 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 23:03:25,789 INFO L168 Benchmark]: CACSL2BoogieTranslator took 752.43 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.4 MB in the beginning and 157.7 MB in the end (delta: -57.3 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-18 23:03:25,789 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.96 ms. Allocated memory is still 203.4 MB. Free memory was 157.7 MB in the beginning and 155.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 23:03:25,790 INFO L168 Benchmark]: Boogie Preprocessor took 43.29 ms. Allocated memory is still 203.4 MB. Free memory was 155.1 MB in the beginning and 152.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 23:03:25,790 INFO L168 Benchmark]: RCFGBuilder took 774.02 ms. Allocated memory is still 203.4 MB. Free memory was 152.4 MB in the beginning and 108.5 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. [2019-12-18 23:03:25,791 INFO L168 Benchmark]: TraceAbstraction took 21177.32 ms. Allocated memory was 203.4 MB in the beginning and 879.2 MB in the end (delta: 675.8 MB). Free memory was 107.9 MB in the beginning and 461.4 MB in the end (delta: -353.5 MB). Peak memory consumption was 322.3 MB. Max. memory is 7.1 GB. [2019-12-18 23:03:25,794 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.43 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 752.43 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.4 MB in the beginning and 157.7 MB in the end (delta: -57.3 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.96 ms. Allocated memory is still 203.4 MB. Free memory was 157.7 MB in the beginning and 155.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 43.29 ms. Allocated memory is still 203.4 MB. Free memory was 155.1 MB in the beginning and 152.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 774.02 ms. Allocated memory is still 203.4 MB. Free memory was 152.4 MB in the beginning and 108.5 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21177.32 ms. Allocated memory was 203.4 MB in the beginning and 879.2 MB in the end (delta: 675.8 MB). Free memory was 107.9 MB in the beginning and 461.4 MB in the end (delta: -353.5 MB). Peak memory consumption was 322.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 145 ProgramPointsBefore, 80 ProgramPointsAfterwards, 179 TransitionsBefore, 93 TransitionsAfterwards, 10418 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 24 ChoiceCompositions, 3351 VarBasedMoverChecksPositive, 154 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 48987 CheckedPairsTotal, 94 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L777] FCALL, FORK 0 pthread_create(&t2477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L779] FCALL, FORK 0 pthread_create(&t2478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L726] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L727] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L728] 1 y$r_buff0_thd1 = (_Bool)1 [L731] 1 x = 1 VAL [__unbuffered_cnt=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 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, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] 2 x = 2 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 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) [L754] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L736] 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 [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 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 [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] 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 [L788] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 y$flush_delayed = weak$$choice2 [L795] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L797] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L798] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L799] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 20.8s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2413 SDtfs, 2777 SDslu, 6902 SDs, 0 SdLazy, 5183 SolverSat, 271 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 25 SyntacticMatches, 13 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16589occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 15236 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 703 NumberOfCodeBlocks, 703 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 631 ConstructedInterpolants, 0 QuantifiedInterpolants, 157696 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...