/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe013_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:15:14,622 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:15:14,625 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:15:14,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:15:14,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:15:14,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:15:14,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:15:14,664 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:15:14,666 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:15:14,667 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:15:14,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:15:14,671 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:15:14,671 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:15:14,672 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:15:14,676 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:15:14,677 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:15:14,680 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:15:14,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:15:14,683 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:15:14,685 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:15:14,690 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:15:14,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:15:14,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:15:14,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:15:14,698 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:15:14,698 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:15:14,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:15:14,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:15:14,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:15:14,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:15:14,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:15:14,705 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:15:14,705 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:15:14,706 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:15:14,708 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:15:14,708 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:15:14,709 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:15:14,709 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:15:14,709 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:15:14,710 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:15:14,710 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:15:14,711 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:15:14,724 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:15:14,725 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:15:14,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:15:14,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:15:14,727 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:15:14,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:15:14,727 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:15:14,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:15:14,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:15:14,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:15:14,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:15:14,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:15:14,728 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:15:14,728 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:15:14,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:15:14,729 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:15:14,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:15:14,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:15:14,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:15:14,730 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:15:14,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:15:14,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:15:14,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:15:14,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:15:14,731 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:15:14,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:15:14,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:15:14,731 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:15:14,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:15:14,731 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:15:14,732 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:15:15,051 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:15:15,069 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:15:15,073 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:15:15,074 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:15:15,075 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:15:15,076 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_rmo.oepc.i [2019-12-27 18:15:15,146 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a1b1f7ac/6a70d05afa6d46148f122df9813281de/FLAG09760c915 [2019-12-27 18:15:15,684 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:15:15,684 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_rmo.oepc.i [2019-12-27 18:15:15,700 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a1b1f7ac/6a70d05afa6d46148f122df9813281de/FLAG09760c915 [2019-12-27 18:15:15,947 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a1b1f7ac/6a70d05afa6d46148f122df9813281de [2019-12-27 18:15:15,956 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:15:15,958 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:15:15,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:15:15,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:15:15,963 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:15:15,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:15:15" (1/1) ... [2019-12-27 18:15:15,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26764534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:15:15, skipping insertion in model container [2019-12-27 18:15:15,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:15:15" (1/1) ... [2019-12-27 18:15:15,975 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:15:16,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:15:16,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:15:16,744 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:15:16,849 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:15:16,919 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:15:16,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:15:16 WrapperNode [2019-12-27 18:15:16,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:15:16,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:15:16,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:15:16,921 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:15:16,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:15:16" (1/1) ... [2019-12-27 18:15:16,956 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:15:16" (1/1) ... [2019-12-27 18:15:16,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:15:16,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:15:16,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:15:16,990 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:15:17,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:15:16" (1/1) ... [2019-12-27 18:15:17,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:15:16" (1/1) ... [2019-12-27 18:15:17,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:15:16" (1/1) ... [2019-12-27 18:15:17,009 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:15:16" (1/1) ... [2019-12-27 18:15:17,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:15:16" (1/1) ... [2019-12-27 18:15:17,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:15:16" (1/1) ... [2019-12-27 18:15:17,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:15:16" (1/1) ... [2019-12-27 18:15:17,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:15:17,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:15:17,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:15:17,032 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:15:17,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:15:16" (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 18:15:17,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:15:17,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:15:17,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:15:17,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:15:17,130 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:15:17,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:15:17,130 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:15:17,131 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:15:17,131 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:15:17,131 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:15:17,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:15:17,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:15:17,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:15:17,134 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 18:15:17,877 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:15:17,878 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:15:17,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:15:17 BoogieIcfgContainer [2019-12-27 18:15:17,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:15:17,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:15:17,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:15:17,884 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:15:17,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:15:15" (1/3) ... [2019-12-27 18:15:17,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ee5e62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:15:17, skipping insertion in model container [2019-12-27 18:15:17,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:15:16" (2/3) ... [2019-12-27 18:15:17,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ee5e62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:15:17, skipping insertion in model container [2019-12-27 18:15:17,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:15:17" (3/3) ... [2019-12-27 18:15:17,888 INFO L109 eAbstractionObserver]: Analyzing ICFG safe013_rmo.oepc.i [2019-12-27 18:15:17,898 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:15:17,898 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:15:17,906 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:15:17,907 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:15:17,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,946 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,947 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,970 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,970 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,971 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,971 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,988 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,995 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,995 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,995 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,996 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,998 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:17,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,004 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,004 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,004 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,010 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,011 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,015 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,015 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,016 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:15:18,034 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:15:18,054 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:15:18,054 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:15:18,054 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:15:18,054 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:15:18,055 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:15:18,055 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:15:18,055 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:15:18,055 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:15:18,072 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-27 18:15:18,074 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 18:15:18,189 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 18:15:18,190 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:15:18,205 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:15:18,228 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-27 18:15:18,279 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-27 18:15:18,279 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:15:18,287 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:15:18,307 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 18:15:18,308 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:15:23,690 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 18:15:23,800 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 18:15:23,908 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66094 [2019-12-27 18:15:23,908 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 18:15:23,912 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-27 18:15:35,242 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-27 18:15:35,244 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-27 18:15:35,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 18:15:35,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:15:35,252 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 18:15:35,252 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:15:35,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:15:35,258 INFO L82 PathProgramCache]: Analyzing trace with hash 794637732, now seen corresponding path program 1 times [2019-12-27 18:15:35,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:15:35,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216472715] [2019-12-27 18:15:35,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:15:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:15:35,498 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 18:15:35,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216472715] [2019-12-27 18:15:35,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:15:35,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:15:35,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2056393769] [2019-12-27 18:15:35,501 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:15:35,505 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:15:35,514 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 18:15:35,514 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:15:35,518 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:15:35,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:15:35,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:15:35,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:15:35,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:15:35,532 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-27 18:15:38,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:15:38,502 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-27 18:15:38,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:15:38,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 18:15:38,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:15:39,070 INFO L225 Difference]: With dead ends: 85012 [2019-12-27 18:15:39,070 INFO L226 Difference]: Without dead ends: 80140 [2019-12-27 18:15:39,072 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 18:15:44,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-27 18:15:45,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-27 18:15:45,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-27 18:15:49,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-27 18:15:49,111 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-27 18:15:49,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:15:49,111 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-27 18:15:49,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:15:49,111 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-27 18:15:49,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:15:49,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:15:49,122 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:15:49,122 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:15:49,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:15:49,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1795694344, now seen corresponding path program 1 times [2019-12-27 18:15:49,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:15:49,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094617464] [2019-12-27 18:15:49,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:15:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:15:49,233 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 18:15:49,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094617464] [2019-12-27 18:15:49,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:15:49,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:15:49,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [888502175] [2019-12-27 18:15:49,235 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:15:49,237 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:15:49,241 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:15:49,241 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:15:49,242 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:15:49,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:15:49,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:15:49,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:15:49,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:15:49,244 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-27 18:15:50,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:15:50,336 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-27 18:15:50,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:15:50,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:15:50,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:15:51,575 INFO L225 Difference]: With dead ends: 123388 [2019-12-27 18:15:51,575 INFO L226 Difference]: Without dead ends: 123290 [2019-12-27 18:15:51,576 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 18:15:58,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-27 18:16:00,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-27 18:16:00,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-27 18:16:01,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-27 18:16:01,213 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-27 18:16:01,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:16:01,214 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-27 18:16:01,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:16:01,214 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-27 18:16:01,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:16:01,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:16:01,217 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:16:01,218 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:16:01,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:16:01,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1307118492, now seen corresponding path program 1 times [2019-12-27 18:16:01,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:16:01,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953782234] [2019-12-27 18:16:01,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:16:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:16:01,294 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 18:16:01,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953782234] [2019-12-27 18:16:01,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:16:01,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:16:01,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1949576754] [2019-12-27 18:16:01,296 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:16:01,297 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:16:01,299 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:16:01,299 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:16:01,299 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:16:01,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:16:01,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:16:01,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:16:01,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:16:01,300 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-27 18:16:05,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:16:05,896 INFO L93 Difference]: Finished difference Result 159677 states and 652290 transitions. [2019-12-27 18:16:05,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:16:05,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:16:05,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:16:06,668 INFO L225 Difference]: With dead ends: 159677 [2019-12-27 18:16:06,669 INFO L226 Difference]: Without dead ends: 159565 [2019-12-27 18:16:06,669 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 18:16:11,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159565 states. [2019-12-27 18:16:14,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159565 to 136035. [2019-12-27 18:16:14,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136035 states. [2019-12-27 18:16:21,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136035 states to 136035 states and 564894 transitions. [2019-12-27 18:16:21,956 INFO L78 Accepts]: Start accepts. Automaton has 136035 states and 564894 transitions. Word has length 13 [2019-12-27 18:16:21,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:16:21,957 INFO L462 AbstractCegarLoop]: Abstraction has 136035 states and 564894 transitions. [2019-12-27 18:16:21,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:16:21,957 INFO L276 IsEmpty]: Start isEmpty. Operand 136035 states and 564894 transitions. [2019-12-27 18:16:21,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:16:21,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:16:21,962 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:16:21,962 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:16:21,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:16:21,963 INFO L82 PathProgramCache]: Analyzing trace with hash 2137171342, now seen corresponding path program 1 times [2019-12-27 18:16:21,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:16:21,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294484605] [2019-12-27 18:16:21,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:16:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:16:22,015 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 18:16:22,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294484605] [2019-12-27 18:16:22,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:16:22,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:16:22,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1101542216] [2019-12-27 18:16:22,016 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:16:22,021 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:16:22,025 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:16:22,025 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:16:22,074 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:16:22,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:16:22,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:16:22,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:16:22,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:16:22,075 INFO L87 Difference]: Start difference. First operand 136035 states and 564894 transitions. Second operand 5 states. [2019-12-27 18:16:23,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:16:23,017 INFO L93 Difference]: Finished difference Result 181618 states and 742473 transitions. [2019-12-27 18:16:23,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:16:23,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:16:23,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:16:25,306 INFO L225 Difference]: With dead ends: 181618 [2019-12-27 18:16:25,306 INFO L226 Difference]: Without dead ends: 181618 [2019-12-27 18:16:25,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:16:30,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181618 states. [2019-12-27 18:16:39,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181618 to 152081. [2019-12-27 18:16:39,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152081 states. [2019-12-27 18:16:40,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152081 states to 152081 states and 628919 transitions. [2019-12-27 18:16:40,380 INFO L78 Accepts]: Start accepts. Automaton has 152081 states and 628919 transitions. Word has length 14 [2019-12-27 18:16:40,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:16:40,381 INFO L462 AbstractCegarLoop]: Abstraction has 152081 states and 628919 transitions. [2019-12-27 18:16:40,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:16:40,381 INFO L276 IsEmpty]: Start isEmpty. Operand 152081 states and 628919 transitions. [2019-12-27 18:16:40,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:16:40,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:16:40,384 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:16:40,384 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:16:40,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:16:40,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2137037670, now seen corresponding path program 1 times [2019-12-27 18:16:40,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:16:40,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349771889] [2019-12-27 18:16:40,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:16:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:16:40,478 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 18:16:40,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349771889] [2019-12-27 18:16:40,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:16:40,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:16:40,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2050639175] [2019-12-27 18:16:40,479 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:16:40,481 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:16:40,485 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:16:40,485 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:16:40,508 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:16:40,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:16:40,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:16:40,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:16:40,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:16:40,509 INFO L87 Difference]: Start difference. First operand 152081 states and 628919 transitions. Second operand 5 states. [2019-12-27 18:16:42,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:16:42,491 INFO L93 Difference]: Finished difference Result 179622 states and 732719 transitions. [2019-12-27 18:16:42,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:16:42,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:16:42,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:16:43,034 INFO L225 Difference]: With dead ends: 179622 [2019-12-27 18:16:43,034 INFO L226 Difference]: Without dead ends: 179542 [2019-12-27 18:16:43,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:16:53,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179542 states. [2019-12-27 18:16:56,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179542 to 157787. [2019-12-27 18:16:56,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157787 states. [2019-12-27 18:16:57,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157787 states to 157787 states and 651479 transitions. [2019-12-27 18:16:57,112 INFO L78 Accepts]: Start accepts. Automaton has 157787 states and 651479 transitions. Word has length 14 [2019-12-27 18:16:57,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:16:57,113 INFO L462 AbstractCegarLoop]: Abstraction has 157787 states and 651479 transitions. [2019-12-27 18:16:57,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:16:57,113 INFO L276 IsEmpty]: Start isEmpty. Operand 157787 states and 651479 transitions. [2019-12-27 18:16:57,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:16:57,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:16:57,117 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:16:57,118 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:16:57,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:16:57,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1997758702, now seen corresponding path program 1 times [2019-12-27 18:16:57,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:16:57,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489350448] [2019-12-27 18:16:57,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:16:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:16:57,212 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 18:16:57,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489350448] [2019-12-27 18:16:57,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:16:57,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:16:57,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2052454572] [2019-12-27 18:16:57,214 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:16:57,215 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:16:57,220 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:16:57,220 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:16:57,243 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:16:57,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:16:57,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:16:57,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:16:57,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:16:57,245 INFO L87 Difference]: Start difference. First operand 157787 states and 651479 transitions. Second operand 5 states. [2019-12-27 18:17:03,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:03,515 INFO L93 Difference]: Finished difference Result 189091 states and 772001 transitions. [2019-12-27 18:17:03,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:17:03,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:17:03,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:04,100 INFO L225 Difference]: With dead ends: 189091 [2019-12-27 18:17:04,100 INFO L226 Difference]: Without dead ends: 188995 [2019-12-27 18:17:04,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:17:09,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188995 states. [2019-12-27 18:17:11,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188995 to 161868. [2019-12-27 18:17:11,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161868 states. [2019-12-27 18:17:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161868 states to 161868 states and 668265 transitions. [2019-12-27 18:17:13,653 INFO L78 Accepts]: Start accepts. Automaton has 161868 states and 668265 transitions. Word has length 14 [2019-12-27 18:17:13,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:13,654 INFO L462 AbstractCegarLoop]: Abstraction has 161868 states and 668265 transitions. [2019-12-27 18:17:13,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:17:13,654 INFO L276 IsEmpty]: Start isEmpty. Operand 161868 states and 668265 transitions. [2019-12-27 18:17:13,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 18:17:13,674 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:13,674 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:17:13,674 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:13,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:13,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1754746770, now seen corresponding path program 1 times [2019-12-27 18:17:13,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:13,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743644760] [2019-12-27 18:17:13,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:13,728 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 18:17:13,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743644760] [2019-12-27 18:17:13,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:13,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:17:13,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [762040922] [2019-12-27 18:17:13,730 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:13,732 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:13,734 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 24 transitions. [2019-12-27 18:17:13,734 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:13,735 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:17:13,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:17:13,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:13,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:17:13,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:17:13,736 INFO L87 Difference]: Start difference. First operand 161868 states and 668265 transitions. Second operand 3 states. [2019-12-27 18:17:14,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:14,526 INFO L93 Difference]: Finished difference Result 160940 states and 664422 transitions. [2019-12-27 18:17:14,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:17:14,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 18:17:14,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:16,780 INFO L225 Difference]: With dead ends: 160940 [2019-12-27 18:17:16,781 INFO L226 Difference]: Without dead ends: 160940 [2019-12-27 18:17:16,781 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 18:17:27,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160940 states. [2019-12-27 18:17:29,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160940 to 160940. [2019-12-27 18:17:29,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160940 states. [2019-12-27 18:17:30,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160940 states to 160940 states and 664422 transitions. [2019-12-27 18:17:30,503 INFO L78 Accepts]: Start accepts. Automaton has 160940 states and 664422 transitions. Word has length 18 [2019-12-27 18:17:30,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:30,504 INFO L462 AbstractCegarLoop]: Abstraction has 160940 states and 664422 transitions. [2019-12-27 18:17:30,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:17:30,504 INFO L276 IsEmpty]: Start isEmpty. Operand 160940 states and 664422 transitions. [2019-12-27 18:17:30,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:17:30,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:30,522 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:17:30,523 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:30,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:30,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1406595818, now seen corresponding path program 1 times [2019-12-27 18:17:30,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:30,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475381239] [2019-12-27 18:17:30,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:30,581 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 18:17:30,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475381239] [2019-12-27 18:17:30,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:30,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:17:30,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1361041053] [2019-12-27 18:17:30,582 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:30,585 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:30,591 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 50 transitions. [2019-12-27 18:17:30,591 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:30,603 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:17:30,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:17:30,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:30,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:17:30,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:17:30,604 INFO L87 Difference]: Start difference. First operand 160940 states and 664422 transitions. Second operand 5 states. [2019-12-27 18:17:40,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:40,569 INFO L93 Difference]: Finished difference Result 320677 states and 1339367 transitions. [2019-12-27 18:17:40,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:17:40,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 18:17:40,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:41,244 INFO L225 Difference]: With dead ends: 320677 [2019-12-27 18:17:41,245 INFO L226 Difference]: Without dead ends: 193709 [2019-12-27 18:17:41,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:17:45,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193709 states. [2019-12-27 18:17:48,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193709 to 128270. [2019-12-27 18:17:48,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128270 states. [2019-12-27 18:17:48,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128270 states to 128270 states and 523459 transitions. [2019-12-27 18:17:48,791 INFO L78 Accepts]: Start accepts. Automaton has 128270 states and 523459 transitions. Word has length 19 [2019-12-27 18:17:48,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:48,792 INFO L462 AbstractCegarLoop]: Abstraction has 128270 states and 523459 transitions. [2019-12-27 18:17:48,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:17:48,792 INFO L276 IsEmpty]: Start isEmpty. Operand 128270 states and 523459 transitions. [2019-12-27 18:17:48,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:17:48,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:48,806 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:17:48,806 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:48,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:48,807 INFO L82 PathProgramCache]: Analyzing trace with hash -2069277611, now seen corresponding path program 1 times [2019-12-27 18:17:48,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:48,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522909569] [2019-12-27 18:17:48,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:48,916 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 18:17:48,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522909569] [2019-12-27 18:17:48,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:48,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:17:48,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [410607674] [2019-12-27 18:17:48,920 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:48,921 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:48,928 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 31 transitions. [2019-12-27 18:17:48,929 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:48,965 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:17:48,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:17:48,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:48,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:17:48,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:17:48,967 INFO L87 Difference]: Start difference. First operand 128270 states and 523459 transitions. Second operand 5 states. [2019-12-27 18:17:49,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:49,352 INFO L93 Difference]: Finished difference Result 38627 states and 132853 transitions. [2019-12-27 18:17:49,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:17:49,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 18:17:49,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:49,419 INFO L225 Difference]: With dead ends: 38627 [2019-12-27 18:17:49,420 INFO L226 Difference]: Without dead ends: 30749 [2019-12-27 18:17:49,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:17:49,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30749 states. [2019-12-27 18:17:50,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30749 to 28545. [2019-12-27 18:17:50,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28545 states. [2019-12-27 18:17:50,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28545 states to 28545 states and 94430 transitions. [2019-12-27 18:17:50,977 INFO L78 Accepts]: Start accepts. Automaton has 28545 states and 94430 transitions. Word has length 19 [2019-12-27 18:17:50,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:50,977 INFO L462 AbstractCegarLoop]: Abstraction has 28545 states and 94430 transitions. [2019-12-27 18:17:50,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:17:50,977 INFO L276 IsEmpty]: Start isEmpty. Operand 28545 states and 94430 transitions. [2019-12-27 18:17:50,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:17:50,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:50,983 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 18:17:50,983 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:50,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:50,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1918737222, now seen corresponding path program 1 times [2019-12-27 18:17:50,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:50,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245909586] [2019-12-27 18:17:50,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:51,038 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 18:17:51,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245909586] [2019-12-27 18:17:51,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:51,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:17:51,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1788279730] [2019-12-27 18:17:51,040 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:51,043 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:51,057 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 112 transitions. [2019-12-27 18:17:51,057 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:51,072 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:17:51,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:17:51,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:51,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:17:51,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:17:51,074 INFO L87 Difference]: Start difference. First operand 28545 states and 94430 transitions. Second operand 6 states. [2019-12-27 18:17:51,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:51,526 INFO L93 Difference]: Finished difference Result 37265 states and 121195 transitions. [2019-12-27 18:17:51,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 18:17:51,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 18:17:51,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:51,590 INFO L225 Difference]: With dead ends: 37265 [2019-12-27 18:17:51,590 INFO L226 Difference]: Without dead ends: 36963 [2019-12-27 18:17:51,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:17:51,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36963 states. [2019-12-27 18:17:52,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36963 to 29525. [2019-12-27 18:17:52,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29525 states. [2019-12-27 18:17:52,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29525 states to 29525 states and 97651 transitions. [2019-12-27 18:17:52,175 INFO L78 Accepts]: Start accepts. Automaton has 29525 states and 97651 transitions. Word has length 22 [2019-12-27 18:17:52,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:52,175 INFO L462 AbstractCegarLoop]: Abstraction has 29525 states and 97651 transitions. [2019-12-27 18:17:52,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:17:52,176 INFO L276 IsEmpty]: Start isEmpty. Operand 29525 states and 97651 transitions. [2019-12-27 18:17:52,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:17:52,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:52,181 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 18:17:52,181 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:52,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:52,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1233781658, now seen corresponding path program 1 times [2019-12-27 18:17:52,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:52,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117177671] [2019-12-27 18:17:52,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:52,237 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 18:17:52,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117177671] [2019-12-27 18:17:52,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:52,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:17:52,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [250212344] [2019-12-27 18:17:52,238 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:52,241 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:52,255 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 112 transitions. [2019-12-27 18:17:52,255 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:53,723 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:17:53,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:17:53,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:53,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:17:53,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:17:53,724 INFO L87 Difference]: Start difference. First operand 29525 states and 97651 transitions. Second operand 6 states. [2019-12-27 18:17:54,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:54,218 INFO L93 Difference]: Finished difference Result 37362 states and 121787 transitions. [2019-12-27 18:17:54,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 18:17:54,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 18:17:54,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:54,276 INFO L225 Difference]: With dead ends: 37362 [2019-12-27 18:17:54,277 INFO L226 Difference]: Without dead ends: 36942 [2019-12-27 18:17:54,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:17:54,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36942 states. [2019-12-27 18:17:54,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36942 to 28461. [2019-12-27 18:17:54,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28461 states. [2019-12-27 18:17:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28461 states to 28461 states and 94342 transitions. [2019-12-27 18:17:54,832 INFO L78 Accepts]: Start accepts. Automaton has 28461 states and 94342 transitions. Word has length 22 [2019-12-27 18:17:54,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:54,833 INFO L462 AbstractCegarLoop]: Abstraction has 28461 states and 94342 transitions. [2019-12-27 18:17:54,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:17:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 28461 states and 94342 transitions. [2019-12-27 18:17:54,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:17:54,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:54,841 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 18:17:54,841 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:54,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:54,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1628067424, now seen corresponding path program 1 times [2019-12-27 18:17:54,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:54,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945847082] [2019-12-27 18:17:54,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:54,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 18:17:54,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945847082] [2019-12-27 18:17:54,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:54,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:17:54,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1996407191] [2019-12-27 18:17:54,943 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:54,947 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:54,952 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:17:54,952 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:54,952 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:17:54,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:17:54,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:54,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:17:54,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:17:54,954 INFO L87 Difference]: Start difference. First operand 28461 states and 94342 transitions. Second operand 5 states. [2019-12-27 18:17:55,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:55,301 INFO L93 Difference]: Finished difference Result 28874 states and 95112 transitions. [2019-12-27 18:17:55,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:17:55,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 18:17:55,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:55,354 INFO L225 Difference]: With dead ends: 28874 [2019-12-27 18:17:55,354 INFO L226 Difference]: Without dead ends: 28434 [2019-12-27 18:17:55,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:17:55,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28434 states. [2019-12-27 18:17:55,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28434 to 28291. [2019-12-27 18:17:55,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28291 states. [2019-12-27 18:17:56,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28291 states to 28291 states and 93821 transitions. [2019-12-27 18:17:56,044 INFO L78 Accepts]: Start accepts. Automaton has 28291 states and 93821 transitions. Word has length 25 [2019-12-27 18:17:56,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:56,044 INFO L462 AbstractCegarLoop]: Abstraction has 28291 states and 93821 transitions. [2019-12-27 18:17:56,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:17:56,044 INFO L276 IsEmpty]: Start isEmpty. Operand 28291 states and 93821 transitions. [2019-12-27 18:17:56,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 18:17:56,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:56,057 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:17:56,057 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:56,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:56,057 INFO L82 PathProgramCache]: Analyzing trace with hash -126544367, now seen corresponding path program 1 times [2019-12-27 18:17:56,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:56,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285134788] [2019-12-27 18:17:56,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:56,138 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 18:17:56,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285134788] [2019-12-27 18:17:56,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:56,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:17:56,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [253772207] [2019-12-27 18:17:56,140 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:56,145 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:56,166 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 148 transitions. [2019-12-27 18:17:56,167 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:56,180 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:17:56,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:17:56,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:56,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:17:56,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:17:56,181 INFO L87 Difference]: Start difference. First operand 28291 states and 93821 transitions. Second operand 6 states. [2019-12-27 18:17:56,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:56,564 INFO L93 Difference]: Finished difference Result 37145 states and 121294 transitions. [2019-12-27 18:17:56,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:17:56,564 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 18:17:56,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:56,625 INFO L225 Difference]: With dead ends: 37145 [2019-12-27 18:17:56,626 INFO L226 Difference]: Without dead ends: 36771 [2019-12-27 18:17:56,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:17:56,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36771 states. [2019-12-27 18:17:57,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36771 to 29755. [2019-12-27 18:17:57,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29755 states. [2019-12-27 18:17:57,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29755 states to 29755 states and 98514 transitions. [2019-12-27 18:17:57,208 INFO L78 Accepts]: Start accepts. Automaton has 29755 states and 98514 transitions. Word has length 28 [2019-12-27 18:17:57,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:57,208 INFO L462 AbstractCegarLoop]: Abstraction has 29755 states and 98514 transitions. [2019-12-27 18:17:57,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:17:57,209 INFO L276 IsEmpty]: Start isEmpty. Operand 29755 states and 98514 transitions. [2019-12-27 18:17:57,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 18:17:57,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:57,223 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:17:57,223 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:57,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:57,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1319845053, now seen corresponding path program 1 times [2019-12-27 18:17:57,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:57,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430293426] [2019-12-27 18:17:57,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:57,269 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 18:17:57,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430293426] [2019-12-27 18:17:57,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:57,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:17:57,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1817042909] [2019-12-27 18:17:57,270 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:57,275 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:57,298 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 148 transitions. [2019-12-27 18:17:57,299 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:57,319 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:17:57,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:17:57,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:57,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:17:57,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:17:57,320 INFO L87 Difference]: Start difference. First operand 29755 states and 98514 transitions. Second operand 5 states. [2019-12-27 18:17:57,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:57,495 INFO L93 Difference]: Finished difference Result 38320 states and 126138 transitions. [2019-12-27 18:17:57,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:17:57,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 18:17:57,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:57,777 INFO L225 Difference]: With dead ends: 38320 [2019-12-27 18:17:57,777 INFO L226 Difference]: Without dead ends: 38320 [2019-12-27 18:17:57,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:17:57,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38320 states. [2019-12-27 18:17:58,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38320 to 30661. [2019-12-27 18:17:58,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30661 states. [2019-12-27 18:17:58,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30661 states to 30661 states and 100227 transitions. [2019-12-27 18:17:58,335 INFO L78 Accepts]: Start accepts. Automaton has 30661 states and 100227 transitions. Word has length 28 [2019-12-27 18:17:58,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:58,336 INFO L462 AbstractCegarLoop]: Abstraction has 30661 states and 100227 transitions. [2019-12-27 18:17:58,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:17:58,336 INFO L276 IsEmpty]: Start isEmpty. Operand 30661 states and 100227 transitions. [2019-12-27 18:17:58,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 18:17:58,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:58,352 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] [2019-12-27 18:17:58,352 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:58,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:58,352 INFO L82 PathProgramCache]: Analyzing trace with hash 234862090, now seen corresponding path program 1 times [2019-12-27 18:17:58,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:58,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912779653] [2019-12-27 18:17:58,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:58,411 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 18:17:58,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912779653] [2019-12-27 18:17:58,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:58,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:17:58,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1575541562] [2019-12-27 18:17:58,412 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:58,418 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:58,445 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 94 states and 157 transitions. [2019-12-27 18:17:58,445 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:58,459 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:17:58,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:17:58,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:58,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:17:58,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:17:58,461 INFO L87 Difference]: Start difference. First operand 30661 states and 100227 transitions. Second operand 6 states. [2019-12-27 18:17:58,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:17:58,930 INFO L93 Difference]: Finished difference Result 39205 states and 126499 transitions. [2019-12-27 18:17:58,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:17:58,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 18:17:58,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:17:58,996 INFO L225 Difference]: With dead ends: 39205 [2019-12-27 18:17:58,997 INFO L226 Difference]: Without dead ends: 38811 [2019-12-27 18:17:58,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:17:59,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38811 states. [2019-12-27 18:17:59,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38811 to 30894. [2019-12-27 18:17:59,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30894 states. [2019-12-27 18:17:59,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30894 states to 30894 states and 100767 transitions. [2019-12-27 18:17:59,828 INFO L78 Accepts]: Start accepts. Automaton has 30894 states and 100767 transitions. Word has length 29 [2019-12-27 18:17:59,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:17:59,828 INFO L462 AbstractCegarLoop]: Abstraction has 30894 states and 100767 transitions. [2019-12-27 18:17:59,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:17:59,829 INFO L276 IsEmpty]: Start isEmpty. Operand 30894 states and 100767 transitions. [2019-12-27 18:17:59,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 18:17:59,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:17:59,842 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] [2019-12-27 18:17:59,842 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:17:59,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:17:59,842 INFO L82 PathProgramCache]: Analyzing trace with hash 805904020, now seen corresponding path program 1 times [2019-12-27 18:17:59,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:17:59,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909635722] [2019-12-27 18:17:59,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:17:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:17:59,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:17:59,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909635722] [2019-12-27 18:17:59,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:17:59,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:17:59,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1314604562] [2019-12-27 18:17:59,877 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:17:59,882 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:17:59,896 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 71 states and 111 transitions. [2019-12-27 18:17:59,896 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:17:59,920 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 18:17:59,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:17:59,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:17:59,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:17:59,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:17:59,921 INFO L87 Difference]: Start difference. First operand 30894 states and 100767 transitions. Second operand 4 states. [2019-12-27 18:18:00,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:18:00,415 INFO L93 Difference]: Finished difference Result 61826 states and 204157 transitions. [2019-12-27 18:18:00,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:18:00,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-27 18:18:00,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:18:00,495 INFO L225 Difference]: With dead ends: 61826 [2019-12-27 18:18:00,495 INFO L226 Difference]: Without dead ends: 32368 [2019-12-27 18:18:00,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:18:00,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32368 states. [2019-12-27 18:18:00,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32368 to 20333. [2019-12-27 18:18:00,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20333 states. [2019-12-27 18:18:01,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20333 states to 20333 states and 67715 transitions. [2019-12-27 18:18:01,016 INFO L78 Accepts]: Start accepts. Automaton has 20333 states and 67715 transitions. Word has length 29 [2019-12-27 18:18:01,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:18:01,017 INFO L462 AbstractCegarLoop]: Abstraction has 20333 states and 67715 transitions. [2019-12-27 18:18:01,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:18:01,017 INFO L276 IsEmpty]: Start isEmpty. Operand 20333 states and 67715 transitions. [2019-12-27 18:18:01,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 18:18:01,025 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:18:01,025 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] [2019-12-27 18:18:01,026 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:18:01,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:18:01,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1673459084, now seen corresponding path program 1 times [2019-12-27 18:18:01,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:18:01,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623410569] [2019-12-27 18:18:01,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:18:01,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:18:01,086 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 18:18:01,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623410569] [2019-12-27 18:18:01,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:18:01,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:18:01,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [598650068] [2019-12-27 18:18:01,087 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:18:01,091 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:18:01,116 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 107 states and 187 transitions. [2019-12-27 18:18:01,116 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:18:01,118 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:18:01,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:18:01,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:18:01,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:18:01,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:18:01,119 INFO L87 Difference]: Start difference. First operand 20333 states and 67715 transitions. Second operand 5 states. [2019-12-27 18:18:01,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:18:01,685 INFO L93 Difference]: Finished difference Result 34767 states and 112990 transitions. [2019-12-27 18:18:01,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:18:01,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 18:18:01,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:18:01,738 INFO L225 Difference]: With dead ends: 34767 [2019-12-27 18:18:01,738 INFO L226 Difference]: Without dead ends: 34767 [2019-12-27 18:18:01,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:18:02,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34767 states. [2019-12-27 18:18:02,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34767 to 29090. [2019-12-27 18:18:02,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29090 states. [2019-12-27 18:18:02,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29090 states to 29090 states and 95089 transitions. [2019-12-27 18:18:02,411 INFO L78 Accepts]: Start accepts. Automaton has 29090 states and 95089 transitions. Word has length 30 [2019-12-27 18:18:02,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:18:02,412 INFO L462 AbstractCegarLoop]: Abstraction has 29090 states and 95089 transitions. [2019-12-27 18:18:02,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:18:02,412 INFO L276 IsEmpty]: Start isEmpty. Operand 29090 states and 95089 transitions. [2019-12-27 18:18:02,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 18:18:02,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:18:02,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:18:02,425 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:18:02,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:18:02,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1413309470, now seen corresponding path program 1 times [2019-12-27 18:18:02,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:18:02,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90121336] [2019-12-27 18:18:02,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:18:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:18:02,491 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 18:18:02,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90121336] [2019-12-27 18:18:02,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:18:02,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:18:02,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [502627645] [2019-12-27 18:18:02,492 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:18:02,500 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:18:02,526 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 194 transitions. [2019-12-27 18:18:02,526 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:18:02,530 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:18:02,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:18:02,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:18:02,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:18:02,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:18:02,531 INFO L87 Difference]: Start difference. First operand 29090 states and 95089 transitions. Second operand 5 states. [2019-12-27 18:18:02,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:18:02,633 INFO L93 Difference]: Finished difference Result 13178 states and 39760 transitions. [2019-12-27 18:18:02,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:18:02,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-27 18:18:02,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:18:02,654 INFO L225 Difference]: With dead ends: 13178 [2019-12-27 18:18:02,654 INFO L226 Difference]: Without dead ends: 11110 [2019-12-27 18:18:02,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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 18:18:02,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11110 states. [2019-12-27 18:18:02,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11110 to 10943. [2019-12-27 18:18:02,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10943 states. [2019-12-27 18:18:02,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10943 states to 10943 states and 32777 transitions. [2019-12-27 18:18:02,885 INFO L78 Accepts]: Start accepts. Automaton has 10943 states and 32777 transitions. Word has length 31 [2019-12-27 18:18:02,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:18:02,885 INFO L462 AbstractCegarLoop]: Abstraction has 10943 states and 32777 transitions. [2019-12-27 18:18:02,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:18:02,885 INFO L276 IsEmpty]: Start isEmpty. Operand 10943 states and 32777 transitions. [2019-12-27 18:18:02,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:18:02,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:18:02,897 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 18:18:02,897 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:18:02,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:18:02,897 INFO L82 PathProgramCache]: Analyzing trace with hash 483024013, now seen corresponding path program 1 times [2019-12-27 18:18:02,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:18:02,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212874834] [2019-12-27 18:18:02,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:18:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:18:02,957 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 18:18:02,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212874834] [2019-12-27 18:18:02,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:18:02,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:18:02,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2102009797] [2019-12-27 18:18:02,958 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:18:02,966 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:18:03,023 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 122 states and 202 transitions. [2019-12-27 18:18:03,023 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:18:03,045 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:18:03,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:18:03,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:18:03,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:18:03,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:18:03,046 INFO L87 Difference]: Start difference. First operand 10943 states and 32777 transitions. Second operand 7 states. [2019-12-27 18:18:03,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:18:03,279 INFO L93 Difference]: Finished difference Result 11069 states and 33011 transitions. [2019-12-27 18:18:03,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:18:03,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 18:18:03,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:18:03,295 INFO L225 Difference]: With dead ends: 11069 [2019-12-27 18:18:03,295 INFO L226 Difference]: Without dead ends: 10842 [2019-12-27 18:18:03,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:18:03,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10842 states. [2019-12-27 18:18:03,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10842 to 10842. [2019-12-27 18:18:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10842 states. [2019-12-27 18:18:03,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10842 states to 10842 states and 32566 transitions. [2019-12-27 18:18:03,465 INFO L78 Accepts]: Start accepts. Automaton has 10842 states and 32566 transitions. Word has length 40 [2019-12-27 18:18:03,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:18:03,466 INFO L462 AbstractCegarLoop]: Abstraction has 10842 states and 32566 transitions. [2019-12-27 18:18:03,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:18:03,466 INFO L276 IsEmpty]: Start isEmpty. Operand 10842 states and 32566 transitions. [2019-12-27 18:18:03,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:18:03,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:18:03,480 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 18:18:03,481 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:18:03,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:18:03,481 INFO L82 PathProgramCache]: Analyzing trace with hash -891252526, now seen corresponding path program 1 times [2019-12-27 18:18:03,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:18:03,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213229459] [2019-12-27 18:18:03,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:18:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:18:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:18:03,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213229459] [2019-12-27 18:18:03,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:18:03,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:18:03,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [482626460] [2019-12-27 18:18:03,555 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:18:03,563 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:18:03,670 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 162 transitions. [2019-12-27 18:18:03,670 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:18:03,731 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 18:18:03,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:18:03,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:18:03,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:18:03,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:18:03,732 INFO L87 Difference]: Start difference. First operand 10842 states and 32566 transitions. Second operand 8 states. [2019-12-27 18:18:05,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:18:05,432 INFO L93 Difference]: Finished difference Result 36245 states and 107113 transitions. [2019-12-27 18:18:05,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 18:18:05,432 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-12-27 18:18:05,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:18:05,489 INFO L225 Difference]: With dead ends: 36245 [2019-12-27 18:18:05,489 INFO L226 Difference]: Without dead ends: 36245 [2019-12-27 18:18:05,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-12-27 18:18:05,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36245 states. [2019-12-27 18:18:05,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36245 to 13761. [2019-12-27 18:18:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13761 states. [2019-12-27 18:18:05,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13761 states to 13761 states and 41509 transitions. [2019-12-27 18:18:05,863 INFO L78 Accepts]: Start accepts. Automaton has 13761 states and 41509 transitions. Word has length 40 [2019-12-27 18:18:05,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:18:05,863 INFO L462 AbstractCegarLoop]: Abstraction has 13761 states and 41509 transitions. [2019-12-27 18:18:05,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:18:05,863 INFO L276 IsEmpty]: Start isEmpty. Operand 13761 states and 41509 transitions. [2019-12-27 18:18:05,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:18:05,883 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:18:05,883 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 18:18:05,884 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:18:05,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:18:05,884 INFO L82 PathProgramCache]: Analyzing trace with hash 820794198, now seen corresponding path program 2 times [2019-12-27 18:18:05,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:18:05,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085466357] [2019-12-27 18:18:05,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:18:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:18:05,961 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 18:18:05,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085466357] [2019-12-27 18:18:05,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:18:05,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:18:05,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1182928907] [2019-12-27 18:18:05,962 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:18:05,970 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:18:06,013 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 107 states and 182 transitions. [2019-12-27 18:18:06,013 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:18:06,014 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:18:06,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:18:06,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:18:06,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:18:06,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:18:06,015 INFO L87 Difference]: Start difference. First operand 13761 states and 41509 transitions. Second operand 3 states. [2019-12-27 18:18:06,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:18:06,066 INFO L93 Difference]: Finished difference Result 13681 states and 41222 transitions. [2019-12-27 18:18:06,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:18:06,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 18:18:06,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:18:06,086 INFO L225 Difference]: With dead ends: 13681 [2019-12-27 18:18:06,086 INFO L226 Difference]: Without dead ends: 13681 [2019-12-27 18:18:06,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 18:18:06,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13681 states. [2019-12-27 18:18:06,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13681 to 11316. [2019-12-27 18:18:06,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11316 states. [2019-12-27 18:18:06,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11316 states to 11316 states and 34462 transitions. [2019-12-27 18:18:06,279 INFO L78 Accepts]: Start accepts. Automaton has 11316 states and 34462 transitions. Word has length 40 [2019-12-27 18:18:06,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:18:06,279 INFO L462 AbstractCegarLoop]: Abstraction has 11316 states and 34462 transitions. [2019-12-27 18:18:06,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:18:06,279 INFO L276 IsEmpty]: Start isEmpty. Operand 11316 states and 34462 transitions. [2019-12-27 18:18:06,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 18:18:06,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:18:06,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:18:06,294 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:18:06,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:18:06,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1848652026, now seen corresponding path program 1 times [2019-12-27 18:18:06,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:18:06,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687806536] [2019-12-27 18:18:06,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:18:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:18:06,356 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 18:18:06,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687806536] [2019-12-27 18:18:06,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:18:06,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:18:06,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [566146530] [2019-12-27 18:18:06,358 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:18:06,367 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:18:06,442 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 129 states and 215 transitions. [2019-12-27 18:18:06,442 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:18:06,461 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:18:06,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:18:06,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:18:06,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:18:06,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:18:06,462 INFO L87 Difference]: Start difference. First operand 11316 states and 34462 transitions. Second operand 7 states. [2019-12-27 18:18:06,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:18:06,862 INFO L93 Difference]: Finished difference Result 11302 states and 34429 transitions. [2019-12-27 18:18:06,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:18:06,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 18:18:06,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:18:06,883 INFO L225 Difference]: With dead ends: 11302 [2019-12-27 18:18:06,883 INFO L226 Difference]: Without dead ends: 10961 [2019-12-27 18:18:06,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:18:06,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10961 states. [2019-12-27 18:18:07,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10961 to 10961. [2019-12-27 18:18:07,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10961 states. [2019-12-27 18:18:07,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10961 states to 10961 states and 33774 transitions. [2019-12-27 18:18:07,096 INFO L78 Accepts]: Start accepts. Automaton has 10961 states and 33774 transitions. Word has length 41 [2019-12-27 18:18:07,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:18:07,096 INFO L462 AbstractCegarLoop]: Abstraction has 10961 states and 33774 transitions. [2019-12-27 18:18:07,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:18:07,096 INFO L276 IsEmpty]: Start isEmpty. Operand 10961 states and 33774 transitions. [2019-12-27 18:18:07,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 18:18:07,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:18:07,109 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:18:07,110 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:18:07,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:18:07,110 INFO L82 PathProgramCache]: Analyzing trace with hash 685009244, now seen corresponding path program 1 times [2019-12-27 18:18:07,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:18:07,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193100172] [2019-12-27 18:18:07,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:18:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:18:07,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:18:07,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193100172] [2019-12-27 18:18:07,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:18:07,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:18:07,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [866237602] [2019-12-27 18:18:07,158 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:18:07,167 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:18:07,213 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 101 states and 163 transitions. [2019-12-27 18:18:07,214 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:18:07,228 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:18:07,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:18:07,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:18:07,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:18:07,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:18:07,229 INFO L87 Difference]: Start difference. First operand 10961 states and 33774 transitions. Second operand 4 states. [2019-12-27 18:18:07,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:18:07,478 INFO L93 Difference]: Finished difference Result 11219 states and 33396 transitions. [2019-12-27 18:18:07,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:18:07,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-27 18:18:07,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:18:07,500 INFO L225 Difference]: With dead ends: 11219 [2019-12-27 18:18:07,500 INFO L226 Difference]: Without dead ends: 11219 [2019-12-27 18:18:07,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:18:07,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11219 states. [2019-12-27 18:18:07,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11219 to 8202. [2019-12-27 18:18:07,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8202 states. [2019-12-27 18:18:07,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8202 states to 8202 states and 24638 transitions. [2019-12-27 18:18:07,737 INFO L78 Accepts]: Start accepts. Automaton has 8202 states and 24638 transitions. Word has length 41 [2019-12-27 18:18:07,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:18:07,737 INFO L462 AbstractCegarLoop]: Abstraction has 8202 states and 24638 transitions. [2019-12-27 18:18:07,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:18:07,737 INFO L276 IsEmpty]: Start isEmpty. Operand 8202 states and 24638 transitions. [2019-12-27 18:18:07,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 18:18:07,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:18:07,751 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:18:07,752 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:18:07,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:18:07,752 INFO L82 PathProgramCache]: Analyzing trace with hash 838446510, now seen corresponding path program 1 times [2019-12-27 18:18:07,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:18:07,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801012608] [2019-12-27 18:18:07,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:18:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:18:07,900 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 18:18:07,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801012608] [2019-12-27 18:18:07,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:18:07,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:18:07,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [803313428] [2019-12-27 18:18:07,902 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:18:07,931 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:18:08,000 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 117 states and 199 transitions. [2019-12-27 18:18:08,000 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:18:08,004 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:18:08,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:18:08,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:18:08,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:18:08,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:18:08,007 INFO L87 Difference]: Start difference. First operand 8202 states and 24638 transitions. Second operand 6 states. [2019-12-27 18:18:08,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:18:08,122 INFO L93 Difference]: Finished difference Result 7285 states and 22413 transitions. [2019-12-27 18:18:08,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:18:08,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-27 18:18:08,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:18:08,136 INFO L225 Difference]: With dead ends: 7285 [2019-12-27 18:18:08,136 INFO L226 Difference]: Without dead ends: 7186 [2019-12-27 18:18:08,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:18:08,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7186 states. [2019-12-27 18:18:08,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7186 to 7144. [2019-12-27 18:18:08,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7144 states. [2019-12-27 18:18:08,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7144 states to 7144 states and 22071 transitions. [2019-12-27 18:18:08,318 INFO L78 Accepts]: Start accepts. Automaton has 7144 states and 22071 transitions. Word has length 42 [2019-12-27 18:18:08,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:18:08,318 INFO L462 AbstractCegarLoop]: Abstraction has 7144 states and 22071 transitions. [2019-12-27 18:18:08,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:18:08,318 INFO L276 IsEmpty]: Start isEmpty. Operand 7144 states and 22071 transitions. [2019-12-27 18:18:08,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:18:08,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:18:08,331 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] [2019-12-27 18:18:08,331 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:18:08,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:18:08,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1033271685, now seen corresponding path program 1 times [2019-12-27 18:18:08,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:18:08,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031577303] [2019-12-27 18:18:08,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:18:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:18:08,887 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 18:18:08,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031577303] [2019-12-27 18:18:08,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:18:08,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 18:18:08,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [778626769] [2019-12-27 18:18:08,888 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:18:08,903 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:18:09,036 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 220 states and 426 transitions. [2019-12-27 18:18:09,036 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:18:09,313 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 18:18:09,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 18:18:09,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:18:09,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 18:18:09,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2019-12-27 18:18:09,315 INFO L87 Difference]: Start difference. First operand 7144 states and 22071 transitions. Second operand 17 states. [2019-12-27 18:18:13,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:18:13,163 INFO L93 Difference]: Finished difference Result 21361 states and 63869 transitions. [2019-12-27 18:18:13,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-27 18:18:13,163 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-27 18:18:13,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:18:13,186 INFO L225 Difference]: With dead ends: 21361 [2019-12-27 18:18:13,186 INFO L226 Difference]: Without dead ends: 14729 [2019-12-27 18:18:13,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 9 SyntacticMatches, 12 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=510, Invalid=2352, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 18:18:13,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14729 states. [2019-12-27 18:18:13,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14729 to 8511. [2019-12-27 18:18:13,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8511 states. [2019-12-27 18:18:13,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8511 states to 8511 states and 25845 transitions. [2019-12-27 18:18:13,363 INFO L78 Accepts]: Start accepts. Automaton has 8511 states and 25845 transitions. Word has length 56 [2019-12-27 18:18:13,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:18:13,363 INFO L462 AbstractCegarLoop]: Abstraction has 8511 states and 25845 transitions. [2019-12-27 18:18:13,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 18:18:13,364 INFO L276 IsEmpty]: Start isEmpty. Operand 8511 states and 25845 transitions. [2019-12-27 18:18:13,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:18:13,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:18:13,373 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] [2019-12-27 18:18:13,373 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:18:13,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:18:13,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1049666311, now seen corresponding path program 2 times [2019-12-27 18:18:13,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:18:13,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683838564] [2019-12-27 18:18:13,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:18:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:18:13,889 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 18:18:13,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683838564] [2019-12-27 18:18:13,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:18:13,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 18:18:13,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1935880277] [2019-12-27 18:18:13,891 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:18:13,923 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:18:14,088 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 194 states and 360 transitions. [2019-12-27 18:18:14,088 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:18:14,238 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 18:18:14,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 18:18:14,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:18:14,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 18:18:14,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-27 18:18:14,239 INFO L87 Difference]: Start difference. First operand 8511 states and 25845 transitions. Second operand 16 states. [2019-12-27 18:18:17,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:18:17,619 INFO L93 Difference]: Finished difference Result 17063 states and 50553 transitions. [2019-12-27 18:18:17,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-27 18:18:17,619 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-27 18:18:17,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:18:17,635 INFO L225 Difference]: With dead ends: 17063 [2019-12-27 18:18:17,635 INFO L226 Difference]: Without dead ends: 11955 [2019-12-27 18:18:17,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 9 SyntacticMatches, 13 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 913 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=510, Invalid=2352, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 18:18:17,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11955 states. [2019-12-27 18:18:17,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11955 to 8807. [2019-12-27 18:18:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8807 states. [2019-12-27 18:18:17,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8807 states to 8807 states and 26702 transitions. [2019-12-27 18:18:17,778 INFO L78 Accepts]: Start accepts. Automaton has 8807 states and 26702 transitions. Word has length 56 [2019-12-27 18:18:17,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:18:17,779 INFO L462 AbstractCegarLoop]: Abstraction has 8807 states and 26702 transitions. [2019-12-27 18:18:17,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 18:18:17,779 INFO L276 IsEmpty]: Start isEmpty. Operand 8807 states and 26702 transitions. [2019-12-27 18:18:17,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:18:17,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:18:17,787 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] [2019-12-27 18:18:17,787 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:18:17,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:18:17,788 INFO L82 PathProgramCache]: Analyzing trace with hash -337997383, now seen corresponding path program 3 times [2019-12-27 18:18:17,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:18:17,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239278610] [2019-12-27 18:18:17,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:18:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:18:17,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:18:17,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239278610] [2019-12-27 18:18:17,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:18:17,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 18:18:17,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1878210797] [2019-12-27 18:18:17,910 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:18:17,930 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:18:18,123 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 251 states and 506 transitions. [2019-12-27 18:18:18,123 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:18:18,284 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 18:18:18,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:18:18,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:18:18,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:18:18,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:18:18,285 INFO L87 Difference]: Start difference. First operand 8807 states and 26702 transitions. Second operand 11 states. [2019-12-27 18:18:19,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:18:19,850 INFO L93 Difference]: Finished difference Result 20373 states and 61014 transitions. [2019-12-27 18:18:19,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 18:18:19,850 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-27 18:18:19,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:18:19,872 INFO L225 Difference]: With dead ends: 20373 [2019-12-27 18:18:19,872 INFO L226 Difference]: Without dead ends: 14680 [2019-12-27 18:18:19,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 12 SyntacticMatches, 10 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=277, Invalid=1283, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 18:18:19,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14680 states. [2019-12-27 18:18:20,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14680 to 9066. [2019-12-27 18:18:20,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9066 states. [2019-12-27 18:18:20,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9066 states to 9066 states and 27132 transitions. [2019-12-27 18:18:20,059 INFO L78 Accepts]: Start accepts. Automaton has 9066 states and 27132 transitions. Word has length 56 [2019-12-27 18:18:20,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:18:20,059 INFO L462 AbstractCegarLoop]: Abstraction has 9066 states and 27132 transitions. [2019-12-27 18:18:20,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:18:20,059 INFO L276 IsEmpty]: Start isEmpty. Operand 9066 states and 27132 transitions. [2019-12-27 18:18:20,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:18:20,069 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:18:20,069 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] [2019-12-27 18:18:20,069 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:18:20,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:18:20,070 INFO L82 PathProgramCache]: Analyzing trace with hash 93841739, now seen corresponding path program 4 times [2019-12-27 18:18:20,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:18:20,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419441573] [2019-12-27 18:18:20,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:18:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:18:20,224 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 18:18:20,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419441573] [2019-12-27 18:18:20,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:18:20,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 18:18:20,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1607607435] [2019-12-27 18:18:20,225 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:18:20,244 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:18:20,472 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 315 states and 670 transitions. [2019-12-27 18:18:20,472 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:18:20,713 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 29 times. [2019-12-27 18:18:20,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:18:20,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:18:20,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:18:20,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:18:20,715 INFO L87 Difference]: Start difference. First operand 9066 states and 27132 transitions. Second operand 13 states. [2019-12-27 18:18:22,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:18:22,589 INFO L93 Difference]: Finished difference Result 18148 states and 53999 transitions. [2019-12-27 18:18:22,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 18:18:22,590 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-12-27 18:18:22,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:18:22,611 INFO L225 Difference]: With dead ends: 18148 [2019-12-27 18:18:22,611 INFO L226 Difference]: Without dead ends: 13508 [2019-12-27 18:18:22,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 15 SyntacticMatches, 14 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=286, Invalid=1436, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 18:18:22,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13508 states. [2019-12-27 18:18:22,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13508 to 8594. [2019-12-27 18:18:22,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8594 states. [2019-12-27 18:18:22,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8594 states to 8594 states and 25710 transitions. [2019-12-27 18:18:22,872 INFO L78 Accepts]: Start accepts. Automaton has 8594 states and 25710 transitions. Word has length 56 [2019-12-27 18:18:22,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:18:22,872 INFO L462 AbstractCegarLoop]: Abstraction has 8594 states and 25710 transitions. [2019-12-27 18:18:22,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:18:22,873 INFO L276 IsEmpty]: Start isEmpty. Operand 8594 states and 25710 transitions. [2019-12-27 18:18:22,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:18:22,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:18:22,883 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] [2019-12-27 18:18:22,883 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:18:22,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:18:22,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1500231249, now seen corresponding path program 5 times [2019-12-27 18:18:22,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:18:22,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057548309] [2019-12-27 18:18:22,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:18:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:18:22,994 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 18:18:22,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057548309] [2019-12-27 18:18:22,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:18:22,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 18:18:22,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [146489105] [2019-12-27 18:18:22,995 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:18:23,012 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:18:23,162 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 283 transitions. [2019-12-27 18:18:23,163 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:18:23,232 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 18:18:23,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:18:23,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:18:23,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:18:23,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:18:23,233 INFO L87 Difference]: Start difference. First operand 8594 states and 25710 transitions. Second operand 9 states. [2019-12-27 18:18:23,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:18:23,940 INFO L93 Difference]: Finished difference Result 10042 states and 29297 transitions. [2019-12-27 18:18:23,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 18:18:23,941 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-27 18:18:23,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:18:23,955 INFO L225 Difference]: With dead ends: 10042 [2019-12-27 18:18:23,956 INFO L226 Difference]: Without dead ends: 9444 [2019-12-27 18:18:23,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-27 18:18:23,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9444 states. [2019-12-27 18:18:24,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9444 to 8444. [2019-12-27 18:18:24,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8444 states. [2019-12-27 18:18:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8444 states to 8444 states and 25310 transitions. [2019-12-27 18:18:24,094 INFO L78 Accepts]: Start accepts. Automaton has 8444 states and 25310 transitions. Word has length 56 [2019-12-27 18:18:24,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:18:24,094 INFO L462 AbstractCegarLoop]: Abstraction has 8444 states and 25310 transitions. [2019-12-27 18:18:24,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:18:24,094 INFO L276 IsEmpty]: Start isEmpty. Operand 8444 states and 25310 transitions. [2019-12-27 18:18:24,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:18:24,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:18:24,103 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] [2019-12-27 18:18:24,103 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:18:24,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:18:24,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1734091201, now seen corresponding path program 6 times [2019-12-27 18:18:24,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:18:24,105 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240364528] [2019-12-27 18:18:24,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:18:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:18:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:18:24,196 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:18:24,196 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:18:24,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_cnt~0_95) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2085~0.base_30|) (= 0 v_~x~0_240) (= v_~x$r_buff1_thd0~0_309 0) (= v_~weak$$choice2~0_201 0) (= 0 v_~x$w_buff1_used~0_624) (= |v_ULTIMATE.start_main_~#t2085~0.offset_22| 0) (= 0 v_~x$r_buff1_thd2~0_264) (= v_~y~0_226 0) (= v_~z~0_95 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2085~0.base_30|) 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2085~0.base_30| 4)) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$r_buff0_thd3~0_148) (= 0 v_~x$w_buff1~0_328) (= 0 v_~x$r_buff0_thd2~0_323) (= v_~x$flush_delayed~0_62 0) (= 0 v_~x$w_buff0_used~0_913) (= 0 |v_#NULL.base_4|) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff0_thd1~0_362 0) (= 0 v_~weak$$choice0~0_37) (= v_~main$tmp_guard1~0_53 0) (= v_~main$tmp_guard0~0_42 0) (= 0 v_~__unbuffered_p0_EAX~0_85) (= 0 v_~__unbuffered_p2_EAX~0_68) (= |v_#NULL.offset_4| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2085~0.base_30| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2085~0.base_30|) |v_ULTIMATE.start_main_~#t2085~0.offset_22| 0)) |v_#memory_int_23|) (= 0 v_~x$r_buff1_thd3~0_267) (= v_~x$mem_tmp~0_40 0) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t2085~0.base_30| 1)) (= v_~x$r_buff1_thd1~0_428 0) (= 0 v_~x$w_buff0~0_403) (= v_~x$r_buff0_thd0~0_156 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_403, ULTIMATE.start_main_~#t2087~0.base=|v_ULTIMATE.start_main_~#t2087~0.base_23|, ~x$flush_delayed~0=v_~x$flush_delayed~0_62, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_428, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_148, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_68, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~x$w_buff1~0=v_~x$w_buff1~0_328, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_624, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_264, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_37, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t2086~0.base=|v_ULTIMATE.start_main_~#t2086~0.base_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, ~x~0=v_~x~0_240, ULTIMATE.start_main_~#t2085~0.offset=|v_ULTIMATE.start_main_~#t2085~0.offset_22|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_362, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_114|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_267, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_53, ~x$mem_tmp~0=v_~x$mem_tmp~0_40, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t2085~0.base=|v_ULTIMATE.start_main_~#t2085~0.base_30|, ~y~0=v_~y~0_226, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ULTIMATE.start_main_~#t2087~0.offset=|v_ULTIMATE.start_main_~#t2087~0.offset_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_309, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_323, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_62|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t2086~0.offset=|v_ULTIMATE.start_main_~#t2086~0.offset_22|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_201, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2085~0.offset, ULTIMATE.start_main_~#t2087~0.base, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2085~0.base, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2087~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2086~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ULTIMATE.start_main_~#t2086~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 18:18:24,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L818-1-->L820: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2086~0.base_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2086~0.base_10| 4) |v_#length_15|) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2086~0.base_10| 1) |v_#valid_31|) (= |v_ULTIMATE.start_main_~#t2086~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t2086~0.base_10|)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2086~0.base_10|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2086~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2086~0.base_10|) |v_ULTIMATE.start_main_~#t2086~0.offset_9| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2086~0.offset=|v_ULTIMATE.start_main_~#t2086~0.offset_9|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, ULTIMATE.start_main_~#t2086~0.base=|v_ULTIMATE.start_main_~#t2086~0.base_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2086~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2086~0.base, #length] because there is no mapped edge [2019-12-27 18:18:24,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_19) (= v_P1Thread1of1ForFork0_~arg.offset_6 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_P1Thread1of1ForFork0_~arg.base_6 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= 0 (mod v_~x$w_buff1_used~0_52 256)) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= v_~x$w_buff1_used~0_52 v_~x$w_buff0_used~0_98) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= 1 v_~x$w_buff0_used~0_97) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_6, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_6, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, ~x$w_buff1~0=v_~x$w_buff1~0_19, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_97} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 18:18:24,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L820-1-->L822: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2087~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2087~0.base_11|) |v_ULTIMATE.start_main_~#t2087~0.offset_10| 2)) |v_#memory_int_13|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2087~0.base_11| 4)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2087~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2087~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2087~0.base_11|)) (= |v_ULTIMATE.start_main_~#t2087~0.offset_10| 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2087~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2087~0.base=|v_ULTIMATE.start_main_~#t2087~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2087~0.offset=|v_ULTIMATE.start_main_~#t2087~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2087~0.base, ULTIMATE.start_main_~#t2087~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 18:18:24,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1546998389 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1546998389 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite32_Out-1546998389| ~x$w_buff1~0_In-1546998389) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out-1546998389| ~x~0_In-1546998389)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1546998389, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1546998389, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1546998389, ~x~0=~x~0_In-1546998389} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-1546998389|, ~x$w_buff1~0=~x$w_buff1~0_In-1546998389, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1546998389, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1546998389, ~x~0=~x~0_In-1546998389} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 18:18:24,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_10|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_10|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_13|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 18:18:24,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1243808101 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In1243808101 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out1243808101|)) (and (= ~x$w_buff0_used~0_In1243808101 |P2Thread1of1ForFork1_#t~ite34_Out1243808101|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1243808101, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1243808101} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1243808101|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1243808101, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1243808101} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 18:18:24,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In849182366 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In849182366 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out849182366|)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In849182366 |P1Thread1of1ForFork0_#t~ite28_Out849182366|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In849182366, ~x$w_buff0_used~0=~x$w_buff0_used~0_In849182366} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In849182366, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out849182366|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In849182366} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 18:18:24,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-458380488 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-458380488 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-458380488 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-458380488 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-458380488|)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out-458380488| ~x$w_buff1_used~0_In-458380488) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-458380488, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-458380488, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-458380488, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-458380488} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-458380488, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-458380488, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-458380488, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-458380488|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-458380488} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 18:18:24,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L778-->L779: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2144418306 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-2144418306 256)))) (or (and (= ~x$r_buff0_thd2~0_Out-2144418306 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out-2144418306 ~x$r_buff0_thd2~0_In-2144418306)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2144418306, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2144418306} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-2144418306|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-2144418306, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2144418306} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 18:18:24,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In18891529 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In18891529 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In18891529 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In18891529 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out18891529| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out18891529| ~x$r_buff1_thd2~0_In18891529)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In18891529, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In18891529, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In18891529, ~x$w_buff0_used~0=~x$w_buff0_used~0_In18891529} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out18891529|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In18891529, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In18891529, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In18891529, ~x$w_buff0_used~0=~x$w_buff0_used~0_In18891529} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 18:18:24,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L779-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd2~0_46 |v_P1Thread1of1ForFork0_#t~ite31_30|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_46, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 18:18:24,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In623774708 256)))) (or (and (= ~x$w_buff0~0_In623774708 |P0Thread1of1ForFork2_#t~ite8_Out623774708|) (= |P0Thread1of1ForFork2_#t~ite9_Out623774708| |P0Thread1of1ForFork2_#t~ite8_Out623774708|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In623774708 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In623774708 256)) (and (= 0 (mod ~x$w_buff1_used~0_In623774708 256)) .cse0) (and (= (mod ~x$r_buff1_thd1~0_In623774708 256) 0) .cse0))) .cse1) (and (= |P0Thread1of1ForFork2_#t~ite8_In623774708| |P0Thread1of1ForFork2_#t~ite8_Out623774708|) (= ~x$w_buff0~0_In623774708 |P0Thread1of1ForFork2_#t~ite9_Out623774708|) (not .cse1)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In623774708, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In623774708, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In623774708|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In623774708, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In623774708, ~weak$$choice2~0=~weak$$choice2~0_In623774708, ~x$w_buff0_used~0=~x$w_buff0_used~0_In623774708} OutVars{~x$w_buff0~0=~x$w_buff0~0_In623774708, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In623774708, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out623774708|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In623774708, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out623774708|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In623774708, ~weak$$choice2~0=~weak$$choice2~0_In623774708, ~x$w_buff0_used~0=~x$w_buff0_used~0_In623774708} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 18:18:24,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-724070533 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-724070533 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In-724070533 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-724070533 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-724070533|)) (and (= ~x$w_buff1_used~0_In-724070533 |P2Thread1of1ForFork1_#t~ite35_Out-724070533|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-724070533, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-724070533, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-724070533, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-724070533} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-724070533|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-724070533, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-724070533, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-724070533, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-724070533} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 18:18:24,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1910191942 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1910191942 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out-1910191942| ~x$r_buff0_thd3~0_In-1910191942) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out-1910191942| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1910191942, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1910191942} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1910191942|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1910191942, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1910191942} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 18:18:24,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L799-->L799-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1235904351 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-1235904351 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1235904351 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-1235904351 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out-1235904351| ~x$r_buff1_thd3~0_In-1235904351)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork1_#t~ite37_Out-1235904351| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1235904351, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1235904351, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1235904351, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1235904351} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1235904351|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1235904351, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1235904351, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1235904351, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1235904351} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 18:18:24,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_48 |v_P2Thread1of1ForFork1_#t~ite37_30|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_48, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 18:18:24,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In716250362 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite17_Out716250362| ~x$w_buff1_used~0_In716250362) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In716250362 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In716250362 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In716250362 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In716250362 256)) .cse1))) (= |P0Thread1of1ForFork2_#t~ite18_Out716250362| |P0Thread1of1ForFork2_#t~ite17_Out716250362|)) (and (= |P0Thread1of1ForFork2_#t~ite17_In716250362| |P0Thread1of1ForFork2_#t~ite17_Out716250362|) (= |P0Thread1of1ForFork2_#t~ite18_Out716250362| ~x$w_buff1_used~0_In716250362) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In716250362, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In716250362|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In716250362, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In716250362, ~weak$$choice2~0=~weak$$choice2~0_In716250362, ~x$w_buff0_used~0=~x$w_buff0_used~0_In716250362} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In716250362, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out716250362|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out716250362|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In716250362, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In716250362, ~weak$$choice2~0=~weak$$choice2~0_In716250362, ~x$w_buff0_used~0=~x$w_buff0_used~0_In716250362} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 18:18:24,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_101 v_~x$r_buff0_thd1~0_100) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_100, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 18:18:24,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-426898221 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite24_Out-426898221| ~x$r_buff1_thd1~0_In-426898221) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite23_In-426898221| |P0Thread1of1ForFork2_#t~ite23_Out-426898221|)) (and (= |P0Thread1of1ForFork2_#t~ite24_Out-426898221| |P0Thread1of1ForFork2_#t~ite23_Out-426898221|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-426898221 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-426898221 256)) (and (= 0 (mod ~x$w_buff1_used~0_In-426898221 256)) .cse1) (and (= 0 (mod ~x$r_buff1_thd1~0_In-426898221 256)) .cse1))) (= ~x$r_buff1_thd1~0_In-426898221 |P0Thread1of1ForFork2_#t~ite23_Out-426898221|) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-426898221, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-426898221, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-426898221, ~weak$$choice2~0=~weak$$choice2~0_In-426898221, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-426898221|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-426898221} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-426898221, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-426898221, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-426898221, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-426898221|, ~weak$$choice2~0=~weak$$choice2~0_In-426898221, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-426898221|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-426898221} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-27 18:18:24,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x~0_34 v_~x$mem_tmp~0_10) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_34} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 18:18:24,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_158 256)) (= 0 (mod v_~x$r_buff0_thd0~0_26 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 18:18:24,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L828-2-->L828-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-508239901 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-508239901 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite41_Out-508239901| ~x~0_In-508239901)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite41_Out-508239901| ~x$w_buff1~0_In-508239901)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-508239901, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-508239901, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-508239901, ~x~0=~x~0_In-508239901} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-508239901|, ~x$w_buff1~0=~x$w_buff1~0_In-508239901, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-508239901, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-508239901, ~x~0=~x~0_In-508239901} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 18:18:24,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 18:18:24,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1607880268 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1607880268 256)))) (or (and (= ~x$w_buff0_used~0_In-1607880268 |ULTIMATE.start_main_#t~ite43_Out-1607880268|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out-1607880268|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1607880268, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1607880268} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1607880268, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1607880268|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1607880268} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 18:18:24,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1464902229 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1464902229 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1464902229 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1464902229 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1464902229| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~x$w_buff1_used~0_In-1464902229 |ULTIMATE.start_main_#t~ite44_Out-1464902229|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1464902229, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1464902229, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1464902229, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1464902229} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1464902229, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1464902229, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1464902229, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1464902229|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1464902229} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 18:18:24,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-118978205 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-118978205 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out-118978205|)) (and (= |ULTIMATE.start_main_#t~ite45_Out-118978205| ~x$r_buff0_thd0~0_In-118978205) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-118978205, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-118978205} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-118978205, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-118978205|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-118978205} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 18:18:24,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L832-->L832-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd0~0_In-1227538818 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1227538818 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1227538818 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1227538818 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-1227538818| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-1227538818| ~x$r_buff1_thd0~0_In-1227538818)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1227538818, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1227538818, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1227538818, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1227538818} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1227538818, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1227538818|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1227538818, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1227538818, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1227538818} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 18:18:24,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z~0_60 2) (= v_~main$tmp_guard1~0_25 0) (= 1 v_~__unbuffered_p2_EAX~0_35) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0) (= v_~x$r_buff1_thd0~0_277 |v_ULTIMATE.start_main_#t~ite46_60|) (= 0 v_~__unbuffered_p0_EAX~0_54) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_25 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_60|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_59|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_277, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:18:24,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:18:24 BasicIcfg [2019-12-27 18:18:24,304 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:18:24,314 INFO L168 Benchmark]: Toolchain (without parser) took 188348.04 ms. Allocated memory was 137.9 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 100.7 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 844.2 MB. Max. memory is 7.1 GB. [2019-12-27 18:18:24,314 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 18:18:24,315 INFO L168 Benchmark]: CACSL2BoogieTranslator took 961.74 ms. Allocated memory was 137.9 MB in the beginning and 203.4 MB in the end (delta: 65.5 MB). Free memory was 100.3 MB in the beginning and 155.2 MB in the end (delta: -54.9 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-27 18:18:24,315 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.74 ms. Allocated memory is still 203.4 MB. Free memory was 155.2 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:18:24,316 INFO L168 Benchmark]: Boogie Preprocessor took 41.54 ms. Allocated memory is still 203.4 MB. Free memory was 152.4 MB in the beginning and 150.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 18:18:24,316 INFO L168 Benchmark]: RCFGBuilder took 847.44 ms. Allocated memory is still 203.4 MB. Free memory was 150.4 MB in the beginning and 103.5 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2019-12-27 18:18:24,317 INFO L168 Benchmark]: TraceAbstraction took 186423.80 ms. Allocated memory was 203.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 102.8 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 780.8 MB. Max. memory is 7.1 GB. [2019-12-27 18:18:24,323 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.19 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 961.74 ms. Allocated memory was 137.9 MB in the beginning and 203.4 MB in the end (delta: 65.5 MB). Free memory was 100.3 MB in the beginning and 155.2 MB in the end (delta: -54.9 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.74 ms. Allocated memory is still 203.4 MB. Free memory was 155.2 MB in the beginning and 152.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.54 ms. Allocated memory is still 203.4 MB. Free memory was 152.4 MB in the beginning and 150.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 847.44 ms. Allocated memory is still 203.4 MB. Free memory was 150.4 MB in the beginning and 103.5 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 186423.80 ms. Allocated memory was 203.4 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 102.8 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 780.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 26 ChoiceCompositions, 6709 VarBasedMoverChecksPositive, 292 VarBasedMoverChecksNegative, 116 SemBasedMoverChecksPositive, 259 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 66094 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2085, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2086, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2087, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 z = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 186.1s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 56.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4484 SDtfs, 7640 SDslu, 13434 SDs, 0 SdLazy, 12820 SolverSat, 474 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 516 GetRequests, 129 SyntacticMatches, 75 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2678 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161868occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 103.9s AutomataMinimizationTime, 29 MinimizatonAttempts, 283999 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 953 NumberOfCodeBlocks, 953 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 868 ConstructedInterpolants, 0 QuantifiedInterpolants, 151056 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...