/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/mix052_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:34:46,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:34:46,612 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:34:46,629 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:34:46,629 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:34:46,631 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:34:46,633 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:34:46,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:34:46,646 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:34:46,649 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:34:46,651 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:34:46,652 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:34:46,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:34:46,654 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:34:46,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:34:46,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:34:46,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:34:46,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:34:46,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:34:46,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:34:46,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:34:46,674 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:34:46,675 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:34:46,676 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:34:46,678 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:34:46,678 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:34:46,679 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:34:46,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:34:46,682 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:34:46,683 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:34:46,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:34:46,684 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:34:46,684 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:34:46,685 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:34:46,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:34:46,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:34:46,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:34:46,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:34:46,688 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:34:46,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:34:46,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:34:46,690 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 21:34:46,704 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:34:46,704 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:34:46,705 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:34:46,705 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:34:46,705 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:34:46,706 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:34:46,706 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:34:46,706 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:34:46,706 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:34:46,706 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:34:46,707 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:34:46,707 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:34:46,707 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:34:46,707 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:34:46,707 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:34:46,708 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:34:46,708 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:34:46,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:34:46,708 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:34:46,708 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:34:46,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:34:46,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:34:46,709 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:34:46,709 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:34:46,709 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:34:46,710 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:34:46,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:34:46,710 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:34:46,710 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:34:46,710 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:34:46,711 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:34:46,711 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:34:47,017 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:34:47,040 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:34:47,044 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:34:47,045 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:34:47,047 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:34:47,047 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_power.oepc.i [2019-12-27 21:34:47,106 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6e225392/cbaffa780b1e4d998df47e0a7c373490/FLAGb1339f4c7 [2019-12-27 21:34:47,656 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:34:47,657 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_power.oepc.i [2019-12-27 21:34:47,674 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6e225392/cbaffa780b1e4d998df47e0a7c373490/FLAGb1339f4c7 [2019-12-27 21:34:48,123 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6e225392/cbaffa780b1e4d998df47e0a7c373490 [2019-12-27 21:34:48,131 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:34:48,133 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:34:48,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:34:48,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:34:48,138 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:34:48,139 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:34:48" (1/1) ... [2019-12-27 21:34:48,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6741ed25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:34:48, skipping insertion in model container [2019-12-27 21:34:48,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:34:48" (1/1) ... [2019-12-27 21:34:48,150 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:34:48,198 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:34:48,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:34:48,717 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:34:48,785 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:34:48,859 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:34:48,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:34:48 WrapperNode [2019-12-27 21:34:48,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:34:48,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:34:48,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:34:48,860 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:34:48,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:34:48" (1/1) ... [2019-12-27 21:34:48,891 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:34:48" (1/1) ... [2019-12-27 21:34:48,924 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:34:48,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:34:48,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:34:48,924 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:34:48,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:34:48" (1/1) ... [2019-12-27 21:34:48,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:34:48" (1/1) ... [2019-12-27 21:34:48,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:34:48" (1/1) ... [2019-12-27 21:34:48,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:34:48" (1/1) ... [2019-12-27 21:34:48,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:34:48" (1/1) ... [2019-12-27 21:34:48,960 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:34:48" (1/1) ... [2019-12-27 21:34:48,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:34:48" (1/1) ... [2019-12-27 21:34:48,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:34:48,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:34:48,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:34:48,970 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:34:48,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:34:48" (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 21:34:49,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:34:49,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:34:49,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:34:49,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:34:49,050 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:34:49,050 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:34:49,050 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:34:49,051 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:34:49,051 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:34:49,051 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:34:49,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:34:49,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:34:49,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:34:49,053 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 21:34:49,868 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:34:49,868 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:34:49,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:34:49 BoogieIcfgContainer [2019-12-27 21:34:49,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:34:49,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:34:49,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:34:49,874 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:34:49,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:34:48" (1/3) ... [2019-12-27 21:34:49,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ee2b71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:34:49, skipping insertion in model container [2019-12-27 21:34:49,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:34:48" (2/3) ... [2019-12-27 21:34:49,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ee2b71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:34:49, skipping insertion in model container [2019-12-27 21:34:49,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:34:49" (3/3) ... [2019-12-27 21:34:49,878 INFO L109 eAbstractionObserver]: Analyzing ICFG mix052_power.oepc.i [2019-12-27 21:34:49,888 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:34:49,889 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:34:49,896 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:34:49,897 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:34:49,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,937 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,937 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,938 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,938 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,938 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,939 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,944 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,947 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,947 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,980 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,980 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:49,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,006 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,007 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,008 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,013 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,013 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,014 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,016 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,017 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,021 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,022 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,023 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,023 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,024 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,025 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,026 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,027 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:34:50,042 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 21:34:50,062 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:34:50,062 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:34:50,063 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:34:50,063 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:34:50,063 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:34:50,063 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:34:50,063 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:34:50,063 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:34:50,079 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 21:34:50,081 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 21:34:50,188 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 21:34:50,189 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:34:50,207 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 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:34:50,234 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 21:34:50,325 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 21:34:50,325 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:34:50,334 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 7. Compared 437 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:34:50,355 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 21:34:50,356 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:34:54,128 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 21:34:54,276 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 21:34:54,298 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80960 [2019-12-27 21:34:54,298 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 21:34:54,301 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 101 transitions [2019-12-27 21:35:11,690 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 106892 states. [2019-12-27 21:35:11,692 INFO L276 IsEmpty]: Start isEmpty. Operand 106892 states. [2019-12-27 21:35:11,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:35:11,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:35:11,699 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:35:11,699 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 21:35:11,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:35:11,705 INFO L82 PathProgramCache]: Analyzing trace with hash 911873, now seen corresponding path program 1 times [2019-12-27 21:35:11,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:35:11,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249167122] [2019-12-27 21:35:11,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:35:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:35:11,942 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 21:35:11,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249167122] [2019-12-27 21:35:11,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:35:11,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:35:11,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [543856883] [2019-12-27 21:35:11,947 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:35:11,951 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:35:11,964 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:35:11,965 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:35:11,969 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:35:11,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:35:11,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:35:11,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:35:11,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:35:11,989 INFO L87 Difference]: Start difference. First operand 106892 states. Second operand 3 states. [2019-12-27 21:35:13,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:35:13,617 INFO L93 Difference]: Finished difference Result 106230 states and 453846 transitions. [2019-12-27 21:35:13,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:35:13,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:35:13,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:35:14,267 INFO L225 Difference]: With dead ends: 106230 [2019-12-27 21:35:14,268 INFO L226 Difference]: Without dead ends: 99639 [2019-12-27 21:35:14,269 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 21:35:21,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99639 states. [2019-12-27 21:35:23,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99639 to 99639. [2019-12-27 21:35:23,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99639 states. [2019-12-27 21:35:24,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99639 states to 99639 states and 425116 transitions. [2019-12-27 21:35:24,506 INFO L78 Accepts]: Start accepts. Automaton has 99639 states and 425116 transitions. Word has length 3 [2019-12-27 21:35:24,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:35:24,506 INFO L462 AbstractCegarLoop]: Abstraction has 99639 states and 425116 transitions. [2019-12-27 21:35:24,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:35:24,506 INFO L276 IsEmpty]: Start isEmpty. Operand 99639 states and 425116 transitions. [2019-12-27 21:35:24,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:35:24,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:35:24,511 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:35:24,511 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 21:35:24,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:35:24,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1470531628, now seen corresponding path program 1 times [2019-12-27 21:35:24,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:35:24,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194563820] [2019-12-27 21:35:24,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:35:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:35:24,670 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 21:35:24,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194563820] [2019-12-27 21:35:24,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:35:24,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:35:24,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [971557007] [2019-12-27 21:35:24,672 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:35:24,675 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:35:24,681 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:35:24,682 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:35:24,682 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:35:24,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:35:24,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:35:24,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:35:24,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:35:24,687 INFO L87 Difference]: Start difference. First operand 99639 states and 425116 transitions. Second operand 4 states. [2019-12-27 21:35:29,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:35:29,085 INFO L93 Difference]: Finished difference Result 159197 states and 650077 transitions. [2019-12-27 21:35:29,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:35:29,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:35:29,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:35:30,271 INFO L225 Difference]: With dead ends: 159197 [2019-12-27 21:35:30,272 INFO L226 Difference]: Without dead ends: 159148 [2019-12-27 21:35:30,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:35:38,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159148 states. [2019-12-27 21:35:41,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159148 to 145638. [2019-12-27 21:35:41,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145638 states. [2019-12-27 21:35:42,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145638 states to 145638 states and 602196 transitions. [2019-12-27 21:35:42,640 INFO L78 Accepts]: Start accepts. Automaton has 145638 states and 602196 transitions. Word has length 11 [2019-12-27 21:35:42,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:35:42,641 INFO L462 AbstractCegarLoop]: Abstraction has 145638 states and 602196 transitions. [2019-12-27 21:35:42,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:35:42,641 INFO L276 IsEmpty]: Start isEmpty. Operand 145638 states and 602196 transitions. [2019-12-27 21:35:42,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:35:42,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:35:42,647 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:35:42,648 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 21:35:42,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:35:42,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1074387989, now seen corresponding path program 1 times [2019-12-27 21:35:42,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:35:42,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192577914] [2019-12-27 21:35:42,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:35:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:35:42,725 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 21:35:42,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192577914] [2019-12-27 21:35:42,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:35:42,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:35:42,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [303350125] [2019-12-27 21:35:42,727 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:35:42,728 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:35:42,730 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:35:42,730 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:35:42,730 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:35:42,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:35:42,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:35:42,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:35:42,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:35:42,731 INFO L87 Difference]: Start difference. First operand 145638 states and 602196 transitions. Second operand 3 states. [2019-12-27 21:35:42,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:35:42,872 INFO L93 Difference]: Finished difference Result 32092 states and 104170 transitions. [2019-12-27 21:35:42,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:35:42,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 21:35:42,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:35:42,964 INFO L225 Difference]: With dead ends: 32092 [2019-12-27 21:35:42,964 INFO L226 Difference]: Without dead ends: 32092 [2019-12-27 21:35:42,964 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 21:35:43,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32092 states. [2019-12-27 21:35:43,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32092 to 32092. [2019-12-27 21:35:43,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32092 states. [2019-12-27 21:35:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32092 states to 32092 states and 104170 transitions. [2019-12-27 21:35:43,810 INFO L78 Accepts]: Start accepts. Automaton has 32092 states and 104170 transitions. Word has length 13 [2019-12-27 21:35:43,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:35:43,811 INFO L462 AbstractCegarLoop]: Abstraction has 32092 states and 104170 transitions. [2019-12-27 21:35:43,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:35:43,811 INFO L276 IsEmpty]: Start isEmpty. Operand 32092 states and 104170 transitions. [2019-12-27 21:35:43,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:35:43,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:35:43,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:35:43,814 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 21:35:43,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:35:43,814 INFO L82 PathProgramCache]: Analyzing trace with hash -625948887, now seen corresponding path program 1 times [2019-12-27 21:35:43,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:35:43,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332943990] [2019-12-27 21:35:43,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:35:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:35:43,958 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 21:35:43,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332943990] [2019-12-27 21:35:43,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:35:43,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:35:43,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1544568991] [2019-12-27 21:35:43,964 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:35:43,968 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:35:43,971 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:35:43,971 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:35:43,972 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:35:43,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:35:43,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:35:43,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:35:43,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:35:43,973 INFO L87 Difference]: Start difference. First operand 32092 states and 104170 transitions. Second operand 5 states. [2019-12-27 21:35:46,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:35:46,604 INFO L93 Difference]: Finished difference Result 43827 states and 140462 transitions. [2019-12-27 21:35:46,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:35:46,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 21:35:46,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:35:46,672 INFO L225 Difference]: With dead ends: 43827 [2019-12-27 21:35:46,672 INFO L226 Difference]: Without dead ends: 43827 [2019-12-27 21:35:46,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:35:46,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43827 states. [2019-12-27 21:35:47,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43827 to 37110. [2019-12-27 21:35:47,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37110 states. [2019-12-27 21:35:47,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37110 states to 37110 states and 119926 transitions. [2019-12-27 21:35:47,338 INFO L78 Accepts]: Start accepts. Automaton has 37110 states and 119926 transitions. Word has length 16 [2019-12-27 21:35:47,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:35:47,339 INFO L462 AbstractCegarLoop]: Abstraction has 37110 states and 119926 transitions. [2019-12-27 21:35:47,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:35:47,340 INFO L276 IsEmpty]: Start isEmpty. Operand 37110 states and 119926 transitions. [2019-12-27 21:35:47,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:35:47,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:35:47,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:35:47,349 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 21:35:47,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:35:47,349 INFO L82 PathProgramCache]: Analyzing trace with hash 867934420, now seen corresponding path program 1 times [2019-12-27 21:35:47,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:35:47,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974835526] [2019-12-27 21:35:47,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:35:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:35:47,492 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 21:35:47,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974835526] [2019-12-27 21:35:47,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:35:47,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:35:47,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1701938058] [2019-12-27 21:35:47,494 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:35:47,499 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:35:47,505 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 38 transitions. [2019-12-27 21:35:47,506 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:35:47,507 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:35:47,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:35:47,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:35:47,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:35:47,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:35:47,508 INFO L87 Difference]: Start difference. First operand 37110 states and 119926 transitions. Second operand 6 states. [2019-12-27 21:35:48,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:35:48,635 INFO L93 Difference]: Finished difference Result 56855 states and 178889 transitions. [2019-12-27 21:35:48,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:35:48,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 21:35:48,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:35:48,722 INFO L225 Difference]: With dead ends: 56855 [2019-12-27 21:35:48,723 INFO L226 Difference]: Without dead ends: 56848 [2019-12-27 21:35:48,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:35:49,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56848 states. [2019-12-27 21:35:49,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56848 to 38036. [2019-12-27 21:35:49,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38036 states. [2019-12-27 21:35:49,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38036 states to 38036 states and 122132 transitions. [2019-12-27 21:35:49,793 INFO L78 Accepts]: Start accepts. Automaton has 38036 states and 122132 transitions. Word has length 22 [2019-12-27 21:35:49,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:35:49,793 INFO L462 AbstractCegarLoop]: Abstraction has 38036 states and 122132 transitions. [2019-12-27 21:35:49,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:35:49,794 INFO L276 IsEmpty]: Start isEmpty. Operand 38036 states and 122132 transitions. [2019-12-27 21:35:49,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:35:49,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:35:49,809 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 21:35:49,809 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 21:35:49,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:35:49,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1491582791, now seen corresponding path program 1 times [2019-12-27 21:35:49,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:35:49,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296126548] [2019-12-27 21:35:49,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:35:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:35:49,873 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 21:35:49,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296126548] [2019-12-27 21:35:49,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:35:49,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:35:49,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1674960420] [2019-12-27 21:35:49,874 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:35:49,877 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:35:49,887 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 21:35:49,887 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:35:49,928 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:35:49,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:35:49,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:35:49,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:35:49,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:35:49,929 INFO L87 Difference]: Start difference. First operand 38036 states and 122132 transitions. Second operand 5 states. [2019-12-27 21:35:50,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:35:50,007 INFO L93 Difference]: Finished difference Result 15569 states and 47210 transitions. [2019-12-27 21:35:50,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:35:50,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 21:35:50,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:35:50,029 INFO L225 Difference]: With dead ends: 15569 [2019-12-27 21:35:50,029 INFO L226 Difference]: Without dead ends: 15569 [2019-12-27 21:35:50,030 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 21:35:50,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15569 states. [2019-12-27 21:35:50,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15569 to 15311. [2019-12-27 21:35:50,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15311 states. [2019-12-27 21:35:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15311 states to 15311 states and 46474 transitions. [2019-12-27 21:35:50,263 INFO L78 Accepts]: Start accepts. Automaton has 15311 states and 46474 transitions. Word has length 25 [2019-12-27 21:35:50,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:35:50,263 INFO L462 AbstractCegarLoop]: Abstraction has 15311 states and 46474 transitions. [2019-12-27 21:35:50,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:35:50,263 INFO L276 IsEmpty]: Start isEmpty. Operand 15311 states and 46474 transitions. [2019-12-27 21:35:50,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:35:50,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:35:50,274 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:35:50,274 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 21:35:50,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:35:50,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1591310570, now seen corresponding path program 1 times [2019-12-27 21:35:50,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:35:50,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770032683] [2019-12-27 21:35:50,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:35:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:35:50,402 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 21:35:50,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770032683] [2019-12-27 21:35:50,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:35:50,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:35:50,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1122777851] [2019-12-27 21:35:50,403 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:35:50,408 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:35:50,413 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 21:35:50,414 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:35:50,414 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:35:50,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:35:50,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:35:50,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:35:50,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:35:50,415 INFO L87 Difference]: Start difference. First operand 15311 states and 46474 transitions. Second operand 6 states. [2019-12-27 21:35:51,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:35:51,085 INFO L93 Difference]: Finished difference Result 21967 states and 64800 transitions. [2019-12-27 21:35:51,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:35:51,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 21:35:51,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:35:51,330 INFO L225 Difference]: With dead ends: 21967 [2019-12-27 21:35:51,330 INFO L226 Difference]: Without dead ends: 21967 [2019-12-27 21:35:51,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:35:51,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21967 states. [2019-12-27 21:35:51,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21967 to 17627. [2019-12-27 21:35:51,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17627 states. [2019-12-27 21:35:51,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17627 states to 17627 states and 53055 transitions. [2019-12-27 21:35:51,630 INFO L78 Accepts]: Start accepts. Automaton has 17627 states and 53055 transitions. Word has length 27 [2019-12-27 21:35:51,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:35:51,631 INFO L462 AbstractCegarLoop]: Abstraction has 17627 states and 53055 transitions. [2019-12-27 21:35:51,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:35:51,631 INFO L276 IsEmpty]: Start isEmpty. Operand 17627 states and 53055 transitions. [2019-12-27 21:35:51,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:35:51,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:35:51,650 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:35:51,650 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 21:35:51,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:35:51,651 INFO L82 PathProgramCache]: Analyzing trace with hash 174996949, now seen corresponding path program 1 times [2019-12-27 21:35:51,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:35:51,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259675229] [2019-12-27 21:35:51,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:35:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:35:51,771 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 21:35:51,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259675229] [2019-12-27 21:35:51,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:35:51,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:35:51,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [493273486] [2019-12-27 21:35:51,772 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:35:51,778 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:35:51,793 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 53 states and 71 transitions. [2019-12-27 21:35:51,793 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:35:51,793 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:35:51,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:35:51,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:35:51,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:35:51,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:35:51,794 INFO L87 Difference]: Start difference. First operand 17627 states and 53055 transitions. Second operand 7 states. [2019-12-27 21:35:53,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:35:53,105 INFO L93 Difference]: Finished difference Result 24877 states and 72876 transitions. [2019-12-27 21:35:53,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:35:53,106 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 21:35:53,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:35:53,141 INFO L225 Difference]: With dead ends: 24877 [2019-12-27 21:35:53,141 INFO L226 Difference]: Without dead ends: 24877 [2019-12-27 21:35:53,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 21:35:53,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24877 states. [2019-12-27 21:35:53,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24877 to 16954. [2019-12-27 21:35:53,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-27 21:35:53,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50982 transitions. [2019-12-27 21:35:53,425 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50982 transitions. Word has length 33 [2019-12-27 21:35:53,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:35:53,426 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50982 transitions. [2019-12-27 21:35:53,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:35:53,426 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50982 transitions. [2019-12-27 21:35:53,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:35:53,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:35:53,448 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:35:53,448 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 21:35:53,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:35:53,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1438899484, now seen corresponding path program 1 times [2019-12-27 21:35:53,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:35:53,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515237727] [2019-12-27 21:35:53,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:35:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:35:53,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 21:35:53,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515237727] [2019-12-27 21:35:53,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:35:53,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:35:53,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1574891989] [2019-12-27 21:35:53,536 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:35:53,543 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:35:53,605 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 424 transitions. [2019-12-27 21:35:53,606 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:35:53,771 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 21:35:53,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:35:53,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:35:53,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:35:53,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:35:53,772 INFO L87 Difference]: Start difference. First operand 16954 states and 50982 transitions. Second operand 11 states. [2019-12-27 21:35:54,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:35:54,690 INFO L93 Difference]: Finished difference Result 23664 states and 70656 transitions. [2019-12-27 21:35:54,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:35:54,691 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2019-12-27 21:35:54,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:35:54,724 INFO L225 Difference]: With dead ends: 23664 [2019-12-27 21:35:54,724 INFO L226 Difference]: Without dead ends: 23664 [2019-12-27 21:35:54,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:35:54,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23664 states. [2019-12-27 21:35:55,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23664 to 22129. [2019-12-27 21:35:55,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22129 states. [2019-12-27 21:35:55,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22129 states to 22129 states and 66460 transitions. [2019-12-27 21:35:55,146 INFO L78 Accepts]: Start accepts. Automaton has 22129 states and 66460 transitions. Word has length 39 [2019-12-27 21:35:55,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:35:55,147 INFO L462 AbstractCegarLoop]: Abstraction has 22129 states and 66460 transitions. [2019-12-27 21:35:55,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:35:55,147 INFO L276 IsEmpty]: Start isEmpty. Operand 22129 states and 66460 transitions. [2019-12-27 21:35:55,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:35:55,175 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:35:55,175 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:35:55,175 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 21:35:55,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:35:55,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1240175328, now seen corresponding path program 2 times [2019-12-27 21:35:55,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:35:55,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438214548] [2019-12-27 21:35:55,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:35:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:35:55,265 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 21:35:55,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438214548] [2019-12-27 21:35:55,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:35:55,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:35:55,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1535146841] [2019-12-27 21:35:55,266 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:35:55,274 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:35:55,340 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 378 transitions. [2019-12-27 21:35:55,340 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:35:55,341 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:35:55,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:35:55,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:35:55,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:35:55,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:35:55,343 INFO L87 Difference]: Start difference. First operand 22129 states and 66460 transitions. Second operand 3 states. [2019-12-27 21:35:55,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:35:55,461 INFO L93 Difference]: Finished difference Result 22129 states and 66391 transitions. [2019-12-27 21:35:55,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:35:55,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 21:35:55,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:35:55,502 INFO L225 Difference]: With dead ends: 22129 [2019-12-27 21:35:55,502 INFO L226 Difference]: Without dead ends: 22129 [2019-12-27 21:35:55,503 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 21:35:55,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22129 states. [2019-12-27 21:35:55,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22129 to 19000. [2019-12-27 21:35:55,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19000 states. [2019-12-27 21:35:55,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19000 states to 19000 states and 57697 transitions. [2019-12-27 21:35:55,852 INFO L78 Accepts]: Start accepts. Automaton has 19000 states and 57697 transitions. Word has length 39 [2019-12-27 21:35:55,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:35:55,853 INFO L462 AbstractCegarLoop]: Abstraction has 19000 states and 57697 transitions. [2019-12-27 21:35:55,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:35:55,853 INFO L276 IsEmpty]: Start isEmpty. Operand 19000 states and 57697 transitions. [2019-12-27 21:35:55,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 21:35:55,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:35:55,874 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:35:55,874 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 21:35:55,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:35:55,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1052140234, now seen corresponding path program 1 times [2019-12-27 21:35:55,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:35:55,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667142908] [2019-12-27 21:35:55,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:35:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:35:55,939 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 21:35:55,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667142908] [2019-12-27 21:35:55,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:35:55,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:35:55,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1253665249] [2019-12-27 21:35:55,942 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:35:55,950 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:35:56,009 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 185 states and 376 transitions. [2019-12-27 21:35:56,009 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:35:56,061 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 21:35:56,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:35:56,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:35:56,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:35:56,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:35:56,062 INFO L87 Difference]: Start difference. First operand 19000 states and 57697 transitions. Second operand 7 states. [2019-12-27 21:35:56,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:35:56,165 INFO L93 Difference]: Finished difference Result 17811 states and 55053 transitions. [2019-12-27 21:35:56,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:35:56,166 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 21:35:56,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:35:56,193 INFO L225 Difference]: With dead ends: 17811 [2019-12-27 21:35:56,193 INFO L226 Difference]: Without dead ends: 17811 [2019-12-27 21:35:56,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:35:56,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17811 states. [2019-12-27 21:35:56,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17811 to 17811. [2019-12-27 21:35:56,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17811 states. [2019-12-27 21:35:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17811 states to 17811 states and 55053 transitions. [2019-12-27 21:35:56,457 INFO L78 Accepts]: Start accepts. Automaton has 17811 states and 55053 transitions. Word has length 40 [2019-12-27 21:35:56,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:35:56,457 INFO L462 AbstractCegarLoop]: Abstraction has 17811 states and 55053 transitions. [2019-12-27 21:35:56,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:35:56,457 INFO L276 IsEmpty]: Start isEmpty. Operand 17811 states and 55053 transitions. [2019-12-27 21:35:56,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:35:56,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:35:56,476 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 21:35:56,476 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 21:35:56,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:35:56,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1026974969, now seen corresponding path program 1 times [2019-12-27 21:35:56,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:35:56,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117517678] [2019-12-27 21:35:56,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:35:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:35:56,531 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 21:35:56,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117517678] [2019-12-27 21:35:56,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:35:56,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:35:56,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1480862330] [2019-12-27 21:35:56,533 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:35:56,554 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:35:56,891 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 270 states and 525 transitions. [2019-12-27 21:35:56,891 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:35:56,901 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:35:56,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:35:56,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:35:56,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:35:56,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:35:56,903 INFO L87 Difference]: Start difference. First operand 17811 states and 55053 transitions. Second operand 3 states. [2019-12-27 21:35:57,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:35:57,006 INFO L93 Difference]: Finished difference Result 25549 states and 79388 transitions. [2019-12-27 21:35:57,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:35:57,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 21:35:57,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:35:57,041 INFO L225 Difference]: With dead ends: 25549 [2019-12-27 21:35:57,042 INFO L226 Difference]: Without dead ends: 25549 [2019-12-27 21:35:57,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:35:57,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25549 states. [2019-12-27 21:35:57,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25549 to 20120. [2019-12-27 21:35:57,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20120 states. [2019-12-27 21:35:57,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20120 states to 20120 states and 63063 transitions. [2019-12-27 21:35:57,366 INFO L78 Accepts]: Start accepts. Automaton has 20120 states and 63063 transitions. Word has length 65 [2019-12-27 21:35:57,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:35:57,367 INFO L462 AbstractCegarLoop]: Abstraction has 20120 states and 63063 transitions. [2019-12-27 21:35:57,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:35:57,367 INFO L276 IsEmpty]: Start isEmpty. Operand 20120 states and 63063 transitions. [2019-12-27 21:35:57,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:35:57,393 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:35:57,393 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 21:35:57,393 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 21:35:57,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:35:57,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1733622222, now seen corresponding path program 1 times [2019-12-27 21:35:57,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:35:57,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707444212] [2019-12-27 21:35:57,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:35:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:35:57,495 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 21:35:57,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707444212] [2019-12-27 21:35:57,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:35:57,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:35:57,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1007566674] [2019-12-27 21:35:57,496 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:35:57,521 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:35:57,727 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 270 states and 525 transitions. [2019-12-27 21:35:57,727 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:35:58,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:35:58,095 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 34 times. [2019-12-27 21:35:58,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:35:58,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:35:58,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:35:58,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:35:58,096 INFO L87 Difference]: Start difference. First operand 20120 states and 63063 transitions. Second operand 8 states. [2019-12-27 21:35:59,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:35:59,091 INFO L93 Difference]: Finished difference Result 61762 states and 197219 transitions. [2019-12-27 21:35:59,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 21:35:59,092 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 21:35:59,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:35:59,159 INFO L225 Difference]: With dead ends: 61762 [2019-12-27 21:35:59,160 INFO L226 Difference]: Without dead ends: 41451 [2019-12-27 21:35:59,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 14 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-12-27 21:35:59,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41451 states. [2019-12-27 21:35:59,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41451 to 22616. [2019-12-27 21:35:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22616 states. [2019-12-27 21:35:59,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22616 states to 22616 states and 72495 transitions. [2019-12-27 21:35:59,674 INFO L78 Accepts]: Start accepts. Automaton has 22616 states and 72495 transitions. Word has length 65 [2019-12-27 21:35:59,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:35:59,674 INFO L462 AbstractCegarLoop]: Abstraction has 22616 states and 72495 transitions. [2019-12-27 21:35:59,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:35:59,674 INFO L276 IsEmpty]: Start isEmpty. Operand 22616 states and 72495 transitions. [2019-12-27 21:35:59,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:35:59,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:35:59,714 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 21:35:59,714 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 21:35:59,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:35:59,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1636799292, now seen corresponding path program 2 times [2019-12-27 21:35:59,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:35:59,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674626006] [2019-12-27 21:35:59,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:35:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:35:59,815 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 21:35:59,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674626006] [2019-12-27 21:35:59,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:35:59,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:35:59,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [930854293] [2019-12-27 21:35:59,816 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:35:59,839 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:36:00,044 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 230 states and 418 transitions. [2019-12-27 21:36:00,045 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:36:00,167 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 21:36:00,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:36:00,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:36:00,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:36:00,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:36:00,169 INFO L87 Difference]: Start difference. First operand 22616 states and 72495 transitions. Second operand 11 states. [2019-12-27 21:36:01,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:36:01,020 INFO L93 Difference]: Finished difference Result 59697 states and 188113 transitions. [2019-12-27 21:36:01,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:36:01,020 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 21:36:01,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:36:01,093 INFO L225 Difference]: With dead ends: 59697 [2019-12-27 21:36:01,093 INFO L226 Difference]: Without dead ends: 41689 [2019-12-27 21:36:01,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-12-27 21:36:01,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41689 states. [2019-12-27 21:36:01,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41689 to 25989. [2019-12-27 21:36:01,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25989 states. [2019-12-27 21:36:01,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25989 states to 25989 states and 82884 transitions. [2019-12-27 21:36:01,650 INFO L78 Accepts]: Start accepts. Automaton has 25989 states and 82884 transitions. Word has length 65 [2019-12-27 21:36:01,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:36:01,650 INFO L462 AbstractCegarLoop]: Abstraction has 25989 states and 82884 transitions. [2019-12-27 21:36:01,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:36:01,650 INFO L276 IsEmpty]: Start isEmpty. Operand 25989 states and 82884 transitions. [2019-12-27 21:36:01,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:36:01,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:36:01,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 21:36:01,682 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 21:36:01,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:36:01,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1390870140, now seen corresponding path program 3 times [2019-12-27 21:36:01,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:36:01,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316549735] [2019-12-27 21:36:01,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:36:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:36:01,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:36:01,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316549735] [2019-12-27 21:36:01,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:36:01,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:36:01,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1041831042] [2019-12-27 21:36:01,780 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:36:01,800 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:36:02,006 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 250 states and 468 transitions. [2019-12-27 21:36:02,006 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:36:02,102 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 21:36:02,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:36:02,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:36:02,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:36:02,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:36:02,103 INFO L87 Difference]: Start difference. First operand 25989 states and 82884 transitions. Second operand 10 states. [2019-12-27 21:36:03,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:36:03,931 INFO L93 Difference]: Finished difference Result 123830 states and 384700 transitions. [2019-12-27 21:36:03,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 21:36:03,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 21:36:03,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:36:04,092 INFO L225 Difference]: With dead ends: 123830 [2019-12-27 21:36:04,092 INFO L226 Difference]: Without dead ends: 96951 [2019-12-27 21:36:04,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-12-27 21:36:04,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96951 states. [2019-12-27 21:36:05,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96951 to 30894. [2019-12-27 21:36:05,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30894 states. [2019-12-27 21:36:05,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30894 states to 30894 states and 98649 transitions. [2019-12-27 21:36:05,091 INFO L78 Accepts]: Start accepts. Automaton has 30894 states and 98649 transitions. Word has length 65 [2019-12-27 21:36:05,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:36:05,091 INFO L462 AbstractCegarLoop]: Abstraction has 30894 states and 98649 transitions. [2019-12-27 21:36:05,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:36:05,091 INFO L276 IsEmpty]: Start isEmpty. Operand 30894 states and 98649 transitions. [2019-12-27 21:36:05,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:36:05,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:36:05,129 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 21:36:05,129 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 21:36:05,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:36:05,129 INFO L82 PathProgramCache]: Analyzing trace with hash -277663810, now seen corresponding path program 4 times [2019-12-27 21:36:05,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:36:05,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018572650] [2019-12-27 21:36:05,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:36:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:36:05,226 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 21:36:05,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018572650] [2019-12-27 21:36:05,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:36:05,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:36:05,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [515642778] [2019-12-27 21:36:05,227 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:36:05,246 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:36:05,444 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 280 states and 549 transitions. [2019-12-27 21:36:05,444 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:36:05,593 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 21:36:05,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 21:36:05,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:36:05,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 21:36:05,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:36:05,595 INFO L87 Difference]: Start difference. First operand 30894 states and 98649 transitions. Second operand 11 states. [2019-12-27 21:36:06,413 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-12-27 21:36:07,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:36:07,800 INFO L93 Difference]: Finished difference Result 85006 states and 266282 transitions. [2019-12-27 21:36:07,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:36:07,800 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 21:36:07,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:36:07,918 INFO L225 Difference]: With dead ends: 85006 [2019-12-27 21:36:07,918 INFO L226 Difference]: Without dead ends: 73340 [2019-12-27 21:36:07,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2019-12-27 21:36:08,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73340 states. [2019-12-27 21:36:08,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73340 to 31391. [2019-12-27 21:36:08,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31391 states. [2019-12-27 21:36:08,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31391 states to 31391 states and 100280 transitions. [2019-12-27 21:36:08,717 INFO L78 Accepts]: Start accepts. Automaton has 31391 states and 100280 transitions. Word has length 65 [2019-12-27 21:36:08,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:36:08,718 INFO L462 AbstractCegarLoop]: Abstraction has 31391 states and 100280 transitions. [2019-12-27 21:36:08,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 21:36:08,718 INFO L276 IsEmpty]: Start isEmpty. Operand 31391 states and 100280 transitions. [2019-12-27 21:36:08,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:36:08,754 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:36:08,754 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 21:36:08,754 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 21:36:08,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:36:08,754 INFO L82 PathProgramCache]: Analyzing trace with hash -365883440, now seen corresponding path program 5 times [2019-12-27 21:36:08,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:36:08,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965474991] [2019-12-27 21:36:08,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:36:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:36:08,821 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 21:36:08,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965474991] [2019-12-27 21:36:08,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:36:08,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:36:08,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [797448144] [2019-12-27 21:36:08,822 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:36:08,842 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:36:09,134 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 208 states and 355 transitions. [2019-12-27 21:36:09,135 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:36:09,138 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:36:09,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:36:09,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:36:09,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:36:09,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:36:09,139 INFO L87 Difference]: Start difference. First operand 31391 states and 100280 transitions. Second operand 3 states. [2019-12-27 21:36:09,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:36:09,721 INFO L93 Difference]: Finished difference Result 36076 states and 114574 transitions. [2019-12-27 21:36:09,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:36:09,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 21:36:09,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:36:09,793 INFO L225 Difference]: With dead ends: 36076 [2019-12-27 21:36:09,793 INFO L226 Difference]: Without dead ends: 36076 [2019-12-27 21:36:09,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:36:09,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36076 states. [2019-12-27 21:36:10,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36076 to 27141. [2019-12-27 21:36:10,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27141 states. [2019-12-27 21:36:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27141 states to 27141 states and 85560 transitions. [2019-12-27 21:36:10,297 INFO L78 Accepts]: Start accepts. Automaton has 27141 states and 85560 transitions. Word has length 65 [2019-12-27 21:36:10,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:36:10,297 INFO L462 AbstractCegarLoop]: Abstraction has 27141 states and 85560 transitions. [2019-12-27 21:36:10,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:36:10,297 INFO L276 IsEmpty]: Start isEmpty. Operand 27141 states and 85560 transitions. [2019-12-27 21:36:10,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:36:10,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:36:10,329 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 21:36:10,329 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 21:36:10,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:36:10,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1873623170, now seen corresponding path program 1 times [2019-12-27 21:36:10,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:36:10,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392955758] [2019-12-27 21:36:10,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:36:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:36:10,383 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 21:36:10,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392955758] [2019-12-27 21:36:10,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:36:10,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:36:10,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1932121417] [2019-12-27 21:36:10,384 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:36:10,405 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:36:10,834 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 299 states and 593 transitions. [2019-12-27 21:36:10,835 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:36:10,901 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 21:36:10,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:36:10,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:36:10,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:36:10,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:36:10,902 INFO L87 Difference]: Start difference. First operand 27141 states and 85560 transitions. Second operand 6 states. [2019-12-27 21:36:11,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:36:11,561 INFO L93 Difference]: Finished difference Result 46899 states and 147700 transitions. [2019-12-27 21:36:11,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 21:36:11,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 21:36:11,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:36:11,629 INFO L225 Difference]: With dead ends: 46899 [2019-12-27 21:36:11,629 INFO L226 Difference]: Without dead ends: 46899 [2019-12-27 21:36:11,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:36:11,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46899 states. [2019-12-27 21:36:12,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46899 to 27310. [2019-12-27 21:36:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27310 states. [2019-12-27 21:36:12,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27310 states to 27310 states and 86089 transitions. [2019-12-27 21:36:12,438 INFO L78 Accepts]: Start accepts. Automaton has 27310 states and 86089 transitions. Word has length 66 [2019-12-27 21:36:12,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:36:12,438 INFO L462 AbstractCegarLoop]: Abstraction has 27310 states and 86089 transitions. [2019-12-27 21:36:12,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:36:12,438 INFO L276 IsEmpty]: Start isEmpty. Operand 27310 states and 86089 transitions. [2019-12-27 21:36:12,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:36:12,468 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:36:12,468 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 21:36:12,468 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 21:36:12,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:36:12,468 INFO L82 PathProgramCache]: Analyzing trace with hash 313379346, now seen corresponding path program 2 times [2019-12-27 21:36:12,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:36:12,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77229778] [2019-12-27 21:36:12,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:36:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:36:12,552 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 21:36:12,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77229778] [2019-12-27 21:36:12,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:36:12,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:36:12,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [859727360] [2019-12-27 21:36:12,553 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:36:12,574 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:36:12,800 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 255 states and 498 transitions. [2019-12-27 21:36:12,801 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:36:12,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:36:12,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:36:13,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:36:13,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:36:13,127 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 21:36:13,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:36:13,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:36:13,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:36:13,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:36:13,128 INFO L87 Difference]: Start difference. First operand 27310 states and 86089 transitions. Second operand 12 states. [2019-12-27 21:36:16,043 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 21:36:17,067 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-27 21:36:20,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:36:20,071 INFO L93 Difference]: Finished difference Result 123492 states and 380976 transitions. [2019-12-27 21:36:20,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-12-27 21:36:20,072 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-27 21:36:20,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:36:20,242 INFO L225 Difference]: With dead ends: 123492 [2019-12-27 21:36:20,242 INFO L226 Difference]: Without dead ends: 104992 [2019-12-27 21:36:20,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=784, Invalid=3376, Unknown=0, NotChecked=0, Total=4160 [2019-12-27 21:36:20,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104992 states. [2019-12-27 21:36:21,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104992 to 27755. [2019-12-27 21:36:21,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27755 states. [2019-12-27 21:36:21,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27755 states to 27755 states and 87978 transitions. [2019-12-27 21:36:21,356 INFO L78 Accepts]: Start accepts. Automaton has 27755 states and 87978 transitions. Word has length 66 [2019-12-27 21:36:21,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:36:21,356 INFO L462 AbstractCegarLoop]: Abstraction has 27755 states and 87978 transitions. [2019-12-27 21:36:21,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:36:21,356 INFO L276 IsEmpty]: Start isEmpty. Operand 27755 states and 87978 transitions. [2019-12-27 21:36:21,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:36:21,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:36:21,387 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 21:36:21,387 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 21:36:21,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:36:21,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1323575748, now seen corresponding path program 1 times [2019-12-27 21:36:21,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:36:21,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407850852] [2019-12-27 21:36:21,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:36:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:36:21,629 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 21:36:21,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407850852] [2019-12-27 21:36:21,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:36:21,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 21:36:21,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1127615898] [2019-12-27 21:36:21,630 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:36:21,650 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:36:21,888 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 274 transitions. [2019-12-27 21:36:21,889 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:36:22,140 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 21:36:22,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 21:36:22,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:36:22,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 21:36:22,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-12-27 21:36:22,142 INFO L87 Difference]: Start difference. First operand 27755 states and 87978 transitions. Second operand 16 states. [2019-12-27 21:36:26,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:36:26,222 INFO L93 Difference]: Finished difference Result 60164 states and 185162 transitions. [2019-12-27 21:36:26,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 21:36:26,223 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 21:36:26,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:36:26,316 INFO L225 Difference]: With dead ends: 60164 [2019-12-27 21:36:26,316 INFO L226 Difference]: Without dead ends: 60024 [2019-12-27 21:36:26,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 10 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=284, Invalid=1122, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 21:36:26,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60024 states. [2019-12-27 21:36:27,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60024 to 32263. [2019-12-27 21:36:27,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32263 states. [2019-12-27 21:36:27,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32263 states to 32263 states and 102629 transitions. [2019-12-27 21:36:27,074 INFO L78 Accepts]: Start accepts. Automaton has 32263 states and 102629 transitions. Word has length 66 [2019-12-27 21:36:27,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:36:27,074 INFO L462 AbstractCegarLoop]: Abstraction has 32263 states and 102629 transitions. [2019-12-27 21:36:27,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 21:36:27,074 INFO L276 IsEmpty]: Start isEmpty. Operand 32263 states and 102629 transitions. [2019-12-27 21:36:27,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:36:27,111 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:36:27,112 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 21:36:27,112 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 21:36:27,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:36:27,112 INFO L82 PathProgramCache]: Analyzing trace with hash -871413024, now seen corresponding path program 2 times [2019-12-27 21:36:27,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:36:27,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765146073] [2019-12-27 21:36:27,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:36:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:36:27,165 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 21:36:27,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765146073] [2019-12-27 21:36:27,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:36:27,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:36:27,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1247084842] [2019-12-27 21:36:27,166 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:36:27,186 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:36:27,355 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 162 states and 266 transitions. [2019-12-27 21:36:27,355 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:36:27,359 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 21:36:27,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:36:27,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:36:27,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:36:27,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:36:27,360 INFO L87 Difference]: Start difference. First operand 32263 states and 102629 transitions. Second operand 3 states. [2019-12-27 21:36:27,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:36:27,462 INFO L93 Difference]: Finished difference Result 29494 states and 91748 transitions. [2019-12-27 21:36:27,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:36:27,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 21:36:27,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:36:27,506 INFO L225 Difference]: With dead ends: 29494 [2019-12-27 21:36:27,506 INFO L226 Difference]: Without dead ends: 29494 [2019-12-27 21:36:27,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 4 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 21:36:27,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29494 states. [2019-12-27 21:36:28,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29494 to 28006. [2019-12-27 21:36:28,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28006 states. [2019-12-27 21:36:28,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28006 states to 28006 states and 86982 transitions. [2019-12-27 21:36:28,142 INFO L78 Accepts]: Start accepts. Automaton has 28006 states and 86982 transitions. Word has length 66 [2019-12-27 21:36:28,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:36:28,142 INFO L462 AbstractCegarLoop]: Abstraction has 28006 states and 86982 transitions. [2019-12-27 21:36:28,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:36:28,142 INFO L276 IsEmpty]: Start isEmpty. Operand 28006 states and 86982 transitions. [2019-12-27 21:36:28,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:36:28,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:36:28,188 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 21:36:28,188 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 21:36:28,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:36:28,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1134321916, now seen corresponding path program 1 times [2019-12-27 21:36:28,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:36:28,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141457411] [2019-12-27 21:36:28,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:36:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:36:28,440 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 21:36:28,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141457411] [2019-12-27 21:36:28,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:36:28,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 21:36:28,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [937051407] [2019-12-27 21:36:28,442 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:36:28,462 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:36:28,773 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 335 states and 690 transitions. [2019-12-27 21:36:28,773 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:36:29,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 21:36:29,442 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 21:36:29,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 21:36:29,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:36:29,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 21:36:29,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2019-12-27 21:36:29,444 INFO L87 Difference]: Start difference. First operand 28006 states and 86982 transitions. Second operand 22 states. [2019-12-27 21:36:36,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:36:36,278 INFO L93 Difference]: Finished difference Result 75210 states and 228988 transitions. [2019-12-27 21:36:36,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-12-27 21:36:36,278 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 67 [2019-12-27 21:36:36,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:36:36,364 INFO L225 Difference]: With dead ends: 75210 [2019-12-27 21:36:36,365 INFO L226 Difference]: Without dead ends: 57650 [2019-12-27 21:36:36,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 14 SyntacticMatches, 9 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2294 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1166, Invalid=6666, Unknown=0, NotChecked=0, Total=7832 [2019-12-27 21:36:36,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57650 states. [2019-12-27 21:36:36,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57650 to 31899. [2019-12-27 21:36:36,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31899 states. [2019-12-27 21:36:37,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31899 states to 31899 states and 98420 transitions. [2019-12-27 21:36:37,023 INFO L78 Accepts]: Start accepts. Automaton has 31899 states and 98420 transitions. Word has length 67 [2019-12-27 21:36:37,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:36:37,023 INFO L462 AbstractCegarLoop]: Abstraction has 31899 states and 98420 transitions. [2019-12-27 21:36:37,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 21:36:37,024 INFO L276 IsEmpty]: Start isEmpty. Operand 31899 states and 98420 transitions. [2019-12-27 21:36:37,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:36:37,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:36:37,058 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 21:36:37,058 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 21:36:37,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:36:37,058 INFO L82 PathProgramCache]: Analyzing trace with hash 350960738, now seen corresponding path program 1 times [2019-12-27 21:36:37,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:36:37,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231071672] [2019-12-27 21:36:37,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:36:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:36:37,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:36:37,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231071672] [2019-12-27 21:36:37,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:36:37,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:36:37,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1946566819] [2019-12-27 21:36:37,132 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:36:37,149 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:36:37,423 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 295 states and 559 transitions. [2019-12-27 21:36:37,423 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:36:37,426 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:36:37,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:36:37,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:36:37,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:36:37,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:36:37,427 INFO L87 Difference]: Start difference. First operand 31899 states and 98420 transitions. Second operand 4 states. [2019-12-27 21:36:37,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:36:37,578 INFO L93 Difference]: Finished difference Result 31899 states and 98186 transitions. [2019-12-27 21:36:37,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:36:37,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-27 21:36:37,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:36:37,625 INFO L225 Difference]: With dead ends: 31899 [2019-12-27 21:36:37,625 INFO L226 Difference]: Without dead ends: 31899 [2019-12-27 21:36:37,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 3 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 21:36:37,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31899 states. [2019-12-27 21:36:38,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31899 to 28921. [2019-12-27 21:36:38,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28921 states. [2019-12-27 21:36:38,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28921 states to 28921 states and 89372 transitions. [2019-12-27 21:36:38,308 INFO L78 Accepts]: Start accepts. Automaton has 28921 states and 89372 transitions. Word has length 67 [2019-12-27 21:36:38,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:36:38,309 INFO L462 AbstractCegarLoop]: Abstraction has 28921 states and 89372 transitions. [2019-12-27 21:36:38,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:36:38,309 INFO L276 IsEmpty]: Start isEmpty. Operand 28921 states and 89372 transitions. [2019-12-27 21:36:38,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:36:38,340 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:36:38,341 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 21:36:38,341 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 21:36:38,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:36:38,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1450844730, now seen corresponding path program 2 times [2019-12-27 21:36:38,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:36:38,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563753466] [2019-12-27 21:36:38,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:36:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:36:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:36:38,462 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:36:38,462 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:36:38,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [893] [893] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd0~0_24) (= v_~z$r_buff0_thd3~0_77 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$w_buff1_used~0_77) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1385~0.base_23| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1385~0.base_23|) |v_ULTIMATE.start_main_~#t1385~0.offset_17| 0)) |v_#memory_int_21|) (= 0 v_~z$w_buff1~0_28) (= |v_ULTIMATE.start_main_~#t1385~0.offset_17| 0) (= 0 v_~__unbuffered_cnt~0_21) (= v_~z$r_buff0_thd2~0_19 0) (= 0 v_~weak$$choice2~0_32) (= (select .cse0 |v_ULTIMATE.start_main_~#t1385~0.base_23|) 0) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$r_buff1_thd2~0_18) (= 0 v_~z$mem_tmp~0_9) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p2_EAX~0_16) (= (store .cse0 |v_ULTIMATE.start_main_~#t1385~0.base_23| 1) |v_#valid_64|) (= 0 |v_#NULL.base_6|) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_18 0) (= v_~z~0_27 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1385~0.base_23|) (= v_~z$r_buff0_thd1~0_22 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1385~0.base_23| 4) |v_#length_23|) (= 0 v_~z$flush_delayed~0_12) (= 0 v_~z$w_buff0~0_26) (= 0 v_~z$r_buff1_thd3~0_50) (= 0 v_~__unbuffered_p1_EAX~0_16) (= 0 v_~z$r_buff1_thd1~0_16) (= v_~z$w_buff0_used~0_116 0) (= v_~x~0_16 0) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_18, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ULTIMATE.start_main_~#t1387~0.offset=|v_ULTIMATE.start_main_~#t1387~0.offset_13|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_23|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ULTIMATE.start_main_~#t1387~0.base=|v_ULTIMATE.start_main_~#t1387~0.base_18|, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_77, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ULTIMATE.start_main_~#t1385~0.offset=|v_ULTIMATE.start_main_~#t1385~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_16, ~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_77, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_16, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t1386~0.base=|v_ULTIMATE.start_main_~#t1386~0.base_22|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_19, ULTIMATE.start_main_~#t1386~0.offset=|v_ULTIMATE.start_main_~#t1386~0.offset_17|, ULTIMATE.start_main_~#t1385~0.base=|v_ULTIMATE.start_main_~#t1385~0.base_23|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_26, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_22} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t1387~0.offset, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1386~0.base, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite51, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1387~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1386~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1385~0.base, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1385~0.offset, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 21:36:38,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1386~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1386~0.base_9|) |v_ULTIMATE.start_main_~#t1386~0.offset_8| 1))) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1386~0.base_9| 1)) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1386~0.base_9|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1386~0.base_9|)) (= |v_ULTIMATE.start_main_~#t1386~0.offset_8| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1386~0.base_9| 4)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1386~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1386~0.base=|v_ULTIMATE.start_main_~#t1386~0.base_9|, ULTIMATE.start_main_~#t1386~0.offset=|v_ULTIMATE.start_main_~#t1386~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1386~0.base, ULTIMATE.start_main_~#t1386~0.offset] because there is no mapped edge [2019-12-27 21:36:38,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] P0ENTRY-->L4-3: Formula: (and (= 1 ~z$w_buff0_used~0_Out-1802909904) (= ~z$w_buff0_used~0_In-1802909904 ~z$w_buff1_used~0_Out-1802909904) (= ~z$w_buff0~0_Out-1802909904 1) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1802909904|) (= |P0Thread1of1ForFork0_#in~arg.offset_In-1802909904| P0Thread1of1ForFork0_~arg.offset_Out-1802909904) (= ~z$w_buff1~0_Out-1802909904 ~z$w_buff0~0_In-1802909904) (= 0 (mod ~z$w_buff1_used~0_Out-1802909904 256)) (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1802909904 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1802909904|) (= |P0Thread1of1ForFork0_#in~arg.base_In-1802909904| P0Thread1of1ForFork0_~arg.base_Out-1802909904)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1802909904|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1802909904, ~z$w_buff0~0=~z$w_buff0~0_In-1802909904, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1802909904|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In-1802909904|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out-1802909904, ~z$w_buff0~0=~z$w_buff0~0_Out-1802909904, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-1802909904, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1802909904, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In-1802909904|, ~z$w_buff1~0=~z$w_buff1~0_Out-1802909904, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out-1802909904, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1802909904|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out-1802909904} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 21:36:38,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L822-1-->L824: Formula: (and (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1387~0.base_11|)) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1387~0.base_11| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1387~0.base_11|) (= |v_ULTIMATE.start_main_~#t1387~0.offset_9| 0) (not (= |v_ULTIMATE.start_main_~#t1387~0.base_11| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1387~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1387~0.base_11|) |v_ULTIMATE.start_main_~#t1387~0.offset_9| 2)) |v_#memory_int_15|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1387~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1387~0.offset=|v_ULTIMATE.start_main_~#t1387~0.offset_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1387~0.base=|v_ULTIMATE.start_main_~#t1387~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1387~0.offset, #length, ULTIMATE.start_main_~#t1387~0.base] because there is no mapped edge [2019-12-27 21:36:38,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1544589967 256))) (.cse2 (= (mod ~z$r_buff1_thd2~0_In-1544589967 256) 0)) (.cse0 (= |P1Thread1of1ForFork1_#t~ite9_Out-1544589967| |P1Thread1of1ForFork1_#t~ite10_Out-1544589967|))) (or (and .cse0 (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-1544589967| ~z$w_buff1~0_In-1544589967) (not .cse2)) (and (or .cse1 .cse2) .cse0 (= |P1Thread1of1ForFork1_#t~ite9_Out-1544589967| ~z~0_In-1544589967)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1544589967, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1544589967, ~z$w_buff1~0=~z$w_buff1~0_In-1544589967, ~z~0=~z~0_In-1544589967} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1544589967|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1544589967, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1544589967, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1544589967|, ~z$w_buff1~0=~z$w_buff1~0_In-1544589967, ~z~0=~z~0_In-1544589967} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 21:36:38,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1085426421 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1085426421 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1085426421 |P1Thread1of1ForFork1_#t~ite11_Out1085426421|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1085426421|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1085426421, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1085426421} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1085426421, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1085426421|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1085426421} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 21:36:38,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1995534942 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1995534942 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In1995534942 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1995534942 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1995534942 |P1Thread1of1ForFork1_#t~ite12_Out1995534942|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1995534942|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1995534942, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1995534942, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1995534942, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1995534942} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1995534942, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1995534942, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1995534942, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1995534942|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1995534942} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 21:36:38,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1493901957 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1493901957 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out1493901957|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd2~0_In1493901957 |P1Thread1of1ForFork1_#t~ite13_Out1493901957|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1493901957, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1493901957} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1493901957, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1493901957|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1493901957} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 21:36:38,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L787-->L787-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-221434563 256)))) (or (and (= ~z$w_buff1~0_In-221434563 |P2Thread1of1ForFork2_#t~ite24_Out-221434563|) (= |P2Thread1of1ForFork2_#t~ite23_In-221434563| |P2Thread1of1ForFork2_#t~ite23_Out-221434563|) (not .cse0)) (and (= |P2Thread1of1ForFork2_#t~ite23_Out-221434563| |P2Thread1of1ForFork2_#t~ite24_Out-221434563|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-221434563 256)))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-221434563 256))) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-221434563 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-221434563 256)))) .cse0 (= ~z$w_buff1~0_In-221434563 |P2Thread1of1ForFork2_#t~ite23_Out-221434563|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-221434563|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-221434563, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-221434563, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-221434563, ~z$w_buff1~0=~z$w_buff1~0_In-221434563, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-221434563, ~weak$$choice2~0=~weak$$choice2~0_In-221434563} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-221434563|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-221434563|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-221434563, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-221434563, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-221434563, ~z$w_buff1~0=~z$w_buff1~0_In-221434563, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-221434563, ~weak$$choice2~0=~weak$$choice2~0_In-221434563} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 21:36:38,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L788-->L788-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1110047178 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite26_Out-1110047178| |P2Thread1of1ForFork2_#t~ite27_Out-1110047178|) (= |P2Thread1of1ForFork2_#t~ite26_Out-1110047178| ~z$w_buff0_used~0_In-1110047178) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1110047178 256)))) (or (and .cse0 (= (mod ~z$w_buff1_used~0_In-1110047178 256) 0)) (= (mod ~z$w_buff0_used~0_In-1110047178 256) 0) (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1110047178 256))))) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite26_In-1110047178| |P2Thread1of1ForFork2_#t~ite26_Out-1110047178|) (= |P2Thread1of1ForFork2_#t~ite27_Out-1110047178| ~z$w_buff0_used~0_In-1110047178)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-1110047178|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1110047178, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1110047178, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1110047178, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1110047178, ~weak$$choice2~0=~weak$$choice2~0_In-1110047178} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-1110047178|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1110047178, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1110047178, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1110047178, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1110047178, ~weak$$choice2~0=~weak$$choice2~0_In-1110047178, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-1110047178|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-27 21:36:38,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1951255920 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1951255920 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1951255920 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-1951255920 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1951255920|)) (and (or .cse1 .cse0) (= ~z$r_buff1_thd2~0_In-1951255920 |P1Thread1of1ForFork1_#t~ite14_Out-1951255920|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1951255920, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1951255920, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1951255920, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1951255920} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1951255920, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1951255920, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1951255920, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1951255920|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1951255920} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 21:36:38,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~z$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork1_#t~ite14_8|)) 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_13, ~__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 21:36:38,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L789-->L789-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1256308102 256)))) (or (and .cse0 (= |P2Thread1of1ForFork2_#t~ite29_Out-1256308102| |P2Thread1of1ForFork2_#t~ite30_Out-1256308102|) (= |P2Thread1of1ForFork2_#t~ite29_Out-1256308102| ~z$w_buff1_used~0_In-1256308102) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1256308102 256) 0))) (or (= (mod ~z$w_buff0_used~0_In-1256308102 256) 0) (and (= 0 (mod ~z$w_buff1_used~0_In-1256308102 256)) .cse1) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1256308102 256)))))) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite29_In-1256308102| |P2Thread1of1ForFork2_#t~ite29_Out-1256308102|) (= |P2Thread1of1ForFork2_#t~ite30_Out-1256308102| ~z$w_buff1_used~0_In-1256308102)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1256308102, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1256308102, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1256308102, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1256308102, ~weak$$choice2~0=~weak$$choice2~0_In-1256308102, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-1256308102|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-1256308102|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1256308102, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1256308102, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1256308102, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1256308102, ~weak$$choice2~0=~weak$$choice2~0_In-1256308102, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-1256308102|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-27 21:36:38,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff0_thd3~0_51)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 21:36:38,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (not (= 0 (mod v_~z$flush_delayed~0_7 256))) (= v_~z~0_18 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 21:36:38,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1586738438 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1586738438 256)))) (or (and (= ~z$w_buff0_used~0_In-1586738438 |P0Thread1of1ForFork0_#t~ite5_Out-1586738438|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1586738438|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1586738438, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1586738438} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1586738438|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1586738438, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1586738438} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:36:38,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1633348576 256))) (.cse0 (= (mod ~z$r_buff1_thd1~0_In-1633348576 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1633348576 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-1633348576 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1633348576| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite6_Out-1633348576| ~z$w_buff1_used~0_In-1633348576) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1633348576, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1633348576, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1633348576, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1633348576} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1633348576|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1633348576, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1633348576, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1633348576, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1633348576} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:36:38,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In209036835 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In209036835 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In209036835 ~z$r_buff0_thd1~0_Out209036835)) (and (not .cse1) (not .cse0) (= ~z$r_buff0_thd1~0_Out209036835 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In209036835, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In209036835} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In209036835, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out209036835|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out209036835} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:36:38,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In243547558 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In243547558 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In243547558 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In243547558 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out243547558|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd1~0_In243547558 |P0Thread1of1ForFork0_#t~ite8_Out243547558|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In243547558, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In243547558, ~z$w_buff1_used~0=~z$w_buff1_used~0_In243547558, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In243547558} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In243547558, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out243547558|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In243547558, ~z$w_buff1_used~0=~z$w_buff1_used~0_In243547558, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In243547558} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:36:38,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L748-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} 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_12, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} 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 21:36:38,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1934489982 256))) (.cse0 (= |P2Thread1of1ForFork2_#t~ite39_Out-1934489982| |P2Thread1of1ForFork2_#t~ite38_Out-1934489982|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1934489982 256)))) (or (and .cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out-1934489982| ~z~0_In-1934489982) (or .cse1 .cse2)) (and (not .cse1) .cse0 (= |P2Thread1of1ForFork2_#t~ite38_Out-1934489982| ~z$w_buff1~0_In-1934489982) (not .cse2)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1934489982, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1934489982, ~z$w_buff1~0=~z$w_buff1~0_In-1934489982, ~z~0=~z~0_In-1934489982} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1934489982, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1934489982, ~z$w_buff1~0=~z$w_buff1~0_In-1934489982, ~z~0=~z~0_In-1934489982, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-1934489982|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-1934489982|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-27 21:36:38,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1097960995 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1097960995 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1097960995 |P2Thread1of1ForFork2_#t~ite40_Out-1097960995|)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out-1097960995|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1097960995, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1097960995} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1097960995, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1097960995, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-1097960995|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-27 21:36:38,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd3~0_In-657014615 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-657014615 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-657014615 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-657014615 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite41_Out-657014615| 0)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite41_Out-657014615| ~z$w_buff1_used~0_In-657014615) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-657014615, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-657014615, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-657014615, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-657014615} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-657014615|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-657014615, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-657014615, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-657014615, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-657014615} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-27 21:36:38,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-765260762 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-765260762 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite42_Out-765260762| ~z$r_buff0_thd3~0_In-765260762) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite42_Out-765260762| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-765260762, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-765260762} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-765260762|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-765260762, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-765260762} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-27 21:36:38,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-686616996 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-686616996 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-686616996 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-686616996 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite43_Out-686616996| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In-686616996 |P2Thread1of1ForFork2_#t~ite43_Out-686616996|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-686616996, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-686616996, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-686616996, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-686616996} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-686616996, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-686616996, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-686616996|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-686616996, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-686616996} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-27 21:36:38,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite43_8| v_~z$r_buff1_thd3~0_42) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_42, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_7|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 21:36:38,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:36:38,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out-256754882| |ULTIMATE.start_main_#t~ite48_Out-256754882|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-256754882 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-256754882 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-256754882| ~z~0_In-256754882) .cse0 (or .cse1 .cse2)) (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-256754882| ~z$w_buff1~0_In-256754882) (not .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-256754882, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-256754882, ~z$w_buff1~0=~z$w_buff1~0_In-256754882, ~z~0=~z~0_In-256754882} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-256754882, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-256754882|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-256754882, ~z$w_buff1~0=~z$w_buff1~0_In-256754882, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-256754882|, ~z~0=~z~0_In-256754882} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 21:36:38,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1822204268 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1822204268 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-1822204268| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out-1822204268| ~z$w_buff0_used~0_In-1822204268) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1822204268, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1822204268} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1822204268, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1822204268, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1822204268|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 21:36:38,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-918349150 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-918349150 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-918349150 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-918349150 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-918349150 |ULTIMATE.start_main_#t~ite50_Out-918349150|)) (and (= |ULTIMATE.start_main_#t~ite50_Out-918349150| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-918349150, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-918349150, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-918349150, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-918349150} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-918349150|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-918349150, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-918349150, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-918349150, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-918349150} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 21:36:38,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-936857679 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-936857679 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-936857679| 0)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In-936857679 |ULTIMATE.start_main_#t~ite51_Out-936857679|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-936857679, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-936857679} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-936857679, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-936857679|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-936857679} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 21:36:38,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-2056513836 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-2056513836 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-2056513836 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-2056513836 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In-2056513836 |ULTIMATE.start_main_#t~ite52_Out-2056513836|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-2056513836|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2056513836, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2056513836, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2056513836, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2056513836} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-2056513836|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2056513836, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2056513836, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2056513836, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2056513836} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 21:36:38,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= 2 v_~x~0_8) (= |v_ULTIMATE.start_main_#t~ite52_10| v_~z$r_buff1_thd0~0_16) (= v_~__unbuffered_p2_EAX~0_8 0) (= 0 v_~__unbuffered_p1_EAX~0_8) (= 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_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_8} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:36:38,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:36:38 BasicIcfg [2019-12-27 21:36:38,603 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:36:38,604 INFO L168 Benchmark]: Toolchain (without parser) took 110471.49 ms. Allocated memory was 145.2 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 101.3 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 746.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:36:38,605 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 21:36:38,605 INFO L168 Benchmark]: CACSL2BoogieTranslator took 725.60 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 100.8 MB in the beginning and 154.8 MB in the end (delta: -53.9 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:36:38,606 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.66 ms. Allocated memory is still 201.9 MB. Free memory was 154.8 MB in the beginning and 152.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:36:38,607 INFO L168 Benchmark]: Boogie Preprocessor took 45.83 ms. Allocated memory is still 201.9 MB. Free memory was 151.9 MB in the beginning and 150.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:36:38,607 INFO L168 Benchmark]: RCFGBuilder took 899.72 ms. Allocated memory is still 201.9 MB. Free memory was 150.0 MB in the beginning and 100.0 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-27 21:36:38,608 INFO L168 Benchmark]: TraceAbstraction took 108732.03 ms. Allocated memory was 201.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 100.0 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 688.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:36:38,611 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.22 ms. Allocated memory is still 145.2 MB. Free memory is still 121.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 725.60 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 100.8 MB in the beginning and 154.8 MB in the end (delta: -53.9 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.66 ms. Allocated memory is still 201.9 MB. Free memory was 154.8 MB in the beginning and 152.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.83 ms. Allocated memory is still 201.9 MB. Free memory was 151.9 MB in the beginning and 150.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 899.72 ms. Allocated memory is still 201.9 MB. Free memory was 150.0 MB in the beginning and 100.0 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 108732.03 ms. Allocated memory was 201.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 100.0 MB in the beginning and 2.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 688.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 101 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 6848 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 80960 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t1385, ((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=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t1386, ((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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1387, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __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=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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __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=2, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] EXPR 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=0, __unbuffered_p1_EAX=0, __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=2, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 y = 1 [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [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 [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, 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=1, 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 [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 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 [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 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=0, __unbuffered_p2_EAX=0, 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=2, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 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 [L833] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 108.4s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 42.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5247 SDtfs, 9789 SDslu, 19203 SDs, 0 SdLazy, 15427 SolverSat, 617 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 579 GetRequests, 154 SyntacticMatches, 81 SemanticMatches, 344 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4407 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145638occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 35.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 367933 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1123 NumberOfCodeBlocks, 1123 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1033 ConstructedInterpolants, 0 QuantifiedInterpolants, 208055 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...