/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/safe024_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:36:28,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:36:28,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:36:28,635 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:36:28,635 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:36:28,637 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:36:28,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:36:28,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:36:28,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:36:28,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:36:28,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:36:28,660 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:36:28,661 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:36:28,664 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:36:28,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:36:28,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:36:28,667 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:36:28,671 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:36:28,673 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:36:28,678 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:36:28,682 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:36:28,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:36:28,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:36:28,685 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:36:28,688 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:36:28,688 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:36:28,688 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:36:28,690 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:36:28,691 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:36:28,692 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:36:28,693 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:36:28,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:36:28,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:36:28,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:36:28,698 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:36:28,698 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:36:28,700 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:36:28,700 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:36:28,700 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:36:28,703 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:36:28,705 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:36:28,705 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:36:28,724 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:36:28,724 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:36:28,728 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:36:28,729 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:36:28,729 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:36:28,729 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:36:28,729 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:36:28,730 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:36:28,730 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:36:28,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:36:28,731 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:36:28,731 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:36:28,731 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:36:28,732 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:36:28,732 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:36:28,732 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:36:28,732 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:36:28,733 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:36:28,733 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:36:28,733 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:36:28,733 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:36:28,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:36:28,734 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:36:28,734 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:36:28,734 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:36:28,734 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:36:28,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:36:28,735 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:36:28,735 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:36:28,735 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:36:28,736 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:36:29,005 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:36:29,026 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:36:29,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:36:29,032 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:36:29,032 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:36:29,033 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe024_rmo.oepc.i [2019-12-27 18:36:29,101 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be18ac3e5/290f6e72d9e94e3398b77a28feef6bd8/FLAG7e67c49fa [2019-12-27 18:36:29,632 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:36:29,633 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe024_rmo.oepc.i [2019-12-27 18:36:29,652 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be18ac3e5/290f6e72d9e94e3398b77a28feef6bd8/FLAG7e67c49fa [2019-12-27 18:36:29,913 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be18ac3e5/290f6e72d9e94e3398b77a28feef6bd8 [2019-12-27 18:36:29,926 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:36:29,928 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:36:29,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:36:29,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:36:29,933 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:36:29,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:36:29" (1/1) ... [2019-12-27 18:36:29,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e5e2723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:29, skipping insertion in model container [2019-12-27 18:36:29,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:36:29" (1/1) ... [2019-12-27 18:36:29,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:36:30,018 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:36:30,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:36:30,542 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:36:30,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:36:30,696 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:36:30,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:30 WrapperNode [2019-12-27 18:36:30,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:36:30,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:36:30,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:36:30,698 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:36:30,708 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:36:30" (1/1) ... [2019-12-27 18:36:30,727 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:30" (1/1) ... [2019-12-27 18:36:30,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:36:30,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:36:30,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:36:30,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:36:30,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:30" (1/1) ... [2019-12-27 18:36:30,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:30" (1/1) ... [2019-12-27 18:36:30,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:30" (1/1) ... [2019-12-27 18:36:30,785 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:30" (1/1) ... [2019-12-27 18:36:30,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:30" (1/1) ... [2019-12-27 18:36:30,801 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:30" (1/1) ... [2019-12-27 18:36:30,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:30" (1/1) ... [2019-12-27 18:36:30,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:36:30,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:36:30,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:36:30,810 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:36:30,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:30" (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:36:30,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:36:30,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:36:30,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:36:30,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:36:30,877 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:36:30,878 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:36:30,878 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:36:30,878 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:36:30,878 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:36:30,878 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:36:30,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:36:30,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:36:30,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:36:30,881 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:36:31,541 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:36:31,542 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:36:31,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:36:31 BoogieIcfgContainer [2019-12-27 18:36:31,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:36:31,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:36:31,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:36:31,549 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:36:31,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:36:29" (1/3) ... [2019-12-27 18:36:31,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645c01a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:36:31, skipping insertion in model container [2019-12-27 18:36:31,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:36:30" (2/3) ... [2019-12-27 18:36:31,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645c01a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:36:31, skipping insertion in model container [2019-12-27 18:36:31,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:36:31" (3/3) ... [2019-12-27 18:36:31,555 INFO L109 eAbstractionObserver]: Analyzing ICFG safe024_rmo.oepc.i [2019-12-27 18:36:31,565 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:36:31,565 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:36:31,581 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:36:31,582 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:36:31,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,622 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,623 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,662 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,662 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,663 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,663 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,663 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,669 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,670 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,670 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,670 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,671 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,672 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,673 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,674 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,675 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,678 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,679 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,679 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,683 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,684 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,684 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,684 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,685 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,688 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,689 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:36:31,707 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:36:31,727 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:36:31,728 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:36:31,728 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:36:31,728 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:36:31,728 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:36:31,728 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:36:31,728 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:36:31,728 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:36:31,745 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 18:36:31,747 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 18:36:31,841 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 18:36:31,842 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:36:31,857 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:36:31,880 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 18:36:31,932 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 18:36:31,932 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:36:31,940 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:36:31,960 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 18:36:31,961 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:36:32,194 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-12-27 18:36:37,202 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 18:36:37,324 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 18:36:37,354 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66430 [2019-12-27 18:36:37,355 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 18:36:37,358 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 89 transitions [2019-12-27 18:36:48,954 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 89098 states. [2019-12-27 18:36:48,956 INFO L276 IsEmpty]: Start isEmpty. Operand 89098 states. [2019-12-27 18:36:48,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 18:36:48,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:36:48,963 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 18:36:48,963 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:36:48,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:36:48,969 INFO L82 PathProgramCache]: Analyzing trace with hash 797474656, now seen corresponding path program 1 times [2019-12-27 18:36:48,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:36:48,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576286009] [2019-12-27 18:36:48,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:36:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:36:49,261 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:36:49,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576286009] [2019-12-27 18:36:49,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:36:49,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:36:49,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [155884010] [2019-12-27 18:36:49,267 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:36:49,272 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:36:49,285 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 18:36:49,286 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:36:49,289 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:36:49,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:36:49,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:36:49,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:36:49,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:36:49,308 INFO L87 Difference]: Start difference. First operand 89098 states. Second operand 3 states. [2019-12-27 18:36:52,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:36:52,986 INFO L93 Difference]: Finished difference Result 87834 states and 374974 transitions. [2019-12-27 18:36:52,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:36:52,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 18:36:52,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:36:53,595 INFO L225 Difference]: With dead ends: 87834 [2019-12-27 18:36:53,596 INFO L226 Difference]: Without dead ends: 82738 [2019-12-27 18:36:53,597 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:36:56,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82738 states. [2019-12-27 18:36:59,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82738 to 82738. [2019-12-27 18:36:59,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82738 states. [2019-12-27 18:37:02,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82738 states to 82738 states and 352742 transitions. [2019-12-27 18:37:02,581 INFO L78 Accepts]: Start accepts. Automaton has 82738 states and 352742 transitions. Word has length 5 [2019-12-27 18:37:02,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:02,581 INFO L462 AbstractCegarLoop]: Abstraction has 82738 states and 352742 transitions. [2019-12-27 18:37:02,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:37:02,581 INFO L276 IsEmpty]: Start isEmpty. Operand 82738 states and 352742 transitions. [2019-12-27 18:37:02,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:37:02,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:02,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:37:02,591 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:37:02,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:02,591 INFO L82 PathProgramCache]: Analyzing trace with hash 334215788, now seen corresponding path program 1 times [2019-12-27 18:37:02,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:02,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294973758] [2019-12-27 18:37:02,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:02,777 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:37:02,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294973758] [2019-12-27 18:37:02,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:02,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:37:02,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1410250100] [2019-12-27 18:37:02,780 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:02,782 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:02,789 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:37:02,789 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:02,789 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:37:02,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:37:02,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:02,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:37:02,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:37:02,792 INFO L87 Difference]: Start difference. First operand 82738 states and 352742 transitions. Second operand 4 states. [2019-12-27 18:37:07,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:07,656 INFO L93 Difference]: Finished difference Result 127286 states and 521114 transitions. [2019-12-27 18:37:07,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:37:07,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:37:07,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:08,446 INFO L225 Difference]: With dead ends: 127286 [2019-12-27 18:37:08,446 INFO L226 Difference]: Without dead ends: 127202 [2019-12-27 18:37:08,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:37:12,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127202 states. [2019-12-27 18:37:14,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127202 to 115962. [2019-12-27 18:37:14,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115962 states. [2019-12-27 18:37:14,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115962 states to 115962 states and 480151 transitions. [2019-12-27 18:37:14,947 INFO L78 Accepts]: Start accepts. Automaton has 115962 states and 480151 transitions. Word has length 13 [2019-12-27 18:37:14,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:14,948 INFO L462 AbstractCegarLoop]: Abstraction has 115962 states and 480151 transitions. [2019-12-27 18:37:14,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:37:14,949 INFO L276 IsEmpty]: Start isEmpty. Operand 115962 states and 480151 transitions. [2019-12-27 18:37:14,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:37:14,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:14,952 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:37:14,952 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:37:14,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:14,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1013985610, now seen corresponding path program 1 times [2019-12-27 18:37:14,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:14,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171678311] [2019-12-27 18:37:14,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:15,003 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:37:15,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171678311] [2019-12-27 18:37:15,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:15,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:37:15,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1795614863] [2019-12-27 18:37:15,004 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:15,005 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:15,007 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:37:15,007 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:15,007 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:37:15,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:37:15,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:15,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:37:15,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:37:15,008 INFO L87 Difference]: Start difference. First operand 115962 states and 480151 transitions. Second operand 3 states. [2019-12-27 18:37:18,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:18,496 INFO L93 Difference]: Finished difference Result 28492 states and 95363 transitions. [2019-12-27 18:37:18,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:37:18,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 18:37:18,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:18,564 INFO L225 Difference]: With dead ends: 28492 [2019-12-27 18:37:18,564 INFO L226 Difference]: Without dead ends: 28492 [2019-12-27 18:37:18,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:37:18,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28492 states. [2019-12-27 18:37:19,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28492 to 28492. [2019-12-27 18:37:19,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28492 states. [2019-12-27 18:37:19,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28492 states to 28492 states and 95363 transitions. [2019-12-27 18:37:19,360 INFO L78 Accepts]: Start accepts. Automaton has 28492 states and 95363 transitions. Word has length 13 [2019-12-27 18:37:19,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:19,363 INFO L462 AbstractCegarLoop]: Abstraction has 28492 states and 95363 transitions. [2019-12-27 18:37:19,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:37:19,363 INFO L276 IsEmpty]: Start isEmpty. Operand 28492 states and 95363 transitions. [2019-12-27 18:37:19,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:37:19,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:19,370 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:37:19,370 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:37:19,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:19,371 INFO L82 PathProgramCache]: Analyzing trace with hash 319138254, now seen corresponding path program 1 times [2019-12-27 18:37:19,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:19,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798604063] [2019-12-27 18:37:19,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:19,488 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:37:19,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798604063] [2019-12-27 18:37:19,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:19,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:37:19,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1518499309] [2019-12-27 18:37:19,491 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:19,492 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:19,496 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:37:19,497 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:19,498 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:37:19,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:37:19,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:19,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:37:19,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:37:19,500 INFO L87 Difference]: Start difference. First operand 28492 states and 95363 transitions. Second operand 5 states. [2019-12-27 18:37:19,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:19,964 INFO L93 Difference]: Finished difference Result 41156 states and 135447 transitions. [2019-12-27 18:37:19,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:37:19,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:37:19,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:20,037 INFO L225 Difference]: With dead ends: 41156 [2019-12-27 18:37:20,037 INFO L226 Difference]: Without dead ends: 41141 [2019-12-27 18:37:20,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:37:20,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41141 states. [2019-12-27 18:37:20,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41141 to 31619. [2019-12-27 18:37:20,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31619 states. [2019-12-27 18:37:20,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31619 states to 31619 states and 105299 transitions. [2019-12-27 18:37:20,948 INFO L78 Accepts]: Start accepts. Automaton has 31619 states and 105299 transitions. Word has length 14 [2019-12-27 18:37:20,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:20,949 INFO L462 AbstractCegarLoop]: Abstraction has 31619 states and 105299 transitions. [2019-12-27 18:37:20,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:37:20,949 INFO L276 IsEmpty]: Start isEmpty. Operand 31619 states and 105299 transitions. [2019-12-27 18:37:20,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:37:20,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:20,960 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:37:20,960 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:37:20,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:20,960 INFO L82 PathProgramCache]: Analyzing trace with hash 436639450, now seen corresponding path program 1 times [2019-12-27 18:37:20,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:20,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059140841] [2019-12-27 18:37:20,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:21,071 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:37:21,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059140841] [2019-12-27 18:37:21,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:21,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:37:21,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [350956220] [2019-12-27 18:37:21,072 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:21,076 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:21,089 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 110 transitions. [2019-12-27 18:37:21,089 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:21,090 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:37:21,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:37:21,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:21,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:37:21,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:37:21,091 INFO L87 Difference]: Start difference. First operand 31619 states and 105299 transitions. Second operand 6 states. [2019-12-27 18:37:21,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:21,936 INFO L93 Difference]: Finished difference Result 48363 states and 157775 transitions. [2019-12-27 18:37:21,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:37:21,937 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 18:37:21,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:22,018 INFO L225 Difference]: With dead ends: 48363 [2019-12-27 18:37:22,019 INFO L226 Difference]: Without dead ends: 48336 [2019-12-27 18:37:22,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:37:22,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48336 states. [2019-12-27 18:37:22,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48336 to 33272. [2019-12-27 18:37:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33272 states. [2019-12-27 18:37:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33272 states to 33272 states and 109841 transitions. [2019-12-27 18:37:22,687 INFO L78 Accepts]: Start accepts. Automaton has 33272 states and 109841 transitions. Word has length 22 [2019-12-27 18:37:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:22,687 INFO L462 AbstractCegarLoop]: Abstraction has 33272 states and 109841 transitions. [2019-12-27 18:37:22,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:37:22,688 INFO L276 IsEmpty]: Start isEmpty. Operand 33272 states and 109841 transitions. [2019-12-27 18:37:22,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:37:22,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:22,704 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:37:22,704 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:37:22,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:22,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1832050687, now seen corresponding path program 1 times [2019-12-27 18:37:22,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:22,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879259095] [2019-12-27 18:37:22,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:22,941 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:37:22,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879259095] [2019-12-27 18:37:22,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:22,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:37:22,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [729587084] [2019-12-27 18:37:22,942 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:22,946 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:22,951 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:37:22,951 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:22,951 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:37:22,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:37:22,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:22,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:37:22,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:37:22,952 INFO L87 Difference]: Start difference. First operand 33272 states and 109841 transitions. Second operand 4 states. [2019-12-27 18:37:23,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:23,025 INFO L93 Difference]: Finished difference Result 12861 states and 39176 transitions. [2019-12-27 18:37:23,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:37:23,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 18:37:23,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:23,046 INFO L225 Difference]: With dead ends: 12861 [2019-12-27 18:37:23,046 INFO L226 Difference]: Without dead ends: 12861 [2019-12-27 18:37:23,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:37:23,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-12-27 18:37:23,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 12721. [2019-12-27 18:37:23,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12721 states. [2019-12-27 18:37:23,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12721 states to 12721 states and 38766 transitions. [2019-12-27 18:37:23,228 INFO L78 Accepts]: Start accepts. Automaton has 12721 states and 38766 transitions. Word has length 25 [2019-12-27 18:37:23,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:23,228 INFO L462 AbstractCegarLoop]: Abstraction has 12721 states and 38766 transitions. [2019-12-27 18:37:23,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:37:23,229 INFO L276 IsEmpty]: Start isEmpty. Operand 12721 states and 38766 transitions. [2019-12-27 18:37:23,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 18:37:23,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:23,246 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:37:23,246 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:37:23,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:23,247 INFO L82 PathProgramCache]: Analyzing trace with hash 207279171, now seen corresponding path program 1 times [2019-12-27 18:37:23,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:23,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119764912] [2019-12-27 18:37:23,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:23,317 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:37:23,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119764912] [2019-12-27 18:37:23,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:23,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:37:23,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1276400289] [2019-12-27 18:37:23,318 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:23,327 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:23,376 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 114 states and 187 transitions. [2019-12-27 18:37:23,376 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:23,377 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:37:23,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:37:23,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:23,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:37:23,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:37:23,378 INFO L87 Difference]: Start difference. First operand 12721 states and 38766 transitions. Second operand 5 states. [2019-12-27 18:37:23,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:23,436 INFO L93 Difference]: Finished difference Result 11425 states and 35436 transitions. [2019-12-27 18:37:23,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:37:23,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 18:37:23,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:23,455 INFO L225 Difference]: With dead ends: 11425 [2019-12-27 18:37:23,455 INFO L226 Difference]: Without dead ends: 11425 [2019-12-27 18:37:23,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:37:23,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11425 states. [2019-12-27 18:37:23,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11425 to 10977. [2019-12-27 18:37:23,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10977 states. [2019-12-27 18:37:23,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10977 states to 10977 states and 34172 transitions. [2019-12-27 18:37:23,622 INFO L78 Accepts]: Start accepts. Automaton has 10977 states and 34172 transitions. Word has length 39 [2019-12-27 18:37:23,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:23,623 INFO L462 AbstractCegarLoop]: Abstraction has 10977 states and 34172 transitions. [2019-12-27 18:37:23,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:37:23,623 INFO L276 IsEmpty]: Start isEmpty. Operand 10977 states and 34172 transitions. [2019-12-27 18:37:23,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:37:23,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:23,640 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:37:23,640 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:37:23,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:23,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1179829373, now seen corresponding path program 1 times [2019-12-27 18:37:23,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:23,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945330627] [2019-12-27 18:37:23,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:23,739 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:37:23,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945330627] [2019-12-27 18:37:23,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:23,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:37:23,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2138429746] [2019-12-27 18:37:23,740 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:23,759 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:23,892 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 239 states and 471 transitions. [2019-12-27 18:37:23,892 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:23,959 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 18:37:23,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:37:23,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:23,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:37:23,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:37:23,961 INFO L87 Difference]: Start difference. First operand 10977 states and 34172 transitions. Second operand 7 states. [2019-12-27 18:37:24,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:24,456 INFO L93 Difference]: Finished difference Result 25197 states and 77861 transitions. [2019-12-27 18:37:24,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 18:37:24,456 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 18:37:24,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:24,478 INFO L225 Difference]: With dead ends: 25197 [2019-12-27 18:37:24,478 INFO L226 Difference]: Without dead ends: 13995 [2019-12-27 18:37:24,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:37:24,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13995 states. [2019-12-27 18:37:24,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13995 to 9365. [2019-12-27 18:37:24,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9365 states. [2019-12-27 18:37:24,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9365 states to 9365 states and 29013 transitions. [2019-12-27 18:37:24,808 INFO L78 Accepts]: Start accepts. Automaton has 9365 states and 29013 transitions. Word has length 53 [2019-12-27 18:37:24,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:24,808 INFO L462 AbstractCegarLoop]: Abstraction has 9365 states and 29013 transitions. [2019-12-27 18:37:24,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:37:24,808 INFO L276 IsEmpty]: Start isEmpty. Operand 9365 states and 29013 transitions. [2019-12-27 18:37:24,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:37:24,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:24,821 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:37:24,821 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:37:24,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:24,822 INFO L82 PathProgramCache]: Analyzing trace with hash 383407097, now seen corresponding path program 2 times [2019-12-27 18:37:24,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:24,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865877793] [2019-12-27 18:37:24,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:24,920 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:37:24,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865877793] [2019-12-27 18:37:24,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:24,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:37:24,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [322472857] [2019-12-27 18:37:24,921 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:24,937 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:25,124 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 205 states and 393 transitions. [2019-12-27 18:37:25,124 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:25,248 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 18:37:25,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:37:25,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:25,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:37:25,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:37:25,250 INFO L87 Difference]: Start difference. First operand 9365 states and 29013 transitions. Second operand 8 states. [2019-12-27 18:37:25,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:25,666 INFO L93 Difference]: Finished difference Result 23182 states and 71788 transitions. [2019-12-27 18:37:25,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:37:25,667 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-27 18:37:25,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:25,701 INFO L225 Difference]: With dead ends: 23182 [2019-12-27 18:37:25,702 INFO L226 Difference]: Without dead ends: 18276 [2019-12-27 18:37:25,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 9 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:37:25,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18276 states. [2019-12-27 18:37:25,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18276 to 11162. [2019-12-27 18:37:25,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11162 states. [2019-12-27 18:37:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11162 states to 11162 states and 34879 transitions. [2019-12-27 18:37:25,940 INFO L78 Accepts]: Start accepts. Automaton has 11162 states and 34879 transitions. Word has length 53 [2019-12-27 18:37:25,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:25,940 INFO L462 AbstractCegarLoop]: Abstraction has 11162 states and 34879 transitions. [2019-12-27 18:37:25,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:37:25,941 INFO L276 IsEmpty]: Start isEmpty. Operand 11162 states and 34879 transitions. [2019-12-27 18:37:25,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:37:25,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:25,956 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:37:25,956 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:37:25,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:25,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1401815865, now seen corresponding path program 3 times [2019-12-27 18:37:25,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:25,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321635208] [2019-12-27 18:37:25,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:26,058 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:37:26,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321635208] [2019-12-27 18:37:26,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:26,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:37:26,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2126225548] [2019-12-27 18:37:26,059 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:26,075 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:26,260 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 235 states and 453 transitions. [2019-12-27 18:37:26,260 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:26,425 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 18:37:26,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:37:26,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:26,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:37:26,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:37:26,426 INFO L87 Difference]: Start difference. First operand 11162 states and 34879 transitions. Second operand 11 states. [2019-12-27 18:37:28,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:28,524 INFO L93 Difference]: Finished difference Result 32552 states and 100072 transitions. [2019-12-27 18:37:28,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 18:37:28,524 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-12-27 18:37:28,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:28,558 INFO L225 Difference]: With dead ends: 32552 [2019-12-27 18:37:28,559 INFO L226 Difference]: Without dead ends: 24064 [2019-12-27 18:37:28,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2019-12-27 18:37:28,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24064 states. [2019-12-27 18:37:28,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24064 to 13020. [2019-12-27 18:37:28,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13020 states. [2019-12-27 18:37:28,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13020 states to 13020 states and 40574 transitions. [2019-12-27 18:37:28,834 INFO L78 Accepts]: Start accepts. Automaton has 13020 states and 40574 transitions. Word has length 53 [2019-12-27 18:37:28,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:28,834 INFO L462 AbstractCegarLoop]: Abstraction has 13020 states and 40574 transitions. [2019-12-27 18:37:28,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:37:28,834 INFO L276 IsEmpty]: Start isEmpty. Operand 13020 states and 40574 transitions. [2019-12-27 18:37:28,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:37:28,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:28,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:37:28,852 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:37:28,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:28,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1901485579, now seen corresponding path program 4 times [2019-12-27 18:37:28,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:28,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047263809] [2019-12-27 18:37:28,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:28,937 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:37:28,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047263809] [2019-12-27 18:37:28,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:28,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:37:28,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1241514420] [2019-12-27 18:37:28,938 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:28,953 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:29,080 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 390 transitions. [2019-12-27 18:37:29,081 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:29,310 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 19 times. [2019-12-27 18:37:29,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:37:29,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:29,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:37:29,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:37:29,311 INFO L87 Difference]: Start difference. First operand 13020 states and 40574 transitions. Second operand 10 states. [2019-12-27 18:37:31,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:31,366 INFO L93 Difference]: Finished difference Result 54777 states and 170133 transitions. [2019-12-27 18:37:31,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 18:37:31,367 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-12-27 18:37:31,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:31,435 INFO L225 Difference]: With dead ends: 54777 [2019-12-27 18:37:31,436 INFO L226 Difference]: Without dead ends: 43609 [2019-12-27 18:37:31,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 10 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=212, Invalid=718, Unknown=0, NotChecked=0, Total=930 [2019-12-27 18:37:31,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43609 states. [2019-12-27 18:37:32,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43609 to 15177. [2019-12-27 18:37:32,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15177 states. [2019-12-27 18:37:32,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15177 states to 15177 states and 47717 transitions. [2019-12-27 18:37:32,070 INFO L78 Accepts]: Start accepts. Automaton has 15177 states and 47717 transitions. Word has length 53 [2019-12-27 18:37:32,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:32,070 INFO L462 AbstractCegarLoop]: Abstraction has 15177 states and 47717 transitions. [2019-12-27 18:37:32,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:37:32,070 INFO L276 IsEmpty]: Start isEmpty. Operand 15177 states and 47717 transitions. [2019-12-27 18:37:32,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:37:32,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:32,087 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:37:32,087 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:37:32,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:32,087 INFO L82 PathProgramCache]: Analyzing trace with hash -9451933, now seen corresponding path program 1 times [2019-12-27 18:37:32,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:32,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540308750] [2019-12-27 18:37:32,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:32,142 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:37:32,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540308750] [2019-12-27 18:37:32,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:32,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:37:32,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1173192619] [2019-12-27 18:37:32,144 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:32,159 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:32,298 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 390 transitions. [2019-12-27 18:37:32,299 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:32,308 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:37:32,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:37:32,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:32,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:37:32,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:37:32,309 INFO L87 Difference]: Start difference. First operand 15177 states and 47717 transitions. Second operand 3 states. [2019-12-27 18:37:32,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:32,396 INFO L93 Difference]: Finished difference Result 20827 states and 65534 transitions. [2019-12-27 18:37:32,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:37:32,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 18:37:32,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:32,425 INFO L225 Difference]: With dead ends: 20827 [2019-12-27 18:37:32,425 INFO L226 Difference]: Without dead ends: 20827 [2019-12-27 18:37:32,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:37:32,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20827 states. [2019-12-27 18:37:32,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20827 to 18999. [2019-12-27 18:37:32,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18999 states. [2019-12-27 18:37:32,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18999 states to 18999 states and 60329 transitions. [2019-12-27 18:37:32,731 INFO L78 Accepts]: Start accepts. Automaton has 18999 states and 60329 transitions. Word has length 53 [2019-12-27 18:37:32,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:32,731 INFO L462 AbstractCegarLoop]: Abstraction has 18999 states and 60329 transitions. [2019-12-27 18:37:32,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:37:32,731 INFO L276 IsEmpty]: Start isEmpty. Operand 18999 states and 60329 transitions. [2019-12-27 18:37:32,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:37:32,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:32,752 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:37:32,752 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:37:32,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:32,753 INFO L82 PathProgramCache]: Analyzing trace with hash 2081547793, now seen corresponding path program 5 times [2019-12-27 18:37:32,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:32,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291735765] [2019-12-27 18:37:32,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:32,853 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:37:32,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291735765] [2019-12-27 18:37:32,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:32,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:37:32,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1182708329] [2019-12-27 18:37:32,855 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:32,870 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:33,008 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 338 transitions. [2019-12-27 18:37:33,009 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:33,105 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 18:37:33,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:37:33,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:33,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:37:33,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:37:33,107 INFO L87 Difference]: Start difference. First operand 18999 states and 60329 transitions. Second operand 11 states. [2019-12-27 18:37:37,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:37,107 INFO L93 Difference]: Finished difference Result 63665 states and 197641 transitions. [2019-12-27 18:37:37,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 18:37:37,108 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-12-27 18:37:37,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:37,210 INFO L225 Difference]: With dead ends: 63665 [2019-12-27 18:37:37,210 INFO L226 Difference]: Without dead ends: 63581 [2019-12-27 18:37:37,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=566, Invalid=1786, Unknown=0, NotChecked=0, Total=2352 [2019-12-27 18:37:37,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63581 states. [2019-12-27 18:37:37,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63581 to 22369. [2019-12-27 18:37:37,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22369 states. [2019-12-27 18:37:37,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22369 states to 22369 states and 70393 transitions. [2019-12-27 18:37:37,893 INFO L78 Accepts]: Start accepts. Automaton has 22369 states and 70393 transitions. Word has length 53 [2019-12-27 18:37:37,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:37,894 INFO L462 AbstractCegarLoop]: Abstraction has 22369 states and 70393 transitions. [2019-12-27 18:37:37,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:37:37,894 INFO L276 IsEmpty]: Start isEmpty. Operand 22369 states and 70393 transitions. [2019-12-27 18:37:37,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:37:37,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:37,929 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:37:37,929 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:37:37,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:37,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1629843107, now seen corresponding path program 6 times [2019-12-27 18:37:37,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:37,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967646746] [2019-12-27 18:37:37,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:38,030 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:37:38,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967646746] [2019-12-27 18:37:38,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:38,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:37:38,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [316204200] [2019-12-27 18:37:38,031 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:38,060 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:38,420 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 222 states and 389 transitions. [2019-12-27 18:37:38,420 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:38,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:37:38,633 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 18:37:38,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:37:38,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:38,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:37:38,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:37:38,635 INFO L87 Difference]: Start difference. First operand 22369 states and 70393 transitions. Second operand 11 states. [2019-12-27 18:37:40,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:40,514 INFO L93 Difference]: Finished difference Result 39365 states and 120485 transitions. [2019-12-27 18:37:40,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 18:37:40,515 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-12-27 18:37:40,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:40,574 INFO L225 Difference]: With dead ends: 39365 [2019-12-27 18:37:40,574 INFO L226 Difference]: Without dead ends: 39243 [2019-12-27 18:37:40,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2019-12-27 18:37:40,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39243 states. [2019-12-27 18:37:41,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39243 to 28182. [2019-12-27 18:37:41,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28182 states. [2019-12-27 18:37:41,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28182 states to 28182 states and 87592 transitions. [2019-12-27 18:37:41,127 INFO L78 Accepts]: Start accepts. Automaton has 28182 states and 87592 transitions. Word has length 53 [2019-12-27 18:37:41,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:41,127 INFO L462 AbstractCegarLoop]: Abstraction has 28182 states and 87592 transitions. [2019-12-27 18:37:41,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:37:41,127 INFO L276 IsEmpty]: Start isEmpty. Operand 28182 states and 87592 transitions. [2019-12-27 18:37:41,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:37:41,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:41,160 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:37:41,160 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:37:41,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:41,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1109995221, now seen corresponding path program 7 times [2019-12-27 18:37:41,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:41,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405893444] [2019-12-27 18:37:41,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:41,311 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:37:41,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405893444] [2019-12-27 18:37:41,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:41,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 18:37:41,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1630598285] [2019-12-27 18:37:41,312 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:41,331 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:41,477 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 313 transitions. [2019-12-27 18:37:41,477 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:41,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:37:41,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:37:41,684 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 18:37:41,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:37:41,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:41,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:37:41,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:37:41,685 INFO L87 Difference]: Start difference. First operand 28182 states and 87592 transitions. Second operand 13 states. [2019-12-27 18:37:45,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:45,260 INFO L93 Difference]: Finished difference Result 61696 states and 187701 transitions. [2019-12-27 18:37:45,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 18:37:45,260 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-12-27 18:37:45,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:45,356 INFO L225 Difference]: With dead ends: 61696 [2019-12-27 18:37:45,357 INFO L226 Difference]: Without dead ends: 61696 [2019-12-27 18:37:45,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 8 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=471, Invalid=1785, Unknown=0, NotChecked=0, Total=2256 [2019-12-27 18:37:45,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61696 states. [2019-12-27 18:37:46,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61696 to 26700. [2019-12-27 18:37:46,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26700 states. [2019-12-27 18:37:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26700 states to 26700 states and 83274 transitions. [2019-12-27 18:37:46,067 INFO L78 Accepts]: Start accepts. Automaton has 26700 states and 83274 transitions. Word has length 53 [2019-12-27 18:37:46,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:46,068 INFO L462 AbstractCegarLoop]: Abstraction has 26700 states and 83274 transitions. [2019-12-27 18:37:46,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:37:46,068 INFO L276 IsEmpty]: Start isEmpty. Operand 26700 states and 83274 transitions. [2019-12-27 18:37:46,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 18:37:46,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:46,098 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:37:46,098 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:37:46,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:46,099 INFO L82 PathProgramCache]: Analyzing trace with hash 2099294685, now seen corresponding path program 8 times [2019-12-27 18:37:46,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:46,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553747150] [2019-12-27 18:37:46,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:46,187 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:37:46,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553747150] [2019-12-27 18:37:46,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:46,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:37:46,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [29714479] [2019-12-27 18:37:46,188 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:46,202 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:46,330 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 316 transitions. [2019-12-27 18:37:46,331 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:46,331 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:37:46,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:37:46,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:46,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:37:46,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:37:46,332 INFO L87 Difference]: Start difference. First operand 26700 states and 83274 transitions. Second operand 3 states. [2019-12-27 18:37:46,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:46,572 INFO L93 Difference]: Finished difference Result 26698 states and 83269 transitions. [2019-12-27 18:37:46,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:37:46,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 18:37:46,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:46,612 INFO L225 Difference]: With dead ends: 26698 [2019-12-27 18:37:46,612 INFO L226 Difference]: Without dead ends: 26698 [2019-12-27 18:37:46,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:37:46,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26698 states. [2019-12-27 18:37:46,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26698 to 24380. [2019-12-27 18:37:46,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24380 states. [2019-12-27 18:37:47,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24380 states to 24380 states and 76962 transitions. [2019-12-27 18:37:47,000 INFO L78 Accepts]: Start accepts. Automaton has 24380 states and 76962 transitions. Word has length 53 [2019-12-27 18:37:47,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:47,001 INFO L462 AbstractCegarLoop]: Abstraction has 24380 states and 76962 transitions. [2019-12-27 18:37:47,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:37:47,001 INFO L276 IsEmpty]: Start isEmpty. Operand 24380 states and 76962 transitions. [2019-12-27 18:37:47,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:37:47,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:47,026 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:37:47,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:37:47,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:47,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1545980158, now seen corresponding path program 1 times [2019-12-27 18:37:47,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:47,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941814555] [2019-12-27 18:37:47,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:47,089 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:37:47,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941814555] [2019-12-27 18:37:47,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:47,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:37:47,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [38268862] [2019-12-27 18:37:47,090 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:47,104 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:47,242 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 339 transitions. [2019-12-27 18:37:47,242 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:47,249 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:37:47,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:37:47,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:47,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:37:47,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:37:47,250 INFO L87 Difference]: Start difference. First operand 24380 states and 76962 transitions. Second operand 4 states. [2019-12-27 18:37:47,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:47,472 INFO L93 Difference]: Finished difference Result 24651 states and 75392 transitions. [2019-12-27 18:37:47,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:37:47,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-27 18:37:47,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:47,508 INFO L225 Difference]: With dead ends: 24651 [2019-12-27 18:37:47,509 INFO L226 Difference]: Without dead ends: 24651 [2019-12-27 18:37:47,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:37:47,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24651 states. [2019-12-27 18:37:47,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24651 to 18285. [2019-12-27 18:37:47,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18285 states. [2019-12-27 18:37:47,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18285 states to 18285 states and 56361 transitions. [2019-12-27 18:37:47,819 INFO L78 Accepts]: Start accepts. Automaton has 18285 states and 56361 transitions. Word has length 54 [2019-12-27 18:37:47,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:47,819 INFO L462 AbstractCegarLoop]: Abstraction has 18285 states and 56361 transitions. [2019-12-27 18:37:47,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:37:47,819 INFO L276 IsEmpty]: Start isEmpty. Operand 18285 states and 56361 transitions. [2019-12-27 18:37:47,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 18:37:47,837 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:47,837 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] [2019-12-27 18:37:47,837 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:37:47,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:47,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1024706095, now seen corresponding path program 1 times [2019-12-27 18:37:47,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:47,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051315396] [2019-12-27 18:37:47,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:48,305 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:37:48,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051315396] [2019-12-27 18:37:48,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:48,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 18:37:48,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1691651564] [2019-12-27 18:37:48,310 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:48,325 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:48,667 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 383 transitions. [2019-12-27 18:37:48,667 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:49,346 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 18:37:49,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 18:37:49,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:49,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 18:37:49,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2019-12-27 18:37:49,347 INFO L87 Difference]: Start difference. First operand 18285 states and 56361 transitions. Second operand 25 states. [2019-12-27 18:37:58,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:37:58,097 INFO L93 Difference]: Finished difference Result 46734 states and 141728 transitions. [2019-12-27 18:37:58,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-12-27 18:37:58,098 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2019-12-27 18:37:58,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:37:58,158 INFO L225 Difference]: With dead ends: 46734 [2019-12-27 18:37:58,158 INFO L226 Difference]: Without dead ends: 46184 [2019-12-27 18:37:58,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 11 SyntacticMatches, 12 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3042 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1442, Invalid=8658, Unknown=0, NotChecked=0, Total=10100 [2019-12-27 18:37:58,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46184 states. [2019-12-27 18:37:58,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46184 to 21439. [2019-12-27 18:37:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21439 states. [2019-12-27 18:37:58,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21439 states to 21439 states and 65657 transitions. [2019-12-27 18:37:58,618 INFO L78 Accepts]: Start accepts. Automaton has 21439 states and 65657 transitions. Word has length 55 [2019-12-27 18:37:58,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:37:58,618 INFO L462 AbstractCegarLoop]: Abstraction has 21439 states and 65657 transitions. [2019-12-27 18:37:58,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 18:37:58,619 INFO L276 IsEmpty]: Start isEmpty. Operand 21439 states and 65657 transitions. [2019-12-27 18:37:58,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 18:37:58,641 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:37:58,641 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] [2019-12-27 18:37:58,641 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:37:58,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:37:58,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1698448247, now seen corresponding path program 2 times [2019-12-27 18:37:58,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:37:58,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825615682] [2019-12-27 18:37:58,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:37:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:37:59,113 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:37:59,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825615682] [2019-12-27 18:37:59,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:37:59,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 18:37:59,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1739754208] [2019-12-27 18:37:59,114 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:37:59,129 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:37:59,249 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 327 transitions. [2019-12-27 18:37:59,249 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:37:59,816 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 29 times. [2019-12-27 18:37:59,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 18:37:59,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:37:59,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 18:37:59,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-12-27 18:37:59,817 INFO L87 Difference]: Start difference. First operand 21439 states and 65657 transitions. Second operand 23 states. [2019-12-27 18:38:07,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:38:07,827 INFO L93 Difference]: Finished difference Result 48495 states and 147180 transitions. [2019-12-27 18:38:07,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-27 18:38:07,828 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 55 [2019-12-27 18:38:07,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:38:07,891 INFO L225 Difference]: With dead ends: 48495 [2019-12-27 18:38:07,892 INFO L226 Difference]: Without dead ends: 40901 [2019-12-27 18:38:07,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 12 SyntacticMatches, 14 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=809, Invalid=4447, Unknown=0, NotChecked=0, Total=5256 [2019-12-27 18:38:08,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40901 states. [2019-12-27 18:38:08,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40901 to 18997. [2019-12-27 18:38:08,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18997 states. [2019-12-27 18:38:08,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18997 states to 18997 states and 58170 transitions. [2019-12-27 18:38:08,340 INFO L78 Accepts]: Start accepts. Automaton has 18997 states and 58170 transitions. Word has length 55 [2019-12-27 18:38:08,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:38:08,340 INFO L462 AbstractCegarLoop]: Abstraction has 18997 states and 58170 transitions. [2019-12-27 18:38:08,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 18:38:08,340 INFO L276 IsEmpty]: Start isEmpty. Operand 18997 states and 58170 transitions. [2019-12-27 18:38:08,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 18:38:08,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:38:08,360 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] [2019-12-27 18:38:08,360 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:38:08,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:38:08,361 INFO L82 PathProgramCache]: Analyzing trace with hash -2043347127, now seen corresponding path program 3 times [2019-12-27 18:38:08,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:38:08,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239158803] [2019-12-27 18:38:08,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:38:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:38:08,830 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:38:08,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239158803] [2019-12-27 18:38:08,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:38:08,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 18:38:08,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [468204063] [2019-12-27 18:38:08,831 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:38:08,847 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:38:09,053 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 215 states and 415 transitions. [2019-12-27 18:38:09,054 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:38:09,654 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 18:38:09,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 18:38:09,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:38:09,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 18:38:09,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-12-27 18:38:09,655 INFO L87 Difference]: Start difference. First operand 18997 states and 58170 transitions. Second operand 22 states. [2019-12-27 18:38:14,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:38:14,430 INFO L93 Difference]: Finished difference Result 31761 states and 96139 transitions. [2019-12-27 18:38:14,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 18:38:14,431 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 55 [2019-12-27 18:38:14,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:38:14,478 INFO L225 Difference]: With dead ends: 31761 [2019-12-27 18:38:14,478 INFO L226 Difference]: Without dead ends: 31439 [2019-12-27 18:38:14,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 11 SyntacticMatches, 14 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 913 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=574, Invalid=3086, Unknown=0, NotChecked=0, Total=3660 [2019-12-27 18:38:14,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31439 states. [2019-12-27 18:38:14,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31439 to 18853. [2019-12-27 18:38:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18853 states. [2019-12-27 18:38:14,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18853 states to 18853 states and 57774 transitions. [2019-12-27 18:38:14,868 INFO L78 Accepts]: Start accepts. Automaton has 18853 states and 57774 transitions. Word has length 55 [2019-12-27 18:38:14,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:38:14,869 INFO L462 AbstractCegarLoop]: Abstraction has 18853 states and 57774 transitions. [2019-12-27 18:38:14,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 18:38:14,869 INFO L276 IsEmpty]: Start isEmpty. Operand 18853 states and 57774 transitions. [2019-12-27 18:38:14,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 18:38:14,892 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:38:14,892 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] [2019-12-27 18:38:14,892 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:38:14,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:38:14,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1449339733, now seen corresponding path program 4 times [2019-12-27 18:38:14,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:38:14,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709253984] [2019-12-27 18:38:14,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:38:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:38:15,353 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:38:15,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709253984] [2019-12-27 18:38:15,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:38:15,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 18:38:15,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2036844210] [2019-12-27 18:38:15,354 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:38:15,369 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:38:15,532 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 229 states and 450 transitions. [2019-12-27 18:38:15,533 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:38:16,682 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 36 times. [2019-12-27 18:38:16,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-27 18:38:16,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:38:16,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-27 18:38:16,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2019-12-27 18:38:16,684 INFO L87 Difference]: Start difference. First operand 18853 states and 57774 transitions. Second operand 27 states. [2019-12-27 18:38:29,657 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-12-27 18:38:37,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:38:37,504 INFO L93 Difference]: Finished difference Result 62385 states and 187107 transitions. [2019-12-27 18:38:37,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2019-12-27 18:38:37,505 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 55 [2019-12-27 18:38:37,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:38:37,605 INFO L225 Difference]: With dead ends: 62385 [2019-12-27 18:38:37,605 INFO L226 Difference]: Without dead ends: 59239 [2019-12-27 18:38:37,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 12 SyntacticMatches, 14 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11443 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=4035, Invalid=27117, Unknown=0, NotChecked=0, Total=31152 [2019-12-27 18:38:37,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59239 states. [2019-12-27 18:38:38,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59239 to 26546. [2019-12-27 18:38:38,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26546 states. [2019-12-27 18:38:38,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26546 states to 26546 states and 81147 transitions. [2019-12-27 18:38:38,471 INFO L78 Accepts]: Start accepts. Automaton has 26546 states and 81147 transitions. Word has length 55 [2019-12-27 18:38:38,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:38:38,471 INFO L462 AbstractCegarLoop]: Abstraction has 26546 states and 81147 transitions. [2019-12-27 18:38:38,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-27 18:38:38,471 INFO L276 IsEmpty]: Start isEmpty. Operand 26546 states and 81147 transitions. [2019-12-27 18:38:38,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 18:38:38,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:38:38,502 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] [2019-12-27 18:38:38,502 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:38:38,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:38:38,502 INFO L82 PathProgramCache]: Analyzing trace with hash -381651263, now seen corresponding path program 5 times [2019-12-27 18:38:38,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:38:38,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928599744] [2019-12-27 18:38:38,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:38:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:38:38,890 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:38:38,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928599744] [2019-12-27 18:38:38,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:38:38,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 18:38:38,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [444605118] [2019-12-27 18:38:38,895 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:38:38,912 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:38:39,094 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 245 states and 498 transitions. [2019-12-27 18:38:39,094 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:38:40,194 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 48 times. [2019-12-27 18:38:40,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 18:38:40,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:38:40,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 18:38:40,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2019-12-27 18:38:40,195 INFO L87 Difference]: Start difference. First operand 26546 states and 81147 transitions. Second operand 30 states. [2019-12-27 18:38:45,857 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2019-12-27 18:39:14,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:39:14,398 INFO L93 Difference]: Finished difference Result 75346 states and 225273 transitions. [2019-12-27 18:39:14,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2019-12-27 18:39:14,399 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 55 [2019-12-27 18:39:14,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:39:14,529 INFO L225 Difference]: With dead ends: 75346 [2019-12-27 18:39:14,529 INFO L226 Difference]: Without dead ends: 74894 [2019-12-27 18:39:14,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 18 SyntacticMatches, 21 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25177 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=6820, Invalid=56432, Unknown=0, NotChecked=0, Total=63252 [2019-12-27 18:39:14,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74894 states. [2019-12-27 18:39:15,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74894 to 26594. [2019-12-27 18:39:15,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26594 states. [2019-12-27 18:39:15,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26594 states to 26594 states and 81283 transitions. [2019-12-27 18:39:15,308 INFO L78 Accepts]: Start accepts. Automaton has 26594 states and 81283 transitions. Word has length 55 [2019-12-27 18:39:15,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:39:15,308 INFO L462 AbstractCegarLoop]: Abstraction has 26594 states and 81283 transitions. [2019-12-27 18:39:15,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 18:39:15,308 INFO L276 IsEmpty]: Start isEmpty. Operand 26594 states and 81283 transitions. [2019-12-27 18:39:15,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 18:39:15,337 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:39:15,337 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] [2019-12-27 18:39:15,337 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:39:15,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:39:15,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1467868539, now seen corresponding path program 6 times [2019-12-27 18:39:15,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:39:15,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252991286] [2019-12-27 18:39:15,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:39:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:39:15,455 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:39:15,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252991286] [2019-12-27 18:39:15,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:39:15,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 18:39:15,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1425649480] [2019-12-27 18:39:15,456 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:39:15,471 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:39:15,750 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 259 transitions. [2019-12-27 18:39:15,750 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:39:15,882 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 18:39:15,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 18:39:15,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:39:15,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 18:39:15,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:39:15,883 INFO L87 Difference]: Start difference. First operand 26594 states and 81283 transitions. Second operand 12 states. [2019-12-27 18:39:17,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:39:17,592 INFO L93 Difference]: Finished difference Result 43751 states and 133135 transitions. [2019-12-27 18:39:17,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 18:39:17,593 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-27 18:39:17,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:39:17,642 INFO L225 Difference]: With dead ends: 43751 [2019-12-27 18:39:17,642 INFO L226 Difference]: Without dead ends: 32689 [2019-12-27 18:39:17,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2019-12-27 18:39:17,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32689 states. [2019-12-27 18:39:18,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32689 to 24424. [2019-12-27 18:39:18,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24424 states. [2019-12-27 18:39:18,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24424 states to 24424 states and 74376 transitions. [2019-12-27 18:39:18,061 INFO L78 Accepts]: Start accepts. Automaton has 24424 states and 74376 transitions. Word has length 55 [2019-12-27 18:39:18,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:39:18,062 INFO L462 AbstractCegarLoop]: Abstraction has 24424 states and 74376 transitions. [2019-12-27 18:39:18,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 18:39:18,062 INFO L276 IsEmpty]: Start isEmpty. Operand 24424 states and 74376 transitions. [2019-12-27 18:39:18,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 18:39:18,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:39:18,087 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] [2019-12-27 18:39:18,087 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:39:18,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:39:18,087 INFO L82 PathProgramCache]: Analyzing trace with hash -866822381, now seen corresponding path program 7 times [2019-12-27 18:39:18,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:39:18,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558007906] [2019-12-27 18:39:18,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:39:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:39:18,272 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:39:18,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558007906] [2019-12-27 18:39:18,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:39:18,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 18:39:18,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [343144581] [2019-12-27 18:39:18,273 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:39:18,286 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:39:18,417 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 213 states and 419 transitions. [2019-12-27 18:39:18,418 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:39:19,012 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 41 times. [2019-12-27 18:39:19,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 18:39:19,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:39:19,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 18:39:19,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-12-27 18:39:19,014 INFO L87 Difference]: Start difference. First operand 24424 states and 74376 transitions. Second operand 22 states. [2019-12-27 18:39:21,944 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2019-12-27 18:39:33,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:39:33,885 INFO L93 Difference]: Finished difference Result 73224 states and 219333 transitions. [2019-12-27 18:39:33,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2019-12-27 18:39:33,885 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 55 [2019-12-27 18:39:33,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:39:33,981 INFO L225 Difference]: With dead ends: 73224 [2019-12-27 18:39:33,981 INFO L226 Difference]: Without dead ends: 72108 [2019-12-27 18:39:33,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 16 SyntacticMatches, 16 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11979 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=3643, Invalid=26807, Unknown=0, NotChecked=0, Total=30450 [2019-12-27 18:39:34,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72108 states. [2019-12-27 18:39:34,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72108 to 24244. [2019-12-27 18:39:34,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24244 states. [2019-12-27 18:39:34,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24244 states to 24244 states and 73926 transitions. [2019-12-27 18:39:34,667 INFO L78 Accepts]: Start accepts. Automaton has 24244 states and 73926 transitions. Word has length 55 [2019-12-27 18:39:34,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:39:34,667 INFO L462 AbstractCegarLoop]: Abstraction has 24244 states and 73926 transitions. [2019-12-27 18:39:34,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 18:39:34,668 INFO L276 IsEmpty]: Start isEmpty. Operand 24244 states and 73926 transitions. [2019-12-27 18:39:34,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 18:39:34,695 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:39:34,695 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] [2019-12-27 18:39:34,695 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:39:34,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:39:34,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1678920401, now seen corresponding path program 8 times [2019-12-27 18:39:34,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:39:34,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267109784] [2019-12-27 18:39:34,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:39:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:39:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:39:34,809 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:39:34,809 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:39:34,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_531) (= v_~x$r_buff0_thd1~0_337 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff1~0_304) (= (select .cse0 |v_ULTIMATE.start_main_~#t2357~0.base_24|) 0) (= 0 v_~x$r_buff1_thd3~0_123) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2357~0.base_24|) (< 0 |v_#StackHeapBarrier_16|) (= v_~y~0_70 0) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t2357~0.base_24| 1)) (= v_~x$mem_tmp~0_42 0) (= v_~z~0_50 0) (= 0 v_~x$r_buff0_thd2~0_165) (= v_~x$r_buff1_thd1~0_232 0) (= 0 v_~x$r_buff0_thd3~0_134) (= 0 v_~x$read_delayed~0_6) (= |v_ULTIMATE.start_main_~#t2357~0.offset_18| 0) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_49) (= 0 v_~x$r_buff1_thd2~0_115) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2357~0.base_24| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2357~0.base_24|) |v_ULTIMATE.start_main_~#t2357~0.offset_18| 0)) |v_#memory_int_23|) (= v_~x$r_buff0_thd0~0_141 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~x~0_214) (= v_~__unbuffered_cnt~0_139 0) (= 0 v_~x$w_buff0~0_515) (= v_~weak$$choice2~0_149 0) (= v_~x$flush_delayed~0_77 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p0_EAX~0_48) (= v_~x$r_buff1_thd0~0_132 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2357~0.base_24| 4) |v_#length_23|) (= 0 v_~x$w_buff0_used~0_899) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_515, ~x$flush_delayed~0=v_~x$flush_delayed~0_77, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_232, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_~#t2357~0.base=|v_ULTIMATE.start_main_~#t2357~0.base_24|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ULTIMATE.start_main_~#t2358~0.offset=|v_ULTIMATE.start_main_~#t2358~0.offset_19|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_49, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ~x$w_buff1~0=v_~x$w_buff1~0_304, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_531, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_115, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ~x~0=v_~x~0_214, ULTIMATE.start_main_~#t2359~0.base=|v_ULTIMATE.start_main_~#t2359~0.base_26|, ULTIMATE.start_main_~#t2359~0.offset=|v_ULTIMATE.start_main_~#t2359~0.offset_19|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_337, ULTIMATE.start_main_~#t2358~0.base=|v_ULTIMATE.start_main_~#t2358~0.base_26|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_82|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_123, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_68|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_38|, ~y~0=v_~y~0_70, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_20|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_132, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_165, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_899, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_50, ULTIMATE.start_main_~#t2357~0.offset=|v_ULTIMATE.start_main_~#t2357~0.offset_18|, ~weak$$choice2~0=v_~weak$$choice2~0_149, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t2357~0.base, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t2358~0.offset, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2359~0.base, ULTIMATE.start_main_~#t2359~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t2358~0.base, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ULTIMATE.start_main_~#t2357~0.offset, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 18:39:34,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L820-1-->L822: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2358~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2358~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t2358~0.offset_11| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2358~0.base_13| 4) |v_#length_15|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2358~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2358~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2358~0.base_13|) |v_ULTIMATE.start_main_~#t2358~0.offset_11| 1)) |v_#memory_int_15|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2358~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2358~0.offset=|v_ULTIMATE.start_main_~#t2358~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2358~0.base=|v_ULTIMATE.start_main_~#t2358~0.base_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2358~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t2358~0.base, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 18:39:34,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L822-1-->L824: Formula: (and (= |v_ULTIMATE.start_main_~#t2359~0.offset_11| 0) (not (= |v_ULTIMATE.start_main_~#t2359~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2359~0.base_13|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2359~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2359~0.base_13|) |v_ULTIMATE.start_main_~#t2359~0.offset_11| 2))) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t2359~0.base_13| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2359~0.base_13| 4)) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t2359~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2359~0.offset=|v_ULTIMATE.start_main_~#t2359~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2359~0.base=|v_ULTIMATE.start_main_~#t2359~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2359~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2359~0.base] because there is no mapped edge [2019-12-27 18:39:34,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] P1ENTRY-->L5-3: Formula: (and (= ~x$w_buff1_used~0_Out-1586131559 ~x$w_buff0_used~0_In-1586131559) (= |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1586131559| P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1586131559) (= |P1Thread1of1ForFork0_#in~arg.base_In-1586131559| P1Thread1of1ForFork0_~arg.base_Out-1586131559) (= 1 ~x$w_buff0_used~0_Out-1586131559) (= 0 (mod ~x$w_buff1_used~0_Out-1586131559 256)) (= 1 |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1586131559|) (= 1 ~x$w_buff0~0_Out-1586131559) (= ~x$w_buff0~0_In-1586131559 ~x$w_buff1~0_Out-1586131559) (= P1Thread1of1ForFork0_~arg.offset_Out-1586131559 |P1Thread1of1ForFork0_#in~arg.offset_In-1586131559|)) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1586131559, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-1586131559|, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-1586131559|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1586131559} OutVars{~x$w_buff0~0=~x$w_buff0~0_Out-1586131559, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_Out-1586131559, P1Thread1of1ForFork0_~arg.offset=P1Thread1of1ForFork0_~arg.offset_Out-1586131559, P1Thread1of1ForFork0_~arg.base=P1Thread1of1ForFork0_~arg.base_Out-1586131559, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out-1586131559|, P1Thread1of1ForFork0_#in~arg.base=|P1Thread1of1ForFork0_#in~arg.base_In-1586131559|, ~x$w_buff1~0=~x$w_buff1~0_Out-1586131559, P1Thread1of1ForFork0_#in~arg.offset=|P1Thread1of1ForFork0_#in~arg.offset_In-1586131559|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1586131559, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1586131559} 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:39:34,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L797-2-->L797-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1799596875 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In1799596875 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In1799596875 |P2Thread1of1ForFork1_#t~ite32_Out1799596875|)) (and (= |P2Thread1of1ForFork1_#t~ite32_Out1799596875| ~x$w_buff1~0_In1799596875) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1799596875, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1799596875, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1799596875, ~x~0=~x~0_In1799596875} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out1799596875|, ~x$w_buff1~0=~x$w_buff1~0_In1799596875, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1799596875, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1799596875, ~x~0=~x~0_In1799596875} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 18:39:34,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L797-4-->L798: Formula: (= v_~x~0_64 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_29|, ~x~0=v_~x~0_64} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 18:39:34,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In-1796440958 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1796440958 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out-1796440958| ~x$w_buff0_used~0_In-1796440958)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out-1796440958| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1796440958, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1796440958} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1796440958|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1796440958, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1796440958} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 18:39:34,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1029877861 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1029877861 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1029877861| ~x$w_buff0_used~0_In-1029877861)) (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1029877861|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1029877861, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1029877861} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1029877861, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1029877861|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1029877861} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 18:39:34,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In128912439 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In128912439 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In128912439 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In128912439 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out128912439|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In128912439 |P1Thread1of1ForFork0_#t~ite29_Out128912439|) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In128912439, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In128912439, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In128912439, ~x$w_buff0_used~0=~x$w_buff0_used~0_In128912439} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In128912439, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In128912439, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In128912439, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out128912439|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In128912439} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 18:39:34,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L780-->L781: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-943464213 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-943464213 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-943464213 ~x$r_buff0_thd2~0_Out-943464213)) (and (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out-943464213) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-943464213, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-943464213} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-943464213|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-943464213, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-943464213} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 18:39:34,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L781-->L781-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-1218411183 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-1218411183 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1218411183 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1218411183 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-1218411183| ~x$r_buff1_thd2~0_In-1218411183) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork0_#t~ite31_Out-1218411183| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1218411183, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1218411183, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1218411183, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1218411183} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1218411183|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1218411183, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1218411183, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1218411183, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1218411183} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 18:39:34,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L781-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_55 |v_P1Thread1of1ForFork0_#t~ite31_38|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_37|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, 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:39:34,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In536062950 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite11_Out536062950| ~x$w_buff1~0_In536062950) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In536062950 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In536062950 256)) .cse0) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In536062950 256))) (= (mod ~x$w_buff0_used~0_In536062950 256) 0))) .cse1 (= |P0Thread1of1ForFork2_#t~ite12_Out536062950| |P0Thread1of1ForFork2_#t~ite11_Out536062950|)) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite12_Out536062950| ~x$w_buff1~0_In536062950) (= |P0Thread1of1ForFork2_#t~ite11_In536062950| |P0Thread1of1ForFork2_#t~ite11_Out536062950|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In536062950, ~x$w_buff1~0=~x$w_buff1~0_In536062950, ~x$w_buff1_used~0=~x$w_buff1_used~0_In536062950, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In536062950, ~weak$$choice2~0=~weak$$choice2~0_In536062950, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In536062950|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In536062950} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In536062950, ~x$w_buff1~0=~x$w_buff1~0_In536062950, ~x$w_buff1_used~0=~x$w_buff1_used~0_In536062950, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In536062950, ~weak$$choice2~0=~weak$$choice2~0_In536062950, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out536062950|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out536062950|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In536062950} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 18:39:34,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L744-->L744-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1916994191 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1916994191 256)))) (or (and (= (mod ~x$w_buff1_used~0_In1916994191 256) 0) .cse1) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1916994191 256))) (= (mod ~x$w_buff0_used~0_In1916994191 256) 0))) (= |P0Thread1of1ForFork2_#t~ite14_Out1916994191| |P0Thread1of1ForFork2_#t~ite15_Out1916994191|) (= ~x$w_buff0_used~0_In1916994191 |P0Thread1of1ForFork2_#t~ite14_Out1916994191|)) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite14_In1916994191| |P0Thread1of1ForFork2_#t~ite14_Out1916994191|) (= ~x$w_buff0_used~0_In1916994191 |P0Thread1of1ForFork2_#t~ite15_Out1916994191|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1916994191, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1916994191, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1916994191, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In1916994191|, ~weak$$choice2~0=~weak$$choice2~0_In1916994191, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1916994191} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1916994191, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1916994191, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out1916994191|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1916994191, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out1916994191|, ~weak$$choice2~0=~weak$$choice2~0_In1916994191, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1916994191} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 18:39:34,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L745-->L745-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1202113613 256) 0))) (or (and (not .cse0) (= ~x$w_buff1_used~0_In1202113613 |P0Thread1of1ForFork2_#t~ite18_Out1202113613|) (= |P0Thread1of1ForFork2_#t~ite17_In1202113613| |P0Thread1of1ForFork2_#t~ite17_Out1202113613|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1202113613 256)))) (or (= (mod ~x$w_buff0_used~0_In1202113613 256) 0) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In1202113613 256) 0)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In1202113613 256))))) .cse0 (= ~x$w_buff1_used~0_In1202113613 |P0Thread1of1ForFork2_#t~ite17_Out1202113613|) (= |P0Thread1of1ForFork2_#t~ite17_Out1202113613| |P0Thread1of1ForFork2_#t~ite18_Out1202113613|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1202113613, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1202113613|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1202113613, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1202113613, ~weak$$choice2~0=~weak$$choice2~0_In1202113613, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1202113613} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1202113613, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1202113613|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1202113613|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1202113613, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1202113613, ~weak$$choice2~0=~weak$$choice2~0_In1202113613, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1202113613} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 18:39:34,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L746-->L747-8: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite23_39| |v_P0Thread1of1ForFork2_#t~ite23_40|) (= v_~x$r_buff1_thd1~0_214 |v_P0Thread1of1ForFork2_#t~ite24_35|) (= v_~x$r_buff0_thd1~0_321 v_~x$r_buff0_thd1~0_320) (not (= 0 (mod v_~weak$$choice2~0_142 256))) (= |v_P0Thread1of1ForFork2_#t~ite22_36| |v_P0Thread1of1ForFork2_#t~ite22_35|)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_321, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_40|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_36|} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_31|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_320, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_27|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_214, P0Thread1of1ForFork2_#t~ite24=|v_P0Thread1of1ForFork2_#t~ite24_35|, ~weak$$choice2~0=v_~weak$$choice2~0_142, P0Thread1of1ForFork2_#t~ite23=|v_P0Thread1of1ForFork2_#t~ite23_39|, P0Thread1of1ForFork2_#t~ite22=|v_P0Thread1of1ForFork2_#t~ite22_35|, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_15|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 18:39:34,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L749-->L757: Formula: (and (= v_~x~0_54 v_~x$mem_tmp~0_11) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$mem_tmp~0=v_~x$mem_tmp~0_11} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~x~0=v_~x~0_54} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 18:39:34,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd3~0_In796315843 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In796315843 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In796315843 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In796315843 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out796315843| 0)) (and (or .cse2 .cse3) (= ~x$w_buff1_used~0_In796315843 |P2Thread1of1ForFork1_#t~ite35_Out796315843|) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In796315843, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In796315843, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In796315843, ~x$w_buff0_used~0=~x$w_buff0_used~0_In796315843} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out796315843|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In796315843, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In796315843, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In796315843, ~x$w_buff0_used~0=~x$w_buff0_used~0_In796315843} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 18:39:34,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1766596059 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1766596059 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out1766596059|)) (and (= ~x$r_buff0_thd3~0_In1766596059 |P2Thread1of1ForFork1_#t~ite36_Out1766596059|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1766596059, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1766596059} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1766596059|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1766596059, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1766596059} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 18:39:34,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L801-->L801-2: Formula: (let ((.cse2 (= (mod ~x$r_buff1_thd3~0_In-798979209 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-798979209 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-798979209 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-798979209 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out-798979209| ~x$r_buff1_thd3~0_In-798979209)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out-798979209| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-798979209, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-798979209, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-798979209, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-798979209} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-798979209|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-798979209, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-798979209, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-798979209, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-798979209} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 18:39:34,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L801-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_85 1) v_~__unbuffered_cnt~0_84) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_72 |v_P2Thread1of1ForFork1_#t~ite37_40|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_39|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, 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:39:34,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L824-1-->L830: Formula: (and (= 3 v_~__unbuffered_cnt~0_39) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 18:39:34,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L830-2-->L830-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1256434483 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1256434483 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out1256434483| ~x~0_In1256434483) (or .cse0 .cse1)) (and (not .cse1) (= ~x$w_buff1~0_In1256434483 |ULTIMATE.start_main_#t~ite41_Out1256434483|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1256434483, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1256434483, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1256434483, ~x~0=~x~0_In1256434483} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1256434483|, ~x$w_buff1~0=~x$w_buff1~0_In1256434483, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1256434483, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1256434483, ~x~0=~x~0_In1256434483} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 18:39:34,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L830-4-->L831: Formula: (= v_~x~0_17 |v_ULTIMATE.start_main_#t~ite41_10|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 18:39:34,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-111048506 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-111048506 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-111048506| ~x$w_buff0_used~0_In-111048506)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out-111048506|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-111048506, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-111048506} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-111048506, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-111048506|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-111048506} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 18:39:34,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In2114423360 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In2114423360 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In2114423360 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In2114423360 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out2114423360| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In2114423360 |ULTIMATE.start_main_#t~ite44_Out2114423360|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2114423360, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2114423360, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2114423360, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2114423360} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2114423360, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2114423360, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2114423360, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2114423360|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2114423360} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 18:39:34,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1266799656 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1266799656 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1266799656|)) (and (= ~x$r_buff0_thd0~0_In-1266799656 |ULTIMATE.start_main_#t~ite45_Out-1266799656|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1266799656, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1266799656} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1266799656, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1266799656|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1266799656} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 18:39:34,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L834-->L834-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In418412690 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In418412690 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In418412690 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In418412690 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out418412690| 0)) (and (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In418412690 |ULTIMATE.start_main_#t~ite46_Out418412690|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In418412690, ~x$w_buff1_used~0=~x$w_buff1_used~0_In418412690, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In418412690, ~x$w_buff0_used~0=~x$w_buff0_used~0_In418412690} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In418412690, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out418412690|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In418412690, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In418412690, ~x$w_buff0_used~0=~x$w_buff0_used~0_In418412690} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 18:39:34,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_20) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_16 256)) (= v_~main$tmp_guard1~0_16 0) (= 0 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_20 0) (= v_~x$r_buff1_thd0~0_80 |v_ULTIMATE.start_main_#t~ite46_35|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_80, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} 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:39:34,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:39:34 BasicIcfg [2019-12-27 18:39:34,922 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:39:34,926 INFO L168 Benchmark]: Toolchain (without parser) took 184998.83 ms. Allocated memory was 140.5 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 102.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 18:39:34,927 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 140.5 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 18:39:34,927 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.82 ms. Allocated memory was 140.5 MB in the beginning and 205.0 MB in the end (delta: 64.5 MB). Free memory was 102.6 MB in the beginning and 159.2 MB in the end (delta: -56.6 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-12-27 18:39:34,928 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.48 ms. Allocated memory is still 205.0 MB. Free memory was 158.6 MB in the beginning and 156.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:39:34,928 INFO L168 Benchmark]: Boogie Preprocessor took 39.27 ms. Allocated memory is still 205.0 MB. Free memory was 156.0 MB in the beginning and 154.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 18:39:34,928 INFO L168 Benchmark]: RCFGBuilder took 733.64 ms. Allocated memory is still 205.0 MB. Free memory was 154.1 MB in the beginning and 107.4 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:39:34,929 INFO L168 Benchmark]: TraceAbstraction took 183377.69 ms. Allocated memory was 205.0 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 106.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 18:39:34,937 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 140.5 MB. Free memory was 122.4 MB in the beginning and 122.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 767.82 ms. Allocated memory was 140.5 MB in the beginning and 205.0 MB in the end (delta: 64.5 MB). Free memory was 102.6 MB in the beginning and 159.2 MB in the end (delta: -56.6 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.48 ms. Allocated memory is still 205.0 MB. Free memory was 158.6 MB in the beginning and 156.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.27 ms. Allocated memory is still 205.0 MB. Free memory was 156.0 MB in the beginning and 154.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 733.64 ms. Allocated memory is still 205.0 MB. Free memory was 154.1 MB in the beginning and 107.4 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 183377.69 ms. Allocated memory was 205.0 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 106.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 164 ProgramPointsBefore, 83 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 29 ChoiceCompositions, 6837 VarBasedMoverChecksPositive, 237 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 262 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 66430 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2357, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L822] FCALL, FORK 0 pthread_create(&t2358, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L767] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L768] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L769] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L770] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L771] 2 x$r_buff0_thd2 = (_Bool)1 [L774] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L777] 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, __unbuffered_p2_EBX=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] [L824] FCALL, FORK 0 pthread_create(&t2359, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L791] 3 __unbuffered_p2_EAX = y [L794] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L797] 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, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L732] 1 z = 1 [L737] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L738] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L739] 1 x$flush_delayed = weak$$choice2 [L740] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=1] [L741] 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, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=1] [L777] 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) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 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 [L741] 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) [L742] EXPR 1 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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))=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=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=1] [L742] 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)) [L743] 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)) [L744] 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)) [L745] 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)) [L747] 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)) [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, 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=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=1] [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] 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 [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, 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=1] [L831] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] 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 [L833] 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, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 183.0s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 124.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6673 SDtfs, 16030 SDslu, 44412 SDs, 0 SdLazy, 61436 SolverSat, 1428 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 58.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1431 GetRequests, 211 SyntacticMatches, 148 SemanticMatches, 1072 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55821 ImplicationChecksByTransitivity, 43.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115962occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 26.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 381772 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1102 NumberOfCodeBlocks, 1102 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1023 ConstructedInterpolants, 0 QuantifiedInterpolants, 268175 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...