/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:20:12,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:20:12,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:20:12,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:20:12,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:20:12,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:20:12,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:20:12,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:20:12,656 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:20:12,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:20:12,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:20:12,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:20:12,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:20:12,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:20:12,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:20:12,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:20:12,663 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:20:12,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:20:12,666 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:20:12,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:20:12,669 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:20:12,670 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:20:12,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:20:12,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:20:12,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:20:12,675 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:20:12,675 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:20:12,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:20:12,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:20:12,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:20:12,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:20:12,679 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:20:12,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:20:12,680 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:20:12,681 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:20:12,681 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:20:12,682 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:20:12,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:20:12,683 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:20:12,683 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:20:12,684 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:20:12,685 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-MCR.epf [2019-12-27 22:20:12,699 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:20:12,699 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:20:12,700 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:20:12,701 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:20:12,701 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:20:12,701 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:20:12,701 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:20:12,701 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:20:12,702 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:20:12,702 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:20:12,702 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:20:12,702 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:20:12,702 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:20:12,702 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:20:12,703 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:20:12,703 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:20:12,703 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:20:12,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:20:12,703 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:20:12,704 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:20:12,704 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:20:12,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:20:12,704 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:20:12,704 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:20:12,705 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:20:12,705 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:20:12,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:20:12,705 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:20:12,705 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:20:12,706 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:20:12,706 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:20:12,706 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:20:12,969 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:20:12,991 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:20:12,994 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:20:12,996 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:20:12,997 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:20:12,998 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_pso.oepc.i [2019-12-27 22:20:13,075 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43f9296e1/64dba967612d4fb4903c8cf44b4d31de/FLAGcc4918ce0 [2019-12-27 22:20:13,661 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:20:13,662 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_pso.oepc.i [2019-12-27 22:20:13,687 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43f9296e1/64dba967612d4fb4903c8cf44b4d31de/FLAGcc4918ce0 [2019-12-27 22:20:13,962 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43f9296e1/64dba967612d4fb4903c8cf44b4d31de [2019-12-27 22:20:13,972 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:20:13,975 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:20:13,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:20:13,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:20:13,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:20:13,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:20:13" (1/1) ... [2019-12-27 22:20:13,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da66fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:13, skipping insertion in model container [2019-12-27 22:20:13,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:20:13" (1/1) ... [2019-12-27 22:20:13,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:20:14,057 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:20:14,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:20:14,536 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:20:14,627 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:20:14,703 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:20:14,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:14 WrapperNode [2019-12-27 22:20:14,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:20:14,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:20:14,705 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:20:14,705 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:20:14,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:14" (1/1) ... [2019-12-27 22:20:14,733 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:14" (1/1) ... [2019-12-27 22:20:14,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:20:14,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:20:14,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:20:14,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:20:14,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:14" (1/1) ... [2019-12-27 22:20:14,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:14" (1/1) ... [2019-12-27 22:20:14,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:14" (1/1) ... [2019-12-27 22:20:14,789 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:14" (1/1) ... [2019-12-27 22:20:14,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:14" (1/1) ... [2019-12-27 22:20:14,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:14" (1/1) ... [2019-12-27 22:20:14,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:14" (1/1) ... [2019-12-27 22:20:14,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:20:14,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:20:14,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:20:14,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:20:14,813 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:20:14,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:20:14,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:20:14,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:20:14,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:20:14,896 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:20:14,897 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:20:14,897 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:20:14,898 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:20:14,898 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:20:14,898 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:20:14,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:20:14,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:20:14,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:20:14,901 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 22:20:15,654 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:20:15,655 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:20:15,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:20:15 BoogieIcfgContainer [2019-12-27 22:20:15,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:20:15,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:20:15,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:20:15,661 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:20:15,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:20:13" (1/3) ... [2019-12-27 22:20:15,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b1cb51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:20:15, skipping insertion in model container [2019-12-27 22:20:15,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:14" (2/3) ... [2019-12-27 22:20:15,663 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b1cb51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:20:15, skipping insertion in model container [2019-12-27 22:20:15,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:20:15" (3/3) ... [2019-12-27 22:20:15,665 INFO L109 eAbstractionObserver]: Analyzing ICFG safe008_pso.oepc.i [2019-12-27 22:20:15,675 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:20:15,676 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:20:15,688 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:20:15,690 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:20:15,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,730 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,730 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,730 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,731 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,731 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,731 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,732 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,732 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,733 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,734 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,735 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,740 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,740 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,748 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,748 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,753 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,754 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,755 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,761 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,761 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,762 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,782 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,783 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,786 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,786 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:15,802 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:20:15,818 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:20:15,818 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:20:15,818 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:20:15,818 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:20:15,818 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:20:15,818 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:20:15,819 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:20:15,819 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:20:15,838 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 22:20:15,840 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 22:20:15,965 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 22:20:15,965 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:20:15,981 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:20:16,004 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 22:20:16,087 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 22:20:16,088 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:20:16,099 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:20:16,117 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-27 22:20:16,118 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:20:19,431 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 22:20:19,565 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 22:20:19,596 INFO L206 etLargeBlockEncoding]: Checked pairs total: 84694 [2019-12-27 22:20:19,596 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 22:20:19,600 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 98 places, 111 transitions [2019-12-27 22:20:43,188 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129812 states. [2019-12-27 22:20:43,190 INFO L276 IsEmpty]: Start isEmpty. Operand 129812 states. [2019-12-27 22:20:43,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 22:20:43,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:20:43,197 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 22:20:43,197 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:20:43,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:20:43,203 INFO L82 PathProgramCache]: Analyzing trace with hash 841641, now seen corresponding path program 1 times [2019-12-27 22:20:43,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:20:43,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477551811] [2019-12-27 22:20:43,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:20:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:20:43,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:20:43,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477551811] [2019-12-27 22:20:43,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:20:43,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:20:43,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1696308782] [2019-12-27 22:20:43,465 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:20:43,469 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:20:43,482 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 22:20:43,482 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:20:43,486 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:20:43,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:20:43,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:20:43,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:20:43,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:20:43,505 INFO L87 Difference]: Start difference. First operand 129812 states. Second operand 3 states. [2019-12-27 22:20:45,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:20:45,268 INFO L93 Difference]: Finished difference Result 129324 states and 557563 transitions. [2019-12-27 22:20:45,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:20:45,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 22:20:45,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:20:49,535 INFO L225 Difference]: With dead ends: 129324 [2019-12-27 22:20:49,536 INFO L226 Difference]: Without dead ends: 126776 [2019-12-27 22:20:49,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:20:53,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126776 states. [2019-12-27 22:20:56,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126776 to 126776. [2019-12-27 22:20:56,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126776 states. [2019-12-27 22:20:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126776 states to 126776 states and 547175 transitions. [2019-12-27 22:20:57,361 INFO L78 Accepts]: Start accepts. Automaton has 126776 states and 547175 transitions. Word has length 3 [2019-12-27 22:20:57,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:20:57,361 INFO L462 AbstractCegarLoop]: Abstraction has 126776 states and 547175 transitions. [2019-12-27 22:20:57,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:20:57,361 INFO L276 IsEmpty]: Start isEmpty. Operand 126776 states and 547175 transitions. [2019-12-27 22:20:57,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:20:57,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:20:57,367 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:20:57,367 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:20:57,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:20:57,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1225155789, now seen corresponding path program 1 times [2019-12-27 22:20:57,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:20:57,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351832588] [2019-12-27 22:20:57,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:20:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:20:57,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:20:57,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351832588] [2019-12-27 22:20:57,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:20:57,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:20:57,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [963958850] [2019-12-27 22:20:57,538 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:20:57,540 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:20:57,545 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:20:57,546 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:20:57,546 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:20:57,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:20:57,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:20:57,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:20:57,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:20:57,548 INFO L87 Difference]: Start difference. First operand 126776 states and 547175 transitions. Second operand 4 states. [2019-12-27 22:21:03,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:03,246 INFO L93 Difference]: Finished difference Result 198216 states and 822018 transitions. [2019-12-27 22:21:03,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:21:03,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:21:03,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:04,088 INFO L225 Difference]: With dead ends: 198216 [2019-12-27 22:21:04,088 INFO L226 Difference]: Without dead ends: 198167 [2019-12-27 22:21:04,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:21:10,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198167 states. [2019-12-27 22:21:19,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198167 to 182118. [2019-12-27 22:21:19,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182118 states. [2019-12-27 22:21:19,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182118 states to 182118 states and 765134 transitions. [2019-12-27 22:21:19,710 INFO L78 Accepts]: Start accepts. Automaton has 182118 states and 765134 transitions. Word has length 11 [2019-12-27 22:21:19,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:19,712 INFO L462 AbstractCegarLoop]: Abstraction has 182118 states and 765134 transitions. [2019-12-27 22:21:19,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:21:19,712 INFO L276 IsEmpty]: Start isEmpty. Operand 182118 states and 765134 transitions. [2019-12-27 22:21:19,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:21:19,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:19,719 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:19,720 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:19,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:19,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1435968535, now seen corresponding path program 1 times [2019-12-27 22:21:19,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:19,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176888811] [2019-12-27 22:21:19,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:19,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:19,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176888811] [2019-12-27 22:21:19,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:19,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:21:19,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [706416634] [2019-12-27 22:21:19,865 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:19,867 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:19,868 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:21:19,869 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:19,869 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:21:19,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:21:19,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:19,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:21:19,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:21:19,870 INFO L87 Difference]: Start difference. First operand 182118 states and 765134 transitions. Second operand 4 states. [2019-12-27 22:21:25,273 WARN L192 SmtUtils]: Spent 5.36 s on a formula simplification that was a NOOP. DAG size: 8 [2019-12-27 22:21:26,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:26,881 INFO L93 Difference]: Finished difference Result 260296 states and 1067327 transitions. [2019-12-27 22:21:26,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:21:26,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:21:26,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:28,505 INFO L225 Difference]: With dead ends: 260296 [2019-12-27 22:21:28,505 INFO L226 Difference]: Without dead ends: 260233 [2019-12-27 22:21:28,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:21:36,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260233 states. [2019-12-27 22:21:46,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260233 to 221154. [2019-12-27 22:21:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221154 states. [2019-12-27 22:21:48,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221154 states to 221154 states and 922215 transitions. [2019-12-27 22:21:48,575 INFO L78 Accepts]: Start accepts. Automaton has 221154 states and 922215 transitions. Word has length 13 [2019-12-27 22:21:48,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:48,575 INFO L462 AbstractCegarLoop]: Abstraction has 221154 states and 922215 transitions. [2019-12-27 22:21:48,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:21:48,575 INFO L276 IsEmpty]: Start isEmpty. Operand 221154 states and 922215 transitions. [2019-12-27 22:21:48,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:21:48,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:48,579 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:48,579 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:48,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:48,579 INFO L82 PathProgramCache]: Analyzing trace with hash 472638345, now seen corresponding path program 1 times [2019-12-27 22:21:48,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:48,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4062962] [2019-12-27 22:21:48,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:48,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:48,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4062962] [2019-12-27 22:21:48,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:48,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:21:48,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1552969466] [2019-12-27 22:21:48,623 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:48,626 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:48,627 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:21:48,628 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:48,628 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:21:48,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:21:48,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:48,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:21:48,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:21:48,629 INFO L87 Difference]: Start difference. First operand 221154 states and 922215 transitions. Second operand 3 states. [2019-12-27 22:21:48,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:48,799 INFO L93 Difference]: Finished difference Result 42754 states and 139696 transitions. [2019-12-27 22:21:48,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:21:48,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 22:21:48,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:48,869 INFO L225 Difference]: With dead ends: 42754 [2019-12-27 22:21:48,869 INFO L226 Difference]: Without dead ends: 42754 [2019-12-27 22:21:48,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:21:49,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42754 states. [2019-12-27 22:21:55,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42754 to 42754. [2019-12-27 22:21:55,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42754 states. [2019-12-27 22:21:55,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42754 states to 42754 states and 139696 transitions. [2019-12-27 22:21:55,955 INFO L78 Accepts]: Start accepts. Automaton has 42754 states and 139696 transitions. Word has length 13 [2019-12-27 22:21:55,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:55,955 INFO L462 AbstractCegarLoop]: Abstraction has 42754 states and 139696 transitions. [2019-12-27 22:21:55,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:21:55,956 INFO L276 IsEmpty]: Start isEmpty. Operand 42754 states and 139696 transitions. [2019-12-27 22:21:55,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 22:21:55,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:55,961 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:55,961 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:55,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:55,961 INFO L82 PathProgramCache]: Analyzing trace with hash -589628414, now seen corresponding path program 1 times [2019-12-27 22:21:55,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:55,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180508901] [2019-12-27 22:21:55,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:56,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:56,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180508901] [2019-12-27 22:21:56,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:56,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:21:56,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [960296250] [2019-12-27 22:21:56,065 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:56,067 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:56,072 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 37 transitions. [2019-12-27 22:21:56,072 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:56,074 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:21:56,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:21:56,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:56,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:21:56,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:21:56,075 INFO L87 Difference]: Start difference. First operand 42754 states and 139696 transitions. Second operand 5 states. [2019-12-27 22:21:57,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:57,048 INFO L93 Difference]: Finished difference Result 57358 states and 183378 transitions. [2019-12-27 22:21:57,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:21:57,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 22:21:57,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:57,142 INFO L225 Difference]: With dead ends: 57358 [2019-12-27 22:21:57,143 INFO L226 Difference]: Without dead ends: 57345 [2019-12-27 22:21:57,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:21:57,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57345 states. [2019-12-27 22:21:57,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57345 to 43244. [2019-12-27 22:21:57,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43244 states. [2019-12-27 22:21:58,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43244 states to 43244 states and 140907 transitions. [2019-12-27 22:21:58,370 INFO L78 Accepts]: Start accepts. Automaton has 43244 states and 140907 transitions. Word has length 19 [2019-12-27 22:21:58,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:58,371 INFO L462 AbstractCegarLoop]: Abstraction has 43244 states and 140907 transitions. [2019-12-27 22:21:58,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:21:58,371 INFO L276 IsEmpty]: Start isEmpty. Operand 43244 states and 140907 transitions. [2019-12-27 22:21:58,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:21:58,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:58,384 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:58,384 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:58,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:58,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1356407650, now seen corresponding path program 1 times [2019-12-27 22:21:58,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:58,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358058419] [2019-12-27 22:21:58,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:58,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:58,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358058419] [2019-12-27 22:21:58,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:58,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:21:58,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1783835173] [2019-12-27 22:21:58,463 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:58,467 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:58,473 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:21:58,473 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:58,474 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:21:58,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:21:58,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:58,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:21:58,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:21:58,475 INFO L87 Difference]: Start difference. First operand 43244 states and 140907 transitions. Second operand 4 states. [2019-12-27 22:21:58,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:58,522 INFO L93 Difference]: Finished difference Result 8037 states and 21818 transitions. [2019-12-27 22:21:58,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:21:58,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 22:21:58,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:58,534 INFO L225 Difference]: With dead ends: 8037 [2019-12-27 22:21:58,534 INFO L226 Difference]: Without dead ends: 8037 [2019-12-27 22:21:58,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:21:58,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8037 states. [2019-12-27 22:21:58,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8037 to 7897. [2019-12-27 22:21:58,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7897 states. [2019-12-27 22:21:58,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7897 states to 7897 states and 21446 transitions. [2019-12-27 22:21:58,659 INFO L78 Accepts]: Start accepts. Automaton has 7897 states and 21446 transitions. Word has length 25 [2019-12-27 22:21:58,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:58,659 INFO L462 AbstractCegarLoop]: Abstraction has 7897 states and 21446 transitions. [2019-12-27 22:21:58,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:21:58,659 INFO L276 IsEmpty]: Start isEmpty. Operand 7897 states and 21446 transitions. [2019-12-27 22:21:58,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 22:21:58,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:58,667 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-27 22:21:58,667 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:58,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:58,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1453764539, now seen corresponding path program 1 times [2019-12-27 22:21:58,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:58,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481087325] [2019-12-27 22:21:58,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:58,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:58,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481087325] [2019-12-27 22:21:58,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:58,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:21:58,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [717144606] [2019-12-27 22:21:58,748 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:58,756 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:58,785 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 92 transitions. [2019-12-27 22:21:58,785 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:58,787 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:21:58,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:21:58,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:58,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:21:58,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:21:58,788 INFO L87 Difference]: Start difference. First operand 7897 states and 21446 transitions. Second operand 5 states. [2019-12-27 22:21:58,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:58,821 INFO L93 Difference]: Finished difference Result 5718 states and 16246 transitions. [2019-12-27 22:21:58,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:21:58,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 22:21:58,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:58,830 INFO L225 Difference]: With dead ends: 5718 [2019-12-27 22:21:58,830 INFO L226 Difference]: Without dead ends: 5314 [2019-12-27 22:21:58,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:21:58,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5314 states. [2019-12-27 22:21:58,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5314 to 4950. [2019-12-27 22:21:58,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4950 states. [2019-12-27 22:21:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4950 states to 4950 states and 14287 transitions. [2019-12-27 22:21:58,902 INFO L78 Accepts]: Start accepts. Automaton has 4950 states and 14287 transitions. Word has length 37 [2019-12-27 22:21:58,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:58,902 INFO L462 AbstractCegarLoop]: Abstraction has 4950 states and 14287 transitions. [2019-12-27 22:21:58,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:21:58,902 INFO L276 IsEmpty]: Start isEmpty. Operand 4950 states and 14287 transitions. [2019-12-27 22:21:58,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:21:58,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:58,913 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:58,913 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:58,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:58,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1228802019, now seen corresponding path program 1 times [2019-12-27 22:21:58,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:58,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008220614] [2019-12-27 22:21:58,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:58,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:58,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008220614] [2019-12-27 22:21:58,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:58,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:21:58,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [552521217] [2019-12-27 22:21:58,989 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:59,009 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:59,140 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 222 states and 403 transitions. [2019-12-27 22:21:59,140 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:59,141 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:21:59,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:21:59,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:59,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:21:59,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:21:59,143 INFO L87 Difference]: Start difference. First operand 4950 states and 14287 transitions. Second operand 3 states. [2019-12-27 22:21:59,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:59,199 INFO L93 Difference]: Finished difference Result 4959 states and 14296 transitions. [2019-12-27 22:21:59,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:21:59,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 22:21:59,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:59,207 INFO L225 Difference]: With dead ends: 4959 [2019-12-27 22:21:59,208 INFO L226 Difference]: Without dead ends: 4959 [2019-12-27 22:21:59,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:21:59,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4959 states. [2019-12-27 22:21:59,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4959 to 4955. [2019-12-27 22:21:59,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4955 states. [2019-12-27 22:21:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 14292 transitions. [2019-12-27 22:21:59,271 INFO L78 Accepts]: Start accepts. Automaton has 4955 states and 14292 transitions. Word has length 65 [2019-12-27 22:21:59,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:59,271 INFO L462 AbstractCegarLoop]: Abstraction has 4955 states and 14292 transitions. [2019-12-27 22:21:59,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:21:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand 4955 states and 14292 transitions. [2019-12-27 22:21:59,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:21:59,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:59,278 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:59,278 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:59,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:59,278 INFO L82 PathProgramCache]: Analyzing trace with hash 320653868, now seen corresponding path program 1 times [2019-12-27 22:21:59,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:59,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778861603] [2019-12-27 22:21:59,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:59,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:59,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778861603] [2019-12-27 22:21:59,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:59,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:21:59,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [447991358] [2019-12-27 22:21:59,394 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:59,416 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:59,631 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 222 states and 403 transitions. [2019-12-27 22:21:59,632 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:59,858 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 22:21:59,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:21:59,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:59,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:21:59,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:21:59,859 INFO L87 Difference]: Start difference. First operand 4955 states and 14292 transitions. Second operand 10 states. [2019-12-27 22:22:00,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:00,467 INFO L93 Difference]: Finished difference Result 7546 states and 21557 transitions. [2019-12-27 22:22:00,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:22:00,468 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 22:22:00,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:00,480 INFO L225 Difference]: With dead ends: 7546 [2019-12-27 22:22:00,480 INFO L226 Difference]: Without dead ends: 7546 [2019-12-27 22:22:00,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:22:00,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7546 states. [2019-12-27 22:22:00,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7546 to 6352. [2019-12-27 22:22:00,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6352 states. [2019-12-27 22:22:00,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6352 states to 6352 states and 18327 transitions. [2019-12-27 22:22:00,673 INFO L78 Accepts]: Start accepts. Automaton has 6352 states and 18327 transitions. Word has length 65 [2019-12-27 22:22:00,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:00,673 INFO L462 AbstractCegarLoop]: Abstraction has 6352 states and 18327 transitions. [2019-12-27 22:22:00,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:22:00,674 INFO L276 IsEmpty]: Start isEmpty. Operand 6352 states and 18327 transitions. [2019-12-27 22:22:00,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:22:00,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:00,682 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:00,683 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:00,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:00,683 INFO L82 PathProgramCache]: Analyzing trace with hash -2108512596, now seen corresponding path program 2 times [2019-12-27 22:22:00,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:00,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147158703] [2019-12-27 22:22:00,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:00,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147158703] [2019-12-27 22:22:00,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:00,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:22:00,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [89164455] [2019-12-27 22:22:00,790 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:00,810 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:00,955 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 357 transitions. [2019-12-27 22:22:00,955 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:00,970 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 22:22:00,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:22:00,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:00,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:22:00,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:22:00,971 INFO L87 Difference]: Start difference. First operand 6352 states and 18327 transitions. Second operand 5 states. [2019-12-27 22:22:01,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:01,298 INFO L93 Difference]: Finished difference Result 9350 states and 26643 transitions. [2019-12-27 22:22:01,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:22:01,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 22:22:01,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:01,311 INFO L225 Difference]: With dead ends: 9350 [2019-12-27 22:22:01,311 INFO L226 Difference]: Without dead ends: 9350 [2019-12-27 22:22:01,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:22:01,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9350 states. [2019-12-27 22:22:01,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9350 to 7014. [2019-12-27 22:22:01,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7014 states. [2019-12-27 22:22:01,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7014 states to 7014 states and 20305 transitions. [2019-12-27 22:22:01,417 INFO L78 Accepts]: Start accepts. Automaton has 7014 states and 20305 transitions. Word has length 65 [2019-12-27 22:22:01,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:01,418 INFO L462 AbstractCegarLoop]: Abstraction has 7014 states and 20305 transitions. [2019-12-27 22:22:01,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:22:01,418 INFO L276 IsEmpty]: Start isEmpty. Operand 7014 states and 20305 transitions. [2019-12-27 22:22:01,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:22:01,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:01,431 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:01,431 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:01,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:01,432 INFO L82 PathProgramCache]: Analyzing trace with hash 27480750, now seen corresponding path program 3 times [2019-12-27 22:22:01,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:01,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817206443] [2019-12-27 22:22:01,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:01,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:01,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817206443] [2019-12-27 22:22:01,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:01,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:22:01,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [34947573] [2019-12-27 22:22:01,528 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:01,548 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:01,644 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 310 transitions. [2019-12-27 22:22:01,644 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:01,754 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 22:22:01,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:22:01,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:01,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:22:01,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:22:01,755 INFO L87 Difference]: Start difference. First operand 7014 states and 20305 transitions. Second operand 11 states. [2019-12-27 22:22:03,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:03,860 INFO L93 Difference]: Finished difference Result 17056 states and 48283 transitions. [2019-12-27 22:22:03,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 22:22:03,860 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 22:22:03,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:03,880 INFO L225 Difference]: With dead ends: 17056 [2019-12-27 22:22:03,880 INFO L226 Difference]: Without dead ends: 17056 [2019-12-27 22:22:03,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2019-12-27 22:22:03,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17056 states. [2019-12-27 22:22:04,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17056 to 7595. [2019-12-27 22:22:04,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7595 states. [2019-12-27 22:22:04,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7595 states to 7595 states and 22075 transitions. [2019-12-27 22:22:04,178 INFO L78 Accepts]: Start accepts. Automaton has 7595 states and 22075 transitions. Word has length 65 [2019-12-27 22:22:04,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:04,178 INFO L462 AbstractCegarLoop]: Abstraction has 7595 states and 22075 transitions. [2019-12-27 22:22:04,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:22:04,179 INFO L276 IsEmpty]: Start isEmpty. Operand 7595 states and 22075 transitions. [2019-12-27 22:22:04,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:22:04,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:04,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:04,190 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:04,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:04,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1465472054, now seen corresponding path program 4 times [2019-12-27 22:22:04,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:04,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006400499] [2019-12-27 22:22:04,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:04,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:04,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006400499] [2019-12-27 22:22:04,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:04,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:22:04,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1933159626] [2019-12-27 22:22:04,340 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:04,392 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:04,570 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 211 states and 385 transitions. [2019-12-27 22:22:04,570 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:04,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:04,685 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 22:22:04,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:22:04,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:04,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:22:04,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:22:04,686 INFO L87 Difference]: Start difference. First operand 7595 states and 22075 transitions. Second operand 11 states. [2019-12-27 22:22:05,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:05,938 INFO L93 Difference]: Finished difference Result 11054 states and 31530 transitions. [2019-12-27 22:22:05,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 22:22:05,939 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 22:22:05,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:05,954 INFO L225 Difference]: With dead ends: 11054 [2019-12-27 22:22:05,954 INFO L226 Difference]: Without dead ends: 11054 [2019-12-27 22:22:05,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-12-27 22:22:05,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11054 states. [2019-12-27 22:22:06,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11054 to 8020. [2019-12-27 22:22:06,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8020 states. [2019-12-27 22:22:06,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8020 states to 8020 states and 23273 transitions. [2019-12-27 22:22:06,086 INFO L78 Accepts]: Start accepts. Automaton has 8020 states and 23273 transitions. Word has length 65 [2019-12-27 22:22:06,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:06,086 INFO L462 AbstractCegarLoop]: Abstraction has 8020 states and 23273 transitions. [2019-12-27 22:22:06,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:22:06,086 INFO L276 IsEmpty]: Start isEmpty. Operand 8020 states and 23273 transitions. [2019-12-27 22:22:06,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:22:06,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:06,097 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:06,097 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:06,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:06,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1501839526, now seen corresponding path program 5 times [2019-12-27 22:22:06,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:06,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047916366] [2019-12-27 22:22:06,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:06,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:06,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047916366] [2019-12-27 22:22:06,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:06,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:22:06,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1719536342] [2019-12-27 22:22:06,210 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:06,229 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:06,369 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 387 transitions. [2019-12-27 22:22:06,369 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:06,483 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 22:22:06,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 22:22:06,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:06,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 22:22:06,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:22:06,485 INFO L87 Difference]: Start difference. First operand 8020 states and 23273 transitions. Second operand 12 states. [2019-12-27 22:22:09,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:09,190 INFO L93 Difference]: Finished difference Result 18148 states and 51325 transitions. [2019-12-27 22:22:09,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 22:22:09,190 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 22:22:09,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:09,225 INFO L225 Difference]: With dead ends: 18148 [2019-12-27 22:22:09,226 INFO L226 Difference]: Without dead ends: 18148 [2019-12-27 22:22:09,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=452, Invalid=1528, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 22:22:09,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18148 states. [2019-12-27 22:22:09,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18148 to 7647. [2019-12-27 22:22:09,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7647 states. [2019-12-27 22:22:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7647 states to 7647 states and 22192 transitions. [2019-12-27 22:22:09,537 INFO L78 Accepts]: Start accepts. Automaton has 7647 states and 22192 transitions. Word has length 65 [2019-12-27 22:22:09,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:09,538 INFO L462 AbstractCegarLoop]: Abstraction has 7647 states and 22192 transitions. [2019-12-27 22:22:09,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 22:22:09,538 INFO L276 IsEmpty]: Start isEmpty. Operand 7647 states and 22192 transitions. [2019-12-27 22:22:09,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:22:09,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:09,555 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:09,556 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:09,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:09,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1065820274, now seen corresponding path program 6 times [2019-12-27 22:22:09,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:09,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721649485] [2019-12-27 22:22:09,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:09,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:09,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721649485] [2019-12-27 22:22:09,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:09,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:22:09,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1796410224] [2019-12-27 22:22:09,715 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:09,735 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:09,900 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 370 transitions. [2019-12-27 22:22:09,900 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:10,007 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 22:22:10,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:22:10,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:10,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:22:10,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:22:10,008 INFO L87 Difference]: Start difference. First operand 7647 states and 22192 transitions. Second operand 10 states. [2019-12-27 22:22:11,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:11,352 INFO L93 Difference]: Finished difference Result 12314 states and 35032 transitions. [2019-12-27 22:22:11,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 22:22:11,353 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 22:22:11,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:11,369 INFO L225 Difference]: With dead ends: 12314 [2019-12-27 22:22:11,370 INFO L226 Difference]: Without dead ends: 12314 [2019-12-27 22:22:11,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-12-27 22:22:11,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12314 states. [2019-12-27 22:22:11,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12314 to 8167. [2019-12-27 22:22:11,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8167 states. [2019-12-27 22:22:11,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8167 states to 8167 states and 23701 transitions. [2019-12-27 22:22:11,505 INFO L78 Accepts]: Start accepts. Automaton has 8167 states and 23701 transitions. Word has length 65 [2019-12-27 22:22:11,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:11,505 INFO L462 AbstractCegarLoop]: Abstraction has 8167 states and 23701 transitions. [2019-12-27 22:22:11,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:22:11,505 INFO L276 IsEmpty]: Start isEmpty. Operand 8167 states and 23701 transitions. [2019-12-27 22:22:11,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:22:11,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:11,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:11,513 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:11,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:11,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1998682062, now seen corresponding path program 7 times [2019-12-27 22:22:11,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:11,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396499787] [2019-12-27 22:22:11,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:11,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-27 22:22:11,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396499787] [2019-12-27 22:22:11,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:11,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 22:22:11,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1151115183] [2019-12-27 22:22:11,646 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:11,664 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:11,949 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 206 states and 375 transitions. [2019-12-27 22:22:11,949 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:12,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:12,260 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 22:22:12,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 22:22:12,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:12,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 22:22:12,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-12-27 22:22:12,261 INFO L87 Difference]: Start difference. First operand 8167 states and 23701 transitions. Second operand 16 states. [2019-12-27 22:22:18,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:18,285 INFO L93 Difference]: Finished difference Result 22796 states and 64431 transitions. [2019-12-27 22:22:18,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-12-27 22:22:18,285 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2019-12-27 22:22:18,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:18,313 INFO L225 Difference]: With dead ends: 22796 [2019-12-27 22:22:18,313 INFO L226 Difference]: Without dead ends: 22796 [2019-12-27 22:22:18,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 59 SyntacticMatches, 8 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2416 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1353, Invalid=5619, Unknown=0, NotChecked=0, Total=6972 [2019-12-27 22:22:18,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22796 states. [2019-12-27 22:22:18,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22796 to 8072. [2019-12-27 22:22:18,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2019-12-27 22:22:18,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 23454 transitions. [2019-12-27 22:22:18,640 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 23454 transitions. Word has length 65 [2019-12-27 22:22:18,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:18,640 INFO L462 AbstractCegarLoop]: Abstraction has 8072 states and 23454 transitions. [2019-12-27 22:22:18,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 22:22:18,640 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 23454 transitions. [2019-12-27 22:22:18,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:22:18,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:18,649 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:18,650 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:18,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:18,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1274457040, now seen corresponding path program 8 times [2019-12-27 22:22:18,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:18,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582409970] [2019-12-27 22:22:18,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:18,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:18,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582409970] [2019-12-27 22:22:18,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:18,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:22:18,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [737039322] [2019-12-27 22:22:18,768 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:18,786 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:18,923 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 208 states and 363 transitions. [2019-12-27 22:22:18,923 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:19,035 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 22:22:19,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 22:22:19,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:19,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 22:22:19,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:22:19,037 INFO L87 Difference]: Start difference. First operand 8072 states and 23454 transitions. Second operand 12 states. [2019-12-27 22:22:20,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:20,702 INFO L93 Difference]: Finished difference Result 18915 states and 53416 transitions. [2019-12-27 22:22:20,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 22:22:20,702 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-27 22:22:20,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:20,725 INFO L225 Difference]: With dead ends: 18915 [2019-12-27 22:22:20,725 INFO L226 Difference]: Without dead ends: 18915 [2019-12-27 22:22:20,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=477, Unknown=0, NotChecked=0, Total=650 [2019-12-27 22:22:20,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18915 states. [2019-12-27 22:22:20,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18915 to 8079. [2019-12-27 22:22:20,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8079 states. [2019-12-27 22:22:20,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8079 states to 8079 states and 23449 transitions. [2019-12-27 22:22:20,900 INFO L78 Accepts]: Start accepts. Automaton has 8079 states and 23449 transitions. Word has length 65 [2019-12-27 22:22:20,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:20,900 INFO L462 AbstractCegarLoop]: Abstraction has 8079 states and 23449 transitions. [2019-12-27 22:22:20,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 22:22:20,900 INFO L276 IsEmpty]: Start isEmpty. Operand 8079 states and 23449 transitions. [2019-12-27 22:22:20,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:22:20,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:20,908 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:20,908 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:20,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:20,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1606610384, now seen corresponding path program 9 times [2019-12-27 22:22:20,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:20,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810776689] [2019-12-27 22:22:20,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:21,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:21,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810776689] [2019-12-27 22:22:21,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:21,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 22:22:21,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [377075484] [2019-12-27 22:22:21,071 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:21,091 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:21,242 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 330 transitions. [2019-12-27 22:22:21,243 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:21,376 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 22:22:21,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:22:21,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:21,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:22:21,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:22:21,378 INFO L87 Difference]: Start difference. First operand 8079 states and 23449 transitions. Second operand 15 states. [2019-12-27 22:22:24,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:24,869 INFO L93 Difference]: Finished difference Result 19679 states and 55525 transitions. [2019-12-27 22:22:24,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 22:22:24,869 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2019-12-27 22:22:24,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:24,893 INFO L225 Difference]: With dead ends: 19679 [2019-12-27 22:22:24,893 INFO L226 Difference]: Without dead ends: 19679 [2019-12-27 22:22:24,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=534, Invalid=2016, Unknown=0, NotChecked=0, Total=2550 [2019-12-27 22:22:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19679 states. [2019-12-27 22:22:25,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19679 to 7673. [2019-12-27 22:22:25,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7673 states. [2019-12-27 22:22:25,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7673 states to 7673 states and 22282 transitions. [2019-12-27 22:22:25,077 INFO L78 Accepts]: Start accepts. Automaton has 7673 states and 22282 transitions. Word has length 65 [2019-12-27 22:22:25,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:25,077 INFO L462 AbstractCegarLoop]: Abstraction has 7673 states and 22282 transitions. [2019-12-27 22:22:25,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 22:22:25,077 INFO L276 IsEmpty]: Start isEmpty. Operand 7673 states and 22282 transitions. [2019-12-27 22:22:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:22:25,085 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:25,085 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:25,085 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:25,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:25,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1342092924, now seen corresponding path program 10 times [2019-12-27 22:22:25,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:25,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522204288] [2019-12-27 22:22:25,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:25,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:25,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522204288] [2019-12-27 22:22:25,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:25,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:22:25,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [267044573] [2019-12-27 22:22:25,217 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:25,235 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:25,377 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 180 states and 312 transitions. [2019-12-27 22:22:25,378 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:25,546 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 22:22:25,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 22:22:25,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:25,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 22:22:25,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-12-27 22:22:25,548 INFO L87 Difference]: Start difference. First operand 7673 states and 22282 transitions. Second operand 16 states. [2019-12-27 22:22:31,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:31,418 INFO L93 Difference]: Finished difference Result 23813 states and 67263 transitions. [2019-12-27 22:22:31,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-27 22:22:31,418 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2019-12-27 22:22:31,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:31,446 INFO L225 Difference]: With dead ends: 23813 [2019-12-27 22:22:31,446 INFO L226 Difference]: Without dead ends: 23813 [2019-12-27 22:22:31,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1417 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=977, Invalid=3715, Unknown=0, NotChecked=0, Total=4692 [2019-12-27 22:22:31,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23813 states. [2019-12-27 22:22:31,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23813 to 6931. [2019-12-27 22:22:31,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6931 states. [2019-12-27 22:22:31,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6931 states to 6931 states and 20179 transitions. [2019-12-27 22:22:31,646 INFO L78 Accepts]: Start accepts. Automaton has 6931 states and 20179 transitions. Word has length 65 [2019-12-27 22:22:31,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:31,647 INFO L462 AbstractCegarLoop]: Abstraction has 6931 states and 20179 transitions. [2019-12-27 22:22:31,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 22:22:31,647 INFO L276 IsEmpty]: Start isEmpty. Operand 6931 states and 20179 transitions. [2019-12-27 22:22:31,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:22:31,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:31,654 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:31,654 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:31,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:31,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1033843558, now seen corresponding path program 1 times [2019-12-27 22:22:31,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:31,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830208632] [2019-12-27 22:22:31,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:31,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:31,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830208632] [2019-12-27 22:22:31,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:31,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:22:31,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1960815097] [2019-12-27 22:22:31,714 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:31,733 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:31,875 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 207 states and 369 transitions. [2019-12-27 22:22:31,875 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:31,876 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:22:31,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:22:31,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:31,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:22:31,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:22:31,877 INFO L87 Difference]: Start difference. First operand 6931 states and 20179 transitions. Second operand 3 states. [2019-12-27 22:22:31,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:31,940 INFO L93 Difference]: Finished difference Result 6930 states and 20177 transitions. [2019-12-27 22:22:31,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:22:31,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 22:22:31,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:31,951 INFO L225 Difference]: With dead ends: 6930 [2019-12-27 22:22:31,951 INFO L226 Difference]: Without dead ends: 6930 [2019-12-27 22:22:31,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:22:31,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6930 states. [2019-12-27 22:22:32,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6930 to 4639. [2019-12-27 22:22:32,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4639 states. [2019-12-27 22:22:32,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4639 states to 4639 states and 13737 transitions. [2019-12-27 22:22:32,031 INFO L78 Accepts]: Start accepts. Automaton has 4639 states and 13737 transitions. Word has length 66 [2019-12-27 22:22:32,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:32,031 INFO L462 AbstractCegarLoop]: Abstraction has 4639 states and 13737 transitions. [2019-12-27 22:22:32,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:22:32,031 INFO L276 IsEmpty]: Start isEmpty. Operand 4639 states and 13737 transitions. [2019-12-27 22:22:32,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:22:32,038 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:32,038 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:32,038 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:32,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:32,038 INFO L82 PathProgramCache]: Analyzing trace with hash 891199558, now seen corresponding path program 1 times [2019-12-27 22:22:32,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:32,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302790728] [2019-12-27 22:22:32,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:32,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:32,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302790728] [2019-12-27 22:22:32,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:32,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:22:32,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1343804516] [2019-12-27 22:22:32,149 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:32,167 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:32,432 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 207 states and 369 transitions. [2019-12-27 22:22:32,432 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:32,478 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 22:22:32,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:22:32,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:32,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:22:32,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:22:32,479 INFO L87 Difference]: Start difference. First operand 4639 states and 13737 transitions. Second operand 10 states. [2019-12-27 22:22:33,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:33,263 INFO L93 Difference]: Finished difference Result 13365 states and 39875 transitions. [2019-12-27 22:22:33,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 22:22:33,264 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-27 22:22:33,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:33,278 INFO L225 Difference]: With dead ends: 13365 [2019-12-27 22:22:33,279 INFO L226 Difference]: Without dead ends: 9967 [2019-12-27 22:22:33,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-12-27 22:22:33,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9967 states. [2019-12-27 22:22:33,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9967 to 4263. [2019-12-27 22:22:33,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4263 states. [2019-12-27 22:22:33,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 12616 transitions. [2019-12-27 22:22:33,377 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 12616 transitions. Word has length 66 [2019-12-27 22:22:33,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:33,377 INFO L462 AbstractCegarLoop]: Abstraction has 4263 states and 12616 transitions. [2019-12-27 22:22:33,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:22:33,378 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 12616 transitions. [2019-12-27 22:22:33,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:22:33,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:33,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:33,382 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:33,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:33,383 INFO L82 PathProgramCache]: Analyzing trace with hash 709972618, now seen corresponding path program 2 times [2019-12-27 22:22:33,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:33,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864665776] [2019-12-27 22:22:33,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:33,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:33,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864665776] [2019-12-27 22:22:33,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:33,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:22:33,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [763526276] [2019-12-27 22:22:33,450 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:33,468 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:33,613 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 222 states and 407 transitions. [2019-12-27 22:22:33,613 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:33,623 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:22:33,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:22:33,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:33,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:22:33,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:22:33,625 INFO L87 Difference]: Start difference. First operand 4263 states and 12616 transitions. Second operand 4 states. [2019-12-27 22:22:33,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:33,765 INFO L93 Difference]: Finished difference Result 5356 states and 15252 transitions. [2019-12-27 22:22:33,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:22:33,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 22:22:33,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:33,774 INFO L225 Difference]: With dead ends: 5356 [2019-12-27 22:22:33,774 INFO L226 Difference]: Without dead ends: 5356 [2019-12-27 22:22:33,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:22:33,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5356 states. [2019-12-27 22:22:33,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5356 to 3293. [2019-12-27 22:22:33,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3293 states. [2019-12-27 22:22:33,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3293 states to 3293 states and 9556 transitions. [2019-12-27 22:22:33,831 INFO L78 Accepts]: Start accepts. Automaton has 3293 states and 9556 transitions. Word has length 66 [2019-12-27 22:22:33,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:33,831 INFO L462 AbstractCegarLoop]: Abstraction has 3293 states and 9556 transitions. [2019-12-27 22:22:33,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:22:33,831 INFO L276 IsEmpty]: Start isEmpty. Operand 3293 states and 9556 transitions. [2019-12-27 22:22:33,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:22:33,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:33,835 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:33,835 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:33,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:33,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1990304176, now seen corresponding path program 1 times [2019-12-27 22:22:33,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:33,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866073619] [2019-12-27 22:22:33,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:34,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:34,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866073619] [2019-12-27 22:22:34,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:34,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 22:22:34,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [961917511] [2019-12-27 22:22:34,010 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:34,029 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:34,294 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 249 states and 475 transitions. [2019-12-27 22:22:34,295 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:34,582 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 22:22:34,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:22:34,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:34,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:22:34,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:22:34,584 INFO L87 Difference]: Start difference. First operand 3293 states and 9556 transitions. Second operand 15 states. [2019-12-27 22:22:36,416 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2019-12-27 22:22:37,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:37,968 INFO L93 Difference]: Finished difference Result 12175 states and 34266 transitions. [2019-12-27 22:22:37,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 22:22:37,969 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 22:22:37,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:37,985 INFO L225 Difference]: With dead ends: 12175 [2019-12-27 22:22:37,985 INFO L226 Difference]: Without dead ends: 12143 [2019-12-27 22:22:37,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 8 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=423, Invalid=2229, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 22:22:38,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12143 states. [2019-12-27 22:22:38,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12143 to 4466. [2019-12-27 22:22:38,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4466 states. [2019-12-27 22:22:38,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4466 states to 4466 states and 12826 transitions. [2019-12-27 22:22:38,090 INFO L78 Accepts]: Start accepts. Automaton has 4466 states and 12826 transitions. Word has length 67 [2019-12-27 22:22:38,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:38,090 INFO L462 AbstractCegarLoop]: Abstraction has 4466 states and 12826 transitions. [2019-12-27 22:22:38,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 22:22:38,090 INFO L276 IsEmpty]: Start isEmpty. Operand 4466 states and 12826 transitions. [2019-12-27 22:22:38,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:22:38,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:38,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:38,094 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:38,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:38,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1039202198, now seen corresponding path program 2 times [2019-12-27 22:22:38,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:38,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860332863] [2019-12-27 22:22:38,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:38,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860332863] [2019-12-27 22:22:38,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:38,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:22:38,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1418942522] [2019-12-27 22:22:38,146 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:38,167 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:38,317 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 239 states and 433 transitions. [2019-12-27 22:22:38,317 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:38,438 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 22:22:38,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:22:38,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:38,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:22:38,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:22:38,439 INFO L87 Difference]: Start difference. First operand 4466 states and 12826 transitions. Second operand 8 states. [2019-12-27 22:22:38,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:38,629 INFO L93 Difference]: Finished difference Result 5774 states and 15955 transitions. [2019-12-27 22:22:38,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:22:38,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-27 22:22:38,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:38,638 INFO L225 Difference]: With dead ends: 5774 [2019-12-27 22:22:38,638 INFO L226 Difference]: Without dead ends: 5774 [2019-12-27 22:22:38,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:22:38,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5774 states. [2019-12-27 22:22:38,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5774 to 3952. [2019-12-27 22:22:38,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3952 states. [2019-12-27 22:22:38,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 11078 transitions. [2019-12-27 22:22:38,701 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 11078 transitions. Word has length 67 [2019-12-27 22:22:38,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:38,702 INFO L462 AbstractCegarLoop]: Abstraction has 3952 states and 11078 transitions. [2019-12-27 22:22:38,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:22:38,702 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 11078 transitions. [2019-12-27 22:22:38,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:22:38,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:38,705 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:38,705 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:38,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:38,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1307128750, now seen corresponding path program 1 times [2019-12-27 22:22:38,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:38,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279358208] [2019-12-27 22:22:38,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:38,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:38,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279358208] [2019-12-27 22:22:38,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:38,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 22:22:38,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1640179377] [2019-12-27 22:22:38,877 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:38,896 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:39,119 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 271 states and 538 transitions. [2019-12-27 22:22:39,119 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:39,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:39,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:39,466 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 30 times. [2019-12-27 22:22:39,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 22:22:39,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:39,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 22:22:39,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-27 22:22:39,467 INFO L87 Difference]: Start difference. First operand 3952 states and 11078 transitions. Second operand 17 states. [2019-12-27 22:22:40,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:40,287 INFO L93 Difference]: Finished difference Result 5865 states and 16345 transitions. [2019-12-27 22:22:40,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 22:22:40,288 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2019-12-27 22:22:40,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:40,296 INFO L225 Difference]: With dead ends: 5865 [2019-12-27 22:22:40,296 INFO L226 Difference]: Without dead ends: 5833 [2019-12-27 22:22:40,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 11 SyntacticMatches, 15 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2019-12-27 22:22:40,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5833 states. [2019-12-27 22:22:40,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5833 to 3948. [2019-12-27 22:22:40,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2019-12-27 22:22:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 11039 transitions. [2019-12-27 22:22:40,358 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 11039 transitions. Word has length 68 [2019-12-27 22:22:40,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:40,359 INFO L462 AbstractCegarLoop]: Abstraction has 3948 states and 11039 transitions. [2019-12-27 22:22:40,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 22:22:40,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 11039 transitions. [2019-12-27 22:22:40,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:22:40,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:40,362 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:40,362 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:40,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:40,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1086450056, now seen corresponding path program 2 times [2019-12-27 22:22:40,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:40,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120070286] [2019-12-27 22:22:40,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:40,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:40,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120070286] [2019-12-27 22:22:40,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:40,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 22:22:40,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1295457064] [2019-12-27 22:22:40,643 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:40,669 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:40,957 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 271 states and 522 transitions. [2019-12-27 22:22:40,958 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:41,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:41,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:41,397 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 22:22:41,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 22:22:41,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:41,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 22:22:41,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-12-27 22:22:41,398 INFO L87 Difference]: Start difference. First operand 3948 states and 11039 transitions. Second operand 20 states. [2019-12-27 22:22:42,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:42,491 INFO L93 Difference]: Finished difference Result 7046 states and 19795 transitions. [2019-12-27 22:22:42,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 22:22:42,491 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2019-12-27 22:22:42,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:42,501 INFO L225 Difference]: With dead ends: 7046 [2019-12-27 22:22:42,501 INFO L226 Difference]: Without dead ends: 7014 [2019-12-27 22:22:42,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 9 SyntacticMatches, 14 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=208, Invalid=914, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 22:22:42,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7014 states. [2019-12-27 22:22:42,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7014 to 4160. [2019-12-27 22:22:42,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4160 states. [2019-12-27 22:22:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4160 states to 4160 states and 11656 transitions. [2019-12-27 22:22:42,570 INFO L78 Accepts]: Start accepts. Automaton has 4160 states and 11656 transitions. Word has length 68 [2019-12-27 22:22:42,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:42,571 INFO L462 AbstractCegarLoop]: Abstraction has 4160 states and 11656 transitions. [2019-12-27 22:22:42,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 22:22:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 4160 states and 11656 transitions. [2019-12-27 22:22:42,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:22:42,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:42,574 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:42,574 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:42,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:42,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1871389806, now seen corresponding path program 3 times [2019-12-27 22:22:42,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:42,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559149677] [2019-12-27 22:22:42,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:42,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:42,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559149677] [2019-12-27 22:22:42,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:42,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 22:22:42,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [978007729] [2019-12-27 22:22:42,906 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:42,923 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:43,189 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 279 states and 548 transitions. [2019-12-27 22:22:43,189 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:44,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:44,103 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 38 times. [2019-12-27 22:22:44,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 22:22:44,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:44,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 22:22:44,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-12-27 22:22:44,104 INFO L87 Difference]: Start difference. First operand 4160 states and 11656 transitions. Second operand 22 states. [2019-12-27 22:22:46,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:46,269 INFO L93 Difference]: Finished difference Result 7121 states and 19674 transitions. [2019-12-27 22:22:46,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 22:22:46,269 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2019-12-27 22:22:46,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:46,279 INFO L225 Difference]: With dead ends: 7121 [2019-12-27 22:22:46,279 INFO L226 Difference]: Without dead ends: 7089 [2019-12-27 22:22:46,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 13 SyntacticMatches, 21 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=481, Invalid=1871, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 22:22:46,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7089 states. [2019-12-27 22:22:46,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7089 to 4468. [2019-12-27 22:22:46,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4468 states. [2019-12-27 22:22:46,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4468 states to 4468 states and 12519 transitions. [2019-12-27 22:22:46,353 INFO L78 Accepts]: Start accepts. Automaton has 4468 states and 12519 transitions. Word has length 68 [2019-12-27 22:22:46,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:46,353 INFO L462 AbstractCegarLoop]: Abstraction has 4468 states and 12519 transitions. [2019-12-27 22:22:46,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 22:22:46,353 INFO L276 IsEmpty]: Start isEmpty. Operand 4468 states and 12519 transitions. [2019-12-27 22:22:46,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:22:46,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:46,357 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:46,358 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:46,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:46,358 INFO L82 PathProgramCache]: Analyzing trace with hash 768786536, now seen corresponding path program 4 times [2019-12-27 22:22:46,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:46,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309563136] [2019-12-27 22:22:46,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:46,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:46,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309563136] [2019-12-27 22:22:46,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:46,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 22:22:46,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [374652023] [2019-12-27 22:22:46,752 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:46,775 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:47,017 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 267 states and 529 transitions. [2019-12-27 22:22:47,018 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:47,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:47,671 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 41 times. [2019-12-27 22:22:47,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 22:22:47,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:47,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 22:22:47,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-12-27 22:22:47,672 INFO L87 Difference]: Start difference. First operand 4468 states and 12519 transitions. Second operand 22 states. [2019-12-27 22:22:49,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:49,862 INFO L93 Difference]: Finished difference Result 8518 states and 23935 transitions. [2019-12-27 22:22:49,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 22:22:49,862 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2019-12-27 22:22:49,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:49,873 INFO L225 Difference]: With dead ends: 8518 [2019-12-27 22:22:49,873 INFO L226 Difference]: Without dead ends: 8486 [2019-12-27 22:22:49,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 17 SyntacticMatches, 20 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=378, Invalid=1602, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 22:22:49,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8486 states. [2019-12-27 22:22:49,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8486 to 4561. [2019-12-27 22:22:49,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4561 states. [2019-12-27 22:22:49,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4561 states to 4561 states and 12796 transitions. [2019-12-27 22:22:49,951 INFO L78 Accepts]: Start accepts. Automaton has 4561 states and 12796 transitions. Word has length 68 [2019-12-27 22:22:49,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:49,951 INFO L462 AbstractCegarLoop]: Abstraction has 4561 states and 12796 transitions. [2019-12-27 22:22:49,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 22:22:49,951 INFO L276 IsEmpty]: Start isEmpty. Operand 4561 states and 12796 transitions. [2019-12-27 22:22:49,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:22:49,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:49,955 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:49,955 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:49,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:49,956 INFO L82 PathProgramCache]: Analyzing trace with hash 158566424, now seen corresponding path program 5 times [2019-12-27 22:22:49,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:49,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278180509] [2019-12-27 22:22:49,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:22:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:22:50,067 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:22:50,068 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:22:50,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] ULTIMATE.startENTRY-->L807: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1967~0.base_22| 1)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1967~0.base_22| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1967~0.base_22|) |v_ULTIMATE.start_main_~#t1967~0.offset_16| 0)) |v_#memory_int_21|) (= 0 |v_ULTIMATE.start_main_~#t1967~0.offset_16|) (= v_~z$r_buff0_thd3~0_20 0) (= |v_#NULL.offset_3| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1967~0.base_22| 4)) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~__unbuffered_cnt~0_21) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z$flush_delayed~0_15) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~z$r_buff1_thd2~0_16) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff0_thd1~0_25 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1967~0.base_22|) (= 0 v_~y~0_8) (= 0 |v_#NULL.base_3|) (= 0 v_~z$w_buff0~0_28) (= 0 v_~z$r_buff1_thd1~0_19) (= v_~z$r_buff0_thd0~0_77 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1967~0.base_22|)) (= 0 v_~z$w_buff1_used~0_69) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~z$r_buff1_thd0~0_46) (= v_~z~0_29 0) (= 0 v_~z$w_buff1~0_26) (= 0 v_~z$r_buff1_thd3~0_17) (= v_~z$w_buff0_used~0_116 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_7|, ULTIMATE.start_main_~#t1967~0.offset=|v_ULTIMATE.start_main_~#t1967~0.offset_16|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_11|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_14|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_9|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_12|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_14|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_77, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_8|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_15, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_11|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ULTIMATE.start_main_~#t1969~0.base=|v_ULTIMATE.start_main_~#t1969~0.base_19|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_7|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_11|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_9|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ULTIMATE.start_main_~#t1968~0.offset=|v_ULTIMATE.start_main_~#t1968~0.offset_15|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_46, ULTIMATE.start_main_~#t1968~0.base=|v_ULTIMATE.start_main_~#t1968~0.base_20|, ~y~0=v_~y~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_7|, ULTIMATE.start_main_~#t1967~0.base=|v_ULTIMATE.start_main_~#t1967~0.base_22|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_28, ULTIMATE.start_main_~#t1969~0.offset=|v_ULTIMATE.start_main_~#t1969~0.offset_15|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_11|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_11|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_29, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_~#t1967~0.offset, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1969~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1968~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1968~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1967~0.base, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t1969~0.offset, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 22:22:50,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L807-1-->L809: Formula: (and (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1968~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t1968~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1968~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1968~0.base_11| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1968~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1968~0.base_11|) |v_ULTIMATE.start_main_~#t1968~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1968~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1968~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1968~0.offset=|v_ULTIMATE.start_main_~#t1968~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1968~0.base=|v_ULTIMATE.start_main_~#t1968~0.base_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1968~0.offset, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, ULTIMATE.start_main_~#t1968~0.base, #length] because there is no mapped edge [2019-12-27 22:22:50,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_17 v_~z$w_buff1~0_16) (= (mod v_~z$w_buff1_used~0_56 256) 0) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= 2 v_~z$w_buff0~0_16) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= v_~z$w_buff0_used~0_89 1) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|) (= v_~z$w_buff0_used~0_90 v_~z$w_buff1_used~0_56)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_17, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_56, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~z$w_buff1~0=v_~z$w_buff1~0_16, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 22:22:50,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-1-->L811: Formula: (and (= |v_ULTIMATE.start_main_~#t1969~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1969~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1969~0.base_12| 0)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1969~0.base_12| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1969~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1969~0.base_12|) |v_ULTIMATE.start_main_~#t1969~0.offset_10| 2)) |v_#memory_int_13|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1969~0.base_12|) 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1969~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1969~0.base=|v_ULTIMATE.start_main_~#t1969~0.base_12|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, ULTIMATE.start_main_~#t1969~0.offset=|v_ULTIMATE.start_main_~#t1969~0.offset_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1969~0.base, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_~#t1969~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 22:22:50,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L745-->L745-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-124989142 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-124989142 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-124989142|) (not .cse1)) (and (= ~z$w_buff0_used~0_In-124989142 |P0Thread1of1ForFork0_#t~ite5_Out-124989142|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-124989142, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-124989142} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-124989142|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-124989142, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-124989142} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 22:22:50,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L746-->L746-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-95089862 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-95089862 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-95089862 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-95089862 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-95089862 |P0Thread1of1ForFork0_#t~ite6_Out-95089862|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-95089862|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-95089862, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-95089862, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-95089862, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-95089862} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-95089862|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-95089862, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-95089862, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-95089862, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-95089862} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 22:22:50,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L747-->L748: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In2009969484 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In2009969484 256) 0))) (or (and (= ~z$r_buff0_thd1~0_In2009969484 ~z$r_buff0_thd1~0_Out2009969484) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out2009969484)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2009969484, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2009969484} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2009969484, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out2009969484|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out2009969484} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 22:22:50,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L748-->L748-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In722731420 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In722731420 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In722731420 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In722731420 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out722731420|)) (and (or .cse2 .cse3) (= ~z$r_buff1_thd1~0_In722731420 |P0Thread1of1ForFork0_#t~ite8_Out722731420|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In722731420, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In722731420, ~z$w_buff1_used~0=~z$w_buff1_used~0_In722731420, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In722731420} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In722731420, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out722731420|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In722731420, ~z$w_buff1_used~0=~z$w_buff1_used~0_In722731420, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In722731420} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 22:22:50,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L748-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 22:22:50,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L764-2-->L764-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In2019698832 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In2019698832 256)))) (or (and (= ~z~0_In2019698832 |P1Thread1of1ForFork1_#t~ite9_Out2019698832|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~z$w_buff1~0_In2019698832 |P1Thread1of1ForFork1_#t~ite9_Out2019698832|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2019698832, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2019698832, ~z$w_buff1~0=~z$w_buff1~0_In2019698832, ~z~0=~z~0_In2019698832} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out2019698832|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2019698832, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2019698832, ~z$w_buff1~0=~z$w_buff1~0_In2019698832, ~z~0=~z~0_In2019698832} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 22:22:50,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L764-4-->L765: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~z~0_20) 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|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 22:22:50,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In791418366 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In791418366 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out791418366|)) (and (= ~z$w_buff0_used~0_In791418366 |P1Thread1of1ForFork1_#t~ite11_Out791418366|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In791418366, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In791418366} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In791418366, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out791418366|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In791418366} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 22:22:50,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L784-2-->L784-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In722352113 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In722352113 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out722352113| ~z$w_buff1~0_In722352113)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out722352113| ~z~0_In722352113)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In722352113, ~z$w_buff1_used~0=~z$w_buff1_used~0_In722352113, ~z$w_buff1~0=~z$w_buff1~0_In722352113, ~z~0=~z~0_In722352113} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out722352113|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In722352113, ~z$w_buff1_used~0=~z$w_buff1_used~0_In722352113, ~z$w_buff1~0=~z$w_buff1~0_In722352113, ~z~0=~z~0_In722352113} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 22:22:50,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L766-->L766-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1413258373 256))) (.cse2 (= (mod ~z$r_buff0_thd2~0_In-1413258373 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1413258373 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-1413258373 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite12_Out-1413258373| ~z$w_buff1_used~0_In-1413258373) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite12_Out-1413258373| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1413258373, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1413258373, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1413258373, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1413258373} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1413258373, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1413258373, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1413258373, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1413258373|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1413258373} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 22:22:50,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In632385022 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In632385022 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out632385022| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out632385022| ~z$r_buff0_thd2~0_In632385022) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In632385022, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In632385022} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In632385022, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out632385022|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In632385022} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 22:22:50,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L784-4-->L785: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~z~0_21) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~z~0=v_~z~0_21, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 22:22:50,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1495397053 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1495397053 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite17_Out-1495397053| ~z$w_buff0_used~0_In-1495397053) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out-1495397053|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1495397053, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1495397053} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1495397053, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1495397053, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-1495397053|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 22:22:50,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In855793731 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In855793731 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In855793731 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In855793731 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite18_Out855793731| 0)) (and (= |P2Thread1of1ForFork2_#t~ite18_Out855793731| ~z$w_buff1_used~0_In855793731) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In855793731, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In855793731, ~z$w_buff1_used~0=~z$w_buff1_used~0_In855793731, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In855793731} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In855793731, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In855793731, ~z$w_buff1_used~0=~z$w_buff1_used~0_In855793731, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In855793731, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out855793731|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 22:22:50,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L787-->L787-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1705047957 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1705047957 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out-1705047957| 0)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd3~0_In-1705047957 |P2Thread1of1ForFork2_#t~ite19_Out-1705047957|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1705047957, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1705047957} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1705047957, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1705047957, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-1705047957|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 22:22:50,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L788-->L788-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1010913907 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1010913907 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-1010913907 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1010913907 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1010913907| ~z$r_buff1_thd3~0_In-1010913907) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1010913907| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1010913907, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1010913907, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1010913907, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1010913907} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1010913907, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1010913907|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1010913907, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1010913907, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1010913907} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 22:22:50,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~z$r_buff1_thd3~0_12)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 22:22:50,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In461911917 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In461911917 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In461911917 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In461911917 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out461911917| 0)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out461911917| ~z$r_buff1_thd2~0_In461911917) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In461911917, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In461911917, ~z$w_buff1_used~0=~z$w_buff1_used~0_In461911917, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In461911917} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In461911917, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In461911917, ~z$w_buff1_used~0=~z$w_buff1_used~0_In461911917, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out461911917|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In461911917} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 22:22:50,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L768-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_10 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ 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{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ~__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[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 22:22:50,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L811-1-->L817: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 22:22:50,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L817-2-->L817-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1416303039 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1416303039 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In1416303039 |ULTIMATE.start_main_#t~ite24_Out1416303039|)) (and (not .cse0) (= ~z$w_buff1~0_In1416303039 |ULTIMATE.start_main_#t~ite24_Out1416303039|) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1416303039, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1416303039, ~z$w_buff1~0=~z$w_buff1~0_In1416303039, ~z~0=~z~0_In1416303039} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1416303039, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1416303039|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1416303039, ~z$w_buff1~0=~z$w_buff1~0_In1416303039, ~z~0=~z~0_In1416303039} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 22:22:50,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L817-4-->L818: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite24_7|) InVars {ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_7|} OutVars{ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_6|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_6|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ~z~0] because there is no mapped edge [2019-12-27 22:22:50,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1965097262 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1965097262 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1965097262 |ULTIMATE.start_main_#t~ite26_Out-1965097262|)) (and (= 0 |ULTIMATE.start_main_#t~ite26_Out-1965097262|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1965097262, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1965097262} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1965097262, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1965097262, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1965097262|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 22:22:50,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-553004292 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-553004292 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-553004292 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-553004292 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite27_Out-553004292|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-553004292 |ULTIMATE.start_main_#t~ite27_Out-553004292|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-553004292, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-553004292, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-553004292, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-553004292} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-553004292, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-553004292, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-553004292, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-553004292, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-553004292|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 22:22:50,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-202792671 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-202792671 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite28_Out-202792671|) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-202792671 |ULTIMATE.start_main_#t~ite28_Out-202792671|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-202792671, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-202792671} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-202792671, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-202792671|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-202792671} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 22:22:50,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L821-->L821-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1315544015 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1315544015 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1315544015 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1315544015 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In1315544015 |ULTIMATE.start_main_#t~ite29_Out1315544015|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite29_Out1315544015|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1315544015, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1315544015, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1315544015, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1315544015} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1315544015, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1315544015|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1315544015, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1315544015, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1315544015} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 22:22:50,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L833-->L834: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~z$r_buff0_thd0~0_69 v_~z$r_buff0_thd0~0_70)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_70, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_69, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_7|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 22:22:50,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L836-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4| (mod v_~main$tmp_guard1~0_8 256)) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_25 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:22:50,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 22:22:50,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:22:50 BasicIcfg [2019-12-27 22:22:50,191 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:22:50,193 INFO L168 Benchmark]: Toolchain (without parser) took 156218.92 ms. Allocated memory was 136.3 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 99.3 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 22:22:50,193 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 136.3 MB. Free memory is still 119.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 22:22:50,194 INFO L168 Benchmark]: CACSL2BoogieTranslator took 726.63 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 98.9 MB in the beginning and 153.0 MB in the end (delta: -54.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:22:50,194 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.65 ms. Allocated memory is still 199.8 MB. Free memory was 153.0 MB in the beginning and 150.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 22:22:50,198 INFO L168 Benchmark]: Boogie Preprocessor took 38.54 ms. Allocated memory is still 199.8 MB. Free memory was 150.0 MB in the beginning and 147.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-27 22:22:50,198 INFO L168 Benchmark]: RCFGBuilder took 844.29 ms. Allocated memory is still 199.8 MB. Free memory was 147.1 MB in the beginning and 97.8 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. [2019-12-27 22:22:50,199 INFO L168 Benchmark]: TraceAbstraction took 154533.35 ms. Allocated memory was 199.8 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 96.8 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 22:22:50,205 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.55 ms. Allocated memory is still 136.3 MB. Free memory is still 119.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 726.63 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 98.9 MB in the beginning and 153.0 MB in the end (delta: -54.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.65 ms. Allocated memory is still 199.8 MB. Free memory was 153.0 MB in the beginning and 150.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.54 ms. Allocated memory is still 199.8 MB. Free memory was 150.0 MB in the beginning and 147.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 844.29 ms. Allocated memory is still 199.8 MB. Free memory was 147.1 MB in the beginning and 97.8 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 154533.35 ms. Allocated memory was 199.8 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 96.8 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 175 ProgramPointsBefore, 98 ProgramPointsAfterwards, 212 TransitionsBefore, 111 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 28 ChoiceCompositions, 5348 VarBasedMoverChecksPositive, 177 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 84694 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L807] FCALL, FORK 0 pthread_create(&t1967, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK 0 pthread_create(&t1968, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L811] FCALL, FORK 0 pthread_create(&t1969, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 __unbuffered_p1_EAX = x [L761] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 __unbuffered_p2_EAX = y [L781] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L784] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 0 z$flush_delayed = weak$$choice2 [L827] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L829] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L831] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L832] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 154.2s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 59.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5535 SDtfs, 10416 SDslu, 24835 SDs, 0 SdLazy, 23055 SolverSat, 1115 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1054 GetRequests, 330 SyntacticMatches, 134 SemanticMatches, 590 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7736 ImplicationChecksByTransitivity, 21.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221154occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 54.7s AutomataMinimizationTime, 27 MinimizatonAttempts, 185700 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1508 NumberOfCodeBlocks, 1508 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1413 ConstructedInterpolants, 0 QuantifiedInterpolants, 377625 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...