/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/rfi001_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:40:48,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:40:48,704 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:40:48,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:40:48,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:40:48,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:40:48,718 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:40:48,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:40:48,722 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:40:48,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:40:48,723 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:40:48,725 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:40:48,725 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:40:48,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:40:48,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:40:48,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:40:48,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:40:48,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:40:48,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:40:48,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:40:48,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:40:48,736 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:40:48,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:40:48,738 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:40:48,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:40:48,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:40:48,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:40:48,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:40:48,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:40:48,743 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:40:48,743 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:40:48,744 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:40:48,745 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:40:48,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:40:48,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:40:48,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:40:48,747 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:40:48,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:40:48,748 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:40:48,748 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:40:48,749 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:40:48,750 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 17:40:48,764 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:40:48,764 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:40:48,766 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:40:48,766 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:40:48,766 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:40:48,766 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:40:48,766 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:40:48,767 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:40:48,767 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:40:48,767 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:40:48,767 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:40:48,767 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:40:48,767 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:40:48,768 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:40:48,768 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:40:48,768 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:40:48,768 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:40:48,768 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:40:48,769 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:40:48,769 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:40:48,769 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:40:48,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:40:48,769 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:40:48,769 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:40:48,770 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:40:48,770 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:40:48,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:40:48,770 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:40:48,770 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:40:48,771 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:40:48,771 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:40:49,073 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:40:49,097 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:40:49,101 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:40:49,102 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:40:49,103 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:40:49,105 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_pso.opt.i [2019-12-27 17:40:49,180 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9b4aedca/2a9c14dad1cd451fa87a7a226253eb08/FLAGde04f3f6e [2019-12-27 17:40:49,743 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:40:49,746 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_pso.opt.i [2019-12-27 17:40:49,761 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9b4aedca/2a9c14dad1cd451fa87a7a226253eb08/FLAGde04f3f6e [2019-12-27 17:40:50,032 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9b4aedca/2a9c14dad1cd451fa87a7a226253eb08 [2019-12-27 17:40:50,043 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:40:50,045 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:40:50,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:40:50,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:40:50,053 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:40:50,053 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:40:50" (1/1) ... [2019-12-27 17:40:50,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a6e624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:50, skipping insertion in model container [2019-12-27 17:40:50,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:40:50" (1/1) ... [2019-12-27 17:40:50,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:40:50,133 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:40:50,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:40:50,711 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:40:50,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:40:50,852 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:40:50,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:50 WrapperNode [2019-12-27 17:40:50,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:40:50,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:40:50,854 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:40:50,854 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:40:50,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:50" (1/1) ... [2019-12-27 17:40:50,883 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:50" (1/1) ... [2019-12-27 17:40:50,923 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:40:50,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:40:50,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:40:50,924 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:40:50,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:50" (1/1) ... [2019-12-27 17:40:50,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:50" (1/1) ... [2019-12-27 17:40:50,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:50" (1/1) ... [2019-12-27 17:40:50,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:50" (1/1) ... [2019-12-27 17:40:50,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:50" (1/1) ... [2019-12-27 17:40:50,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:50" (1/1) ... [2019-12-27 17:40:50,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:50" (1/1) ... [2019-12-27 17:40:50,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:40:50,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:40:50,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:40:50,983 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:40:50,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:50" (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 17:40:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:40:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:40:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:40:51,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:40:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:40:51,057 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:40:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:40:51,057 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:40:51,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:40:51,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:40:51,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:40:51,060 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 17:40:51,734 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:40:51,734 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:40:51,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:40:51 BoogieIcfgContainer [2019-12-27 17:40:51,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:40:51,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:40:51,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:40:51,741 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:40:51,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:40:50" (1/3) ... [2019-12-27 17:40:51,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350b7180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:40:51, skipping insertion in model container [2019-12-27 17:40:51,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:50" (2/3) ... [2019-12-27 17:40:51,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@350b7180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:40:51, skipping insertion in model container [2019-12-27 17:40:51,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:40:51" (3/3) ... [2019-12-27 17:40:51,745 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_pso.opt.i [2019-12-27 17:40:51,756 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:40:51,756 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:40:51,764 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:40:51,765 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:40:51,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,801 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,801 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,810 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,810 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,810 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,811 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,811 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,824 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,825 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,830 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,830 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,831 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:51,848 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:40:51,869 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:40:51,870 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:40:51,870 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:40:51,870 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:40:51,870 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:40:51,871 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:40:51,871 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:40:51,871 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:40:51,888 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 17:40:51,891 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 17:40:52,027 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 17:40:52,027 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:40:52,042 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:40:52,060 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 17:40:52,136 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 17:40:52,137 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:40:52,147 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 256 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:40:52,163 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 17:40:52,165 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:40:56,401 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 17:40:56,546 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 17:40:56,574 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46553 [2019-12-27 17:40:56,574 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-27 17:40:56,578 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-27 17:40:57,039 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8413 states. [2019-12-27 17:40:57,041 INFO L276 IsEmpty]: Start isEmpty. Operand 8413 states. [2019-12-27 17:40:57,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 17:40:57,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:57,049 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 17:40:57,049 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:57,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:57,055 INFO L82 PathProgramCache]: Analyzing trace with hash 698534967, now seen corresponding path program 1 times [2019-12-27 17:40:57,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:57,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214325100] [2019-12-27 17:40:57,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:57,282 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 17:40:57,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214325100] [2019-12-27 17:40:57,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:57,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:40:57,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1445667357] [2019-12-27 17:40:57,287 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:57,293 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:57,307 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 17:40:57,307 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:57,311 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:40:57,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:40:57,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:57,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:40:57,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:40:57,329 INFO L87 Difference]: Start difference. First operand 8413 states. Second operand 3 states. [2019-12-27 17:40:57,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:57,612 INFO L93 Difference]: Finished difference Result 8365 states and 27377 transitions. [2019-12-27 17:40:57,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:40:57,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 17:40:57,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:57,715 INFO L225 Difference]: With dead ends: 8365 [2019-12-27 17:40:57,715 INFO L226 Difference]: Without dead ends: 8196 [2019-12-27 17:40:57,716 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 17:40:57,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8196 states. [2019-12-27 17:40:58,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8196 to 8196. [2019-12-27 17:40:58,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8196 states. [2019-12-27 17:40:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8196 states to 8196 states and 26857 transitions. [2019-12-27 17:40:58,204 INFO L78 Accepts]: Start accepts. Automaton has 8196 states and 26857 transitions. Word has length 5 [2019-12-27 17:40:58,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:58,204 INFO L462 AbstractCegarLoop]: Abstraction has 8196 states and 26857 transitions. [2019-12-27 17:40:58,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:40:58,205 INFO L276 IsEmpty]: Start isEmpty. Operand 8196 states and 26857 transitions. [2019-12-27 17:40:58,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:40:58,210 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:58,210 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:40:58,210 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:40:58,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:58,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1108629868, now seen corresponding path program 1 times [2019-12-27 17:40:58,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:58,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879736470] [2019-12-27 17:40:58,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:58,371 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 17:40:58,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879736470] [2019-12-27 17:40:58,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:58,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:40:58,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1014848186] [2019-12-27 17:40:58,374 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:58,375 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:58,382 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 17:40:58,382 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:58,431 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:40:58,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:40:58,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:58,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:40:58,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:40:58,434 INFO L87 Difference]: Start difference. First operand 8196 states and 26857 transitions. Second operand 5 states. [2019-12-27 17:40:58,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:58,955 INFO L93 Difference]: Finished difference Result 13084 states and 41046 transitions. [2019-12-27 17:40:58,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:40:58,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 17:40:58,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:59,045 INFO L225 Difference]: With dead ends: 13084 [2019-12-27 17:40:59,046 INFO L226 Difference]: Without dead ends: 13077 [2019-12-27 17:40:59,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:40:59,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13077 states. [2019-12-27 17:40:59,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13077 to 11568. [2019-12-27 17:40:59,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11568 states. [2019-12-27 17:41:00,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11568 states to 11568 states and 36838 transitions. [2019-12-27 17:41:00,031 INFO L78 Accepts]: Start accepts. Automaton has 11568 states and 36838 transitions. Word has length 11 [2019-12-27 17:41:00,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:41:00,031 INFO L462 AbstractCegarLoop]: Abstraction has 11568 states and 36838 transitions. [2019-12-27 17:41:00,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:41:00,031 INFO L276 IsEmpty]: Start isEmpty. Operand 11568 states and 36838 transitions. [2019-12-27 17:41:00,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:41:00,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:00,039 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:41:00,039 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:00,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:00,040 INFO L82 PathProgramCache]: Analyzing trace with hash 531606898, now seen corresponding path program 1 times [2019-12-27 17:41:00,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:00,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706962648] [2019-12-27 17:41:00,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:41:00,152 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 17:41:00,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706962648] [2019-12-27 17:41:00,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:41:00,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:41:00,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2080532500] [2019-12-27 17:41:00,153 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:41:00,155 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:00,156 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:41:00,157 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:00,157 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:41:00,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:41:00,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:00,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:41:00,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:41:00,158 INFO L87 Difference]: Start difference. First operand 11568 states and 36838 transitions. Second operand 4 states. [2019-12-27 17:41:00,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:41:00,207 INFO L93 Difference]: Finished difference Result 1922 states and 4461 transitions. [2019-12-27 17:41:00,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:41:00,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:41:00,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:41:00,213 INFO L225 Difference]: With dead ends: 1922 [2019-12-27 17:41:00,213 INFO L226 Difference]: Without dead ends: 1636 [2019-12-27 17:41:00,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:41:00,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1636 states. [2019-12-27 17:41:00,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1636 to 1636. [2019-12-27 17:41:00,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2019-12-27 17:41:00,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 3670 transitions. [2019-12-27 17:41:00,250 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 3670 transitions. Word has length 11 [2019-12-27 17:41:00,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:41:00,250 INFO L462 AbstractCegarLoop]: Abstraction has 1636 states and 3670 transitions. [2019-12-27 17:41:00,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:41:00,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 3670 transitions. [2019-12-27 17:41:00,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 17:41:00,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:00,252 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] [2019-12-27 17:41:00,253 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:00,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:00,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1653802499, now seen corresponding path program 1 times [2019-12-27 17:41:00,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:00,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613431099] [2019-12-27 17:41:00,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:41:00,418 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 17:41:00,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613431099] [2019-12-27 17:41:00,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:41:00,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:41:00,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [868873140] [2019-12-27 17:41:00,423 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:41:00,430 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:00,439 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 71 transitions. [2019-12-27 17:41:00,440 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:00,459 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:41:00,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:41:00,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:00,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:41:00,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:41:00,460 INFO L87 Difference]: Start difference. First operand 1636 states and 3670 transitions. Second operand 6 states. [2019-12-27 17:41:00,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:41:00,794 INFO L93 Difference]: Finished difference Result 2106 states and 4631 transitions. [2019-12-27 17:41:00,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:41:00,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-12-27 17:41:00,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:41:00,801 INFO L225 Difference]: With dead ends: 2106 [2019-12-27 17:41:00,802 INFO L226 Difference]: Without dead ends: 2106 [2019-12-27 17:41:00,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:41:00,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2019-12-27 17:41:00,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 1870. [2019-12-27 17:41:00,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1870 states. [2019-12-27 17:41:00,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 4159 transitions. [2019-12-27 17:41:00,844 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 4159 transitions. Word has length 23 [2019-12-27 17:41:00,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:41:00,844 INFO L462 AbstractCegarLoop]: Abstraction has 1870 states and 4159 transitions. [2019-12-27 17:41:00,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:41:00,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 4159 transitions. [2019-12-27 17:41:00,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 17:41:00,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:00,849 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:41:00,849 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:00,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:00,850 INFO L82 PathProgramCache]: Analyzing trace with hash -835970492, now seen corresponding path program 1 times [2019-12-27 17:41:00,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:00,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300526317] [2019-12-27 17:41:00,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:41:00,903 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 17:41:00,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300526317] [2019-12-27 17:41:00,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:41:00,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:41:00,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [284722686] [2019-12-27 17:41:00,905 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:41:00,918 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:01,042 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 85 transitions. [2019-12-27 17:41:01,043 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:01,044 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:41:01,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:41:01,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:01,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:41:01,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:41:01,045 INFO L87 Difference]: Start difference. First operand 1870 states and 4159 transitions. Second operand 3 states. [2019-12-27 17:41:01,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:41:01,099 INFO L93 Difference]: Finished difference Result 2204 states and 4939 transitions. [2019-12-27 17:41:01,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:41:01,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-27 17:41:01,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:41:01,106 INFO L225 Difference]: With dead ends: 2204 [2019-12-27 17:41:01,106 INFO L226 Difference]: Without dead ends: 2204 [2019-12-27 17:41:01,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:41:01,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2019-12-27 17:41:01,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 2094. [2019-12-27 17:41:01,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2019-12-27 17:41:01,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 4716 transitions. [2019-12-27 17:41:01,148 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 4716 transitions. Word has length 37 [2019-12-27 17:41:01,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:41:01,149 INFO L462 AbstractCegarLoop]: Abstraction has 2094 states and 4716 transitions. [2019-12-27 17:41:01,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:41:01,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 4716 transitions. [2019-12-27 17:41:01,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 17:41:01,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:01,154 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:41:01,154 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:01,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:01,154 INFO L82 PathProgramCache]: Analyzing trace with hash -673430796, now seen corresponding path program 1 times [2019-12-27 17:41:01,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:01,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747320555] [2019-12-27 17:41:01,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:41:01,285 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 17:41:01,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747320555] [2019-12-27 17:41:01,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:41:01,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:41:01,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [109647879] [2019-12-27 17:41:01,286 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:41:01,296 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:01,315 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 85 transitions. [2019-12-27 17:41:01,315 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:01,335 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:41:01,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:41:01,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:01,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:41:01,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:41:01,336 INFO L87 Difference]: Start difference. First operand 2094 states and 4716 transitions. Second operand 6 states. [2019-12-27 17:41:01,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:41:01,387 INFO L93 Difference]: Finished difference Result 429 states and 783 transitions. [2019-12-27 17:41:01,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:41:01,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-27 17:41:01,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:41:01,389 INFO L225 Difference]: With dead ends: 429 [2019-12-27 17:41:01,389 INFO L226 Difference]: Without dead ends: 383 [2019-12-27 17:41:01,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:41:01,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-12-27 17:41:01,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 348. [2019-12-27 17:41:01,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-12-27 17:41:01,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 628 transitions. [2019-12-27 17:41:01,397 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 628 transitions. Word has length 37 [2019-12-27 17:41:01,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:41:01,397 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 628 transitions. [2019-12-27 17:41:01,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:41:01,398 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 628 transitions. [2019-12-27 17:41:01,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:41:01,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:01,400 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:41:01,400 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:01,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:01,400 INFO L82 PathProgramCache]: Analyzing trace with hash 939573543, now seen corresponding path program 1 times [2019-12-27 17:41:01,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:01,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297003244] [2019-12-27 17:41:01,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:41:01,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:41:01,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297003244] [2019-12-27 17:41:01,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:41:01,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:41:01,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [873739184] [2019-12-27 17:41:01,462 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:41:01,476 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:01,507 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 112 transitions. [2019-12-27 17:41:01,507 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:01,507 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:41:01,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:41:01,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:01,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:41:01,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:41:01,509 INFO L87 Difference]: Start difference. First operand 348 states and 628 transitions. Second operand 3 states. [2019-12-27 17:41:01,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:41:01,557 INFO L93 Difference]: Finished difference Result 352 states and 622 transitions. [2019-12-27 17:41:01,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:41:01,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 17:41:01,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:41:01,559 INFO L225 Difference]: With dead ends: 352 [2019-12-27 17:41:01,559 INFO L226 Difference]: Without dead ends: 352 [2019-12-27 17:41:01,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:41:01,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-12-27 17:41:01,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 344. [2019-12-27 17:41:01,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-27 17:41:01,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 614 transitions. [2019-12-27 17:41:01,566 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 614 transitions. Word has length 52 [2019-12-27 17:41:01,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:41:01,567 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 614 transitions. [2019-12-27 17:41:01,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:41:01,567 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 614 transitions. [2019-12-27 17:41:01,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:41:01,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:01,569 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:41:01,569 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:01,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:01,569 INFO L82 PathProgramCache]: Analyzing trace with hash 933754688, now seen corresponding path program 1 times [2019-12-27 17:41:01,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:01,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890847386] [2019-12-27 17:41:01,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:41:01,628 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 17:41:01,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890847386] [2019-12-27 17:41:01,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:41:01,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:41:01,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1189200150] [2019-12-27 17:41:01,630 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:41:01,643 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:01,678 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 112 transitions. [2019-12-27 17:41:01,679 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:01,679 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:41:01,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:41:01,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:01,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:41:01,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:41:01,680 INFO L87 Difference]: Start difference. First operand 344 states and 614 transitions. Second operand 3 states. [2019-12-27 17:41:01,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:41:01,693 INFO L93 Difference]: Finished difference Result 344 states and 601 transitions. [2019-12-27 17:41:01,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:41:01,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 17:41:01,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:41:01,695 INFO L225 Difference]: With dead ends: 344 [2019-12-27 17:41:01,695 INFO L226 Difference]: Without dead ends: 344 [2019-12-27 17:41:01,695 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 17:41:01,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-12-27 17:41:01,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2019-12-27 17:41:01,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-12-27 17:41:01,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 601 transitions. [2019-12-27 17:41:01,702 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 601 transitions. Word has length 52 [2019-12-27 17:41:01,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:41:01,703 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 601 transitions. [2019-12-27 17:41:01,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:41:01,703 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 601 transitions. [2019-12-27 17:41:01,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 17:41:01,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:01,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, 1, 1, 1, 1, 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 17:41:01,705 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:01,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:01,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1595558797, now seen corresponding path program 1 times [2019-12-27 17:41:01,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:01,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355430569] [2019-12-27 17:41:01,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:41:01,910 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 17:41:01,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355430569] [2019-12-27 17:41:01,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:41:01,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:41:01,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1305196543] [2019-12-27 17:41:01,915 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:41:01,934 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:02,035 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 119 transitions. [2019-12-27 17:41:02,035 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:02,117 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 17:41:02,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:41:02,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:02,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:41:02,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:41:02,118 INFO L87 Difference]: Start difference. First operand 344 states and 601 transitions. Second operand 10 states. [2019-12-27 17:41:02,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:41:02,799 INFO L93 Difference]: Finished difference Result 598 states and 1028 transitions. [2019-12-27 17:41:02,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 17:41:02,800 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-12-27 17:41:02,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:41:02,802 INFO L225 Difference]: With dead ends: 598 [2019-12-27 17:41:02,802 INFO L226 Difference]: Without dead ends: 598 [2019-12-27 17:41:02,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-12-27 17:41:02,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-12-27 17:41:02,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 429. [2019-12-27 17:41:02,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-12-27 17:41:02,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 750 transitions. [2019-12-27 17:41:02,813 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 750 transitions. Word has length 53 [2019-12-27 17:41:02,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:41:02,814 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 750 transitions. [2019-12-27 17:41:02,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:41:02,814 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 750 transitions. [2019-12-27 17:41:02,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 17:41:02,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:02,816 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 17:41:02,816 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:02,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:02,816 INFO L82 PathProgramCache]: Analyzing trace with hash 165214383, now seen corresponding path program 2 times [2019-12-27 17:41:02,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:02,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375926513] [2019-12-27 17:41:02,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:41:02,888 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 17:41:02,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375926513] [2019-12-27 17:41:02,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:41:02,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:41:02,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1157190642] [2019-12-27 17:41:02,890 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:41:02,905 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:02,942 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 79 states and 102 transitions. [2019-12-27 17:41:02,942 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:02,943 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:41:02,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:41:02,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:02,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:41:02,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:41:02,944 INFO L87 Difference]: Start difference. First operand 429 states and 750 transitions. Second operand 3 states. [2019-12-27 17:41:02,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:41:02,996 INFO L93 Difference]: Finished difference Result 428 states and 748 transitions. [2019-12-27 17:41:02,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:41:02,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 17:41:02,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:41:02,998 INFO L225 Difference]: With dead ends: 428 [2019-12-27 17:41:02,999 INFO L226 Difference]: Without dead ends: 428 [2019-12-27 17:41:03,000 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 17:41:03,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-12-27 17:41:03,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 343. [2019-12-27 17:41:03,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2019-12-27 17:41:03,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 590 transitions. [2019-12-27 17:41:03,007 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 590 transitions. Word has length 53 [2019-12-27 17:41:03,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:41:03,008 INFO L462 AbstractCegarLoop]: Abstraction has 343 states and 590 transitions. [2019-12-27 17:41:03,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:41:03,008 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 590 transitions. [2019-12-27 17:41:03,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 17:41:03,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:03,011 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 17:41:03,012 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:03,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:03,012 INFO L82 PathProgramCache]: Analyzing trace with hash -798816837, now seen corresponding path program 1 times [2019-12-27 17:41:03,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:03,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465171686] [2019-12-27 17:41:03,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:41:03,585 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 17:41:03,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465171686] [2019-12-27 17:41:03,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:41:03,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-27 17:41:03,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [280825341] [2019-12-27 17:41:03,586 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:41:03,655 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:03,694 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 119 transitions. [2019-12-27 17:41:03,694 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:03,887 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 17:41:03,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 17:41:03,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:03,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 17:41:03,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2019-12-27 17:41:03,888 INFO L87 Difference]: Start difference. First operand 343 states and 590 transitions. Second operand 20 states. [2019-12-27 17:41:05,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:41:05,736 INFO L93 Difference]: Finished difference Result 805 states and 1381 transitions. [2019-12-27 17:41:05,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 17:41:05,738 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2019-12-27 17:41:05,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:41:05,739 INFO L225 Difference]: With dead ends: 805 [2019-12-27 17:41:05,740 INFO L226 Difference]: Without dead ends: 604 [2019-12-27 17:41:05,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=312, Invalid=1248, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 17:41:05,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-12-27 17:41:05,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 333. [2019-12-27 17:41:05,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-12-27 17:41:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 567 transitions. [2019-12-27 17:41:05,751 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 567 transitions. Word has length 54 [2019-12-27 17:41:05,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:41:05,751 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 567 transitions. [2019-12-27 17:41:05,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 17:41:05,751 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 567 transitions. [2019-12-27 17:41:05,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 17:41:05,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:05,753 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 17:41:05,753 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:05,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:05,753 INFO L82 PathProgramCache]: Analyzing trace with hash 2105146585, now seen corresponding path program 2 times [2019-12-27 17:41:05,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:05,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936428176] [2019-12-27 17:41:05,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:41:05,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 17:41:05,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936428176] [2019-12-27 17:41:05,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:41:05,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:41:05,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [745787202] [2019-12-27 17:41:05,938 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:41:05,976 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:41:06,096 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 80 states and 101 transitions. [2019-12-27 17:41:06,096 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:41:06,125 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:41:06,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:41:06,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:41:06,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:41:06,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:41:06,127 INFO L87 Difference]: Start difference. First operand 333 states and 567 transitions. Second operand 8 states. [2019-12-27 17:41:06,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:41:06,263 INFO L93 Difference]: Finished difference Result 536 states and 916 transitions. [2019-12-27 17:41:06,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 17:41:06,264 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 17:41:06,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:41:06,265 INFO L225 Difference]: With dead ends: 536 [2019-12-27 17:41:06,265 INFO L226 Difference]: Without dead ends: 220 [2019-12-27 17:41:06,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:41:06,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-12-27 17:41:06,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 196. [2019-12-27 17:41:06,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-12-27 17:41:06,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 330 transitions. [2019-12-27 17:41:06,270 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 330 transitions. Word has length 54 [2019-12-27 17:41:06,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:41:06,270 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 330 transitions. [2019-12-27 17:41:06,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:41:06,271 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 330 transitions. [2019-12-27 17:41:06,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 17:41:06,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:41:06,272 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 17:41:06,272 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:41:06,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:41:06,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1731930561, now seen corresponding path program 3 times [2019-12-27 17:41:06,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:41:06,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131087634] [2019-12-27 17:41:06,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:41:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:41:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:41:06,390 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:41:06,390 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:41:06,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] ULTIMATE.startENTRY-->L789: Formula: (let ((.cse0 (store |v_#valid_42| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~z~0_122 0) (= v_~y$mem_tmp~0_21 0) (= v_~y$r_buff1_thd1~0_178 0) (= 0 v_~__unbuffered_p1_EBX~0_131) (= v_~weak$$choice2~0_120 0) (= v_~__unbuffered_p1_EAX~0_131 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1607~0.base_19| 4) |v_#length_15|) (= v_~y$r_buff0_thd0~0_347 0) (= 0 v_~y$r_buff1_thd2~0_171) (= v_~x~0_94 0) (= 0 v_~weak$$choice0~0_15) (= (store .cse0 |v_ULTIMATE.start_main_~#t1607~0.base_19| 1) |v_#valid_40|) (= v_~y$read_delayed~0_6 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1607~0.base_19|) (= 0 v_~y$r_buff0_thd2~0_225) (= v_~main$tmp_guard0~0_28 0) (= 0 v_~__unbuffered_cnt~0_63) (= v_~y$r_buff0_thd1~0_109 0) (= v_~y$w_buff0_used~0_663 0) (= v_~y$w_buff1~0_180 0) (= 0 v_~y$flush_delayed~0_36) (= |v_#NULL.offset_5| 0) (= |v_ULTIMATE.start_main_~#t1607~0.offset_14| 0) (= v_~y~0_158 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1607~0.base_19|) 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$r_buff1_thd0~0_274 0) (= 0 v_~y$w_buff0~0_245) (= v_~main$tmp_guard1~0_25 0) (= v_~y$w_buff1_used~0_350 0) (= 0 |v_#NULL.base_5|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1607~0.base_19| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1607~0.base_19|) |v_ULTIMATE.start_main_~#t1607~0.offset_14| 0)) |v_#memory_int_15|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_44|, ULTIMATE.start_main_~#t1608~0.offset=|v_ULTIMATE.start_main_~#t1608~0.offset_13|, ULTIMATE.start_main_~#t1608~0.base=|v_ULTIMATE.start_main_~#t1608~0.base_16|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_25|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_33|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_47|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_131, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_109, ~y$flush_delayed~0=v_~y$flush_delayed~0_36, #length=|v_#length_15|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_30|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_27|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_23|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_23|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_28|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_46|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_27|, ULTIMATE.start_main_~#t1607~0.offset=|v_ULTIMATE.start_main_~#t1607~0.offset_14|, ~y$w_buff1~0=v_~y$w_buff1~0_180, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_225, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_274, ~x~0=v_~x~0_94, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_663, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_25|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_25|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_44|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_25|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_45|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_178, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_42|, ~y$w_buff0~0=v_~y$w_buff0~0_245, ~y~0=v_~y~0_158, ULTIMATE.start_main_~#t1607~0.base=|v_ULTIMATE.start_main_~#t1607~0.base_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_131, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_31|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_33|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_30|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_29|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_34|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_171, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_347, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_16|, ~z~0=v_~z~0_122, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1608~0.offset, ULTIMATE.start_main_~#t1608~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1607~0.offset, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t1607~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:41:06,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L789-1-->L791: Formula: (and (= |v_ULTIMATE.start_main_~#t1608~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1608~0.base_11|)) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1608~0.base_11| 1) |v_#valid_23|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1608~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1608~0.base_11|) |v_ULTIMATE.start_main_~#t1608~0.offset_10| 1)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1608~0.base_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1608~0.base_11| 4)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1608~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1608~0.offset=|v_ULTIMATE.start_main_~#t1608~0.offset_10|, ULTIMATE.start_main_~#t1608~0.base=|v_ULTIMATE.start_main_~#t1608~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1608~0.offset, ULTIMATE.start_main_~#t1608~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 17:41:06,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] P1ENTRY-->L4-3: Formula: (and (= 0 (mod v_~y$w_buff1_used~0_47 256)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_7) (= v_P1Thread1of1ForFork1_~arg.base_7 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7| 1) (= 1 v_~y$w_buff0_used~0_86) (= 2 v_~y$w_buff0~0_19) (= v_~y$w_buff0~0_20 v_~y$w_buff1~0_21) (= v_~y$w_buff1_used~0_47 v_~y$w_buff0_used~0_87)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_87, ~y$w_buff0~0=v_~y$w_buff0~0_20, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_9, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_86, ~y$w_buff1~0=v_~y$w_buff1~0_21, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_7|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_7, ~y$w_buff0~0=v_~y$w_buff0~0_19, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_47} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:41:06,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L732-2-->L732-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out-465279958| |P0Thread1of1ForFork0_#t~ite3_Out-465279958|)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-465279958 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-465279958 256)))) (or (and .cse0 (= ~y$w_buff1~0_In-465279958 |P0Thread1of1ForFork0_#t~ite3_Out-465279958|) (not .cse1) (not .cse2)) (and .cse0 (= ~y~0_In-465279958 |P0Thread1of1ForFork0_#t~ite3_Out-465279958|) (or .cse1 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-465279958, ~y$w_buff1~0=~y$w_buff1~0_In-465279958, ~y~0=~y~0_In-465279958, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-465279958} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-465279958, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-465279958|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-465279958|, ~y$w_buff1~0=~y$w_buff1~0_In-465279958, ~y~0=~y~0_In-465279958, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-465279958} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 17:41:06,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L733-->L733-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1917086711 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1917086711 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1917086711| ~y$w_buff0_used~0_In1917086711)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1917086711|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1917086711, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1917086711} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1917086711|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1917086711, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1917086711} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 17:41:06,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L734-->L734-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-1003687792 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1003687792 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-1003687792 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-1003687792 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1003687792 |P0Thread1of1ForFork0_#t~ite6_Out-1003687792|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1003687792|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1003687792, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1003687792, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1003687792, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1003687792} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1003687792|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1003687792, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1003687792, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1003687792, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1003687792} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 17:41:06,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L735-->L735-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1214280787 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1214280787 256)))) (or (and (= ~y$r_buff0_thd1~0_In1214280787 |P0Thread1of1ForFork0_#t~ite7_Out1214280787|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out1214280787|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1214280787, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1214280787} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1214280787, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1214280787|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1214280787} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 17:41:06,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L736-->L736-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In291041392 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In291041392 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In291041392 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In291041392 256) 0))) (or (and (= ~y$r_buff1_thd1~0_In291041392 |P0Thread1of1ForFork0_#t~ite8_Out291041392|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out291041392| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In291041392, ~y$w_buff0_used~0=~y$w_buff0_used~0_In291041392, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In291041392, ~y$w_buff1_used~0=~y$w_buff1_used~0_In291041392} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In291041392, ~y$w_buff0_used~0=~y$w_buff0_used~0_In291041392, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out291041392|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In291041392, ~y$w_buff1_used~0=~y$w_buff1_used~0_In291041392} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 17:41:06,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L736-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (= v_~y$r_buff1_thd1~0_125 |v_P0Thread1of1ForFork0_#t~ite8_32|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_125, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 17:41:06,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1240110796 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1240110796 256) 0))) (or (and (= ~y$w_buff0_used~0_In1240110796 |P1Thread1of1ForFork1_#t~ite11_Out1240110796|) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out1240110796| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1240110796, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1240110796} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1240110796, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1240110796, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1240110796|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 17:41:06,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L768-->L768-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-81740409 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-81740409 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-81740409 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-81740409 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite12_Out-81740409| ~y$w_buff1_used~0_In-81740409) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out-81740409| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-81740409, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-81740409, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-81740409, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-81740409} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-81740409, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-81740409, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-81740409, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-81740409|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-81740409} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 17:41:06,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L769-->L770: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-497874948 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-497874948 256)))) (or (and (= 0 ~y$r_buff0_thd2~0_Out-497874948) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In-497874948 ~y$r_buff0_thd2~0_Out-497874948)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-497874948, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-497874948} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-497874948, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-497874948, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-497874948|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 17:41:06,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [667] [667] L770-->L770-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-28722925 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-28722925 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-28722925 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-28722925 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out-28722925| ~y$r_buff1_thd2~0_In-28722925) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite14_Out-28722925| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-28722925, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-28722925, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-28722925, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-28722925} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-28722925, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-28722925, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-28722925, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-28722925|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-28722925} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 17:41:06,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~y$r_buff1_thd2~0_144 |v_P1Thread1of1ForFork1_#t~ite14_32|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_144, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 17:41:06,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L795-->L797-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_132 256)) (= 0 (mod v_~y$w_buff0_used~0_236 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_236, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_132, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_236, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_132, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 17:41:06,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In267255739 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In267255739 256)))) (or (and (= |ULTIMATE.start_main_#t~ite17_Out267255739| ~y$w_buff1~0_In267255739) (not .cse0) (not .cse1)) (and (= ~y~0_In267255739 |ULTIMATE.start_main_#t~ite17_Out267255739|) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In267255739, ~y~0=~y~0_In267255739, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In267255739, ~y$w_buff1_used~0=~y$w_buff1_used~0_In267255739} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out267255739|, ~y$w_buff1~0=~y$w_buff1~0_In267255739, ~y~0=~y~0_In267255739, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In267255739, ~y$w_buff1_used~0=~y$w_buff1_used~0_In267255739} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 17:41:06,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [619] [619] L797-4-->L798: Formula: (= v_~y~0_44 |v_ULTIMATE.start_main_#t~ite17_8|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_8|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_7|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_7|, ~y~0=v_~y~0_44} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~y~0] because there is no mapped edge [2019-12-27 17:41:06,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In824688624 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In824688624 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In824688624 |ULTIMATE.start_main_#t~ite19_Out824688624|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite19_Out824688624|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In824688624, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In824688624} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In824688624, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out824688624|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In824688624} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 17:41:06,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L799-->L799-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In452730106 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In452730106 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In452730106 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In452730106 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite20_Out452730106| ~y$w_buff1_used~0_In452730106)) (and (= 0 |ULTIMATE.start_main_#t~ite20_Out452730106|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In452730106, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In452730106, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In452730106, ~y$w_buff1_used~0=~y$w_buff1_used~0_In452730106} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In452730106, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In452730106, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out452730106|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In452730106, ~y$w_buff1_used~0=~y$w_buff1_used~0_In452730106} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 17:41:06,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1406220233 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1406220233 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out1406220233| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite21_Out1406220233| ~y$r_buff0_thd0~0_In1406220233)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1406220233, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1406220233} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1406220233, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1406220233, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1406220233|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 17:41:06,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1843932393 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1843932393 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1843932393 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1843932393 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite22_Out-1843932393| 0)) (and (= |ULTIMATE.start_main_#t~ite22_Out-1843932393| ~y$r_buff1_thd0~0_In-1843932393) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1843932393, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1843932393, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1843932393, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1843932393} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1843932393, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1843932393, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1843932393, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1843932393|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1843932393} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 17:41:06,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] L812-->L812-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1558393642 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite37_In1558393642| |ULTIMATE.start_main_#t~ite37_Out1558393642|) (= ~y$w_buff1_used~0_In1558393642 |ULTIMATE.start_main_#t~ite38_Out1558393642|) (not .cse0)) (and (= ~y$w_buff1_used~0_In1558393642 |ULTIMATE.start_main_#t~ite37_Out1558393642|) .cse0 (= |ULTIMATE.start_main_#t~ite37_Out1558393642| |ULTIMATE.start_main_#t~ite38_Out1558393642|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1558393642 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In1558393642 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In1558393642 256) 0)) (and (= (mod ~y$r_buff1_thd0~0_In1558393642 256) 0) .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1558393642, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1558393642, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_In1558393642|, ~weak$$choice2~0=~weak$$choice2~0_In1558393642, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1558393642, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1558393642} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1558393642, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1558393642, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1558393642|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1558393642|, ~weak$$choice2~0=~weak$$choice2~0_In1558393642, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1558393642, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1558393642} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 17:41:06,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [607] [607] L813-->L814: Formula: (and (= v_~y$r_buff0_thd0~0_98 v_~y$r_buff0_thd0~0_97) (not (= 0 (mod v_~weak$$choice2~0_26 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_26} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39, ~y$r_buff0_thd0~0] because there is no mapped edge [2019-12-27 17:41:06,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L816-->L819-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_16 256)) (not (= (mod v_~y$flush_delayed~0_27 256) 0)) (= v_~y~0_114 v_~y$mem_tmp~0_17) (= 0 v_~y$flush_delayed~0_26)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_114, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_18|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~y~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:41:06,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [674] [674] L819-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 17:41:06,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:41:06 BasicIcfg [2019-12-27 17:41:06,499 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:41:06,501 INFO L168 Benchmark]: Toolchain (without parser) took 16456.55 ms. Allocated memory was 142.1 MB in the beginning and 645.4 MB in the end (delta: 503.3 MB). Free memory was 98.6 MB in the beginning and 441.1 MB in the end (delta: -342.5 MB). Peak memory consumption was 160.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:41:06,502 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 142.1 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 17:41:06,503 INFO L168 Benchmark]: CACSL2BoogieTranslator took 806.78 ms. Allocated memory was 142.1 MB in the beginning and 199.2 MB in the end (delta: 57.1 MB). Free memory was 98.2 MB in the beginning and 151.2 MB in the end (delta: -53.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 17:41:06,503 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.87 ms. Allocated memory is still 199.2 MB. Free memory was 151.2 MB in the beginning and 148.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:41:06,504 INFO L168 Benchmark]: Boogie Preprocessor took 57.16 ms. Allocated memory is still 199.2 MB. Free memory was 148.4 MB in the beginning and 146.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:41:06,505 INFO L168 Benchmark]: RCFGBuilder took 753.29 ms. Allocated memory is still 199.2 MB. Free memory was 146.2 MB in the beginning and 101.1 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:41:06,506 INFO L168 Benchmark]: TraceAbstraction took 14761.90 ms. Allocated memory was 199.2 MB in the beginning and 645.4 MB in the end (delta: 446.2 MB). Free memory was 101.1 MB in the beginning and 441.1 MB in the end (delta: -340.1 MB). Peak memory consumption was 106.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:41:06,511 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.48 ms. Allocated memory is still 142.1 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 806.78 ms. Allocated memory was 142.1 MB in the beginning and 199.2 MB in the end (delta: 57.1 MB). Free memory was 98.2 MB in the beginning and 151.2 MB in the end (delta: -53.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.87 ms. Allocated memory is still 199.2 MB. Free memory was 151.2 MB in the beginning and 148.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.16 ms. Allocated memory is still 199.2 MB. Free memory was 148.4 MB in the beginning and 146.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 753.29 ms. Allocated memory is still 199.2 MB. Free memory was 146.2 MB in the beginning and 101.1 MB in the end (delta: 45.1 MB). Peak memory consumption was 45.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14761.90 ms. Allocated memory was 199.2 MB in the beginning and 645.4 MB in the end (delta: 446.2 MB). Free memory was 101.1 MB in the beginning and 441.1 MB in the end (delta: -340.1 MB). Peak memory consumption was 106.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.6s, 148 ProgramPointsBefore, 78 ProgramPointsAfterwards, 182 TransitionsBefore, 90 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 3838 VarBasedMoverChecksPositive, 191 VarBasedMoverChecksNegative, 62 SemBasedMoverChecksPositive, 187 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 46553 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L789] FCALL, FORK 0 pthread_create(&t1607, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK 0 pthread_create(&t1608, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L751] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L752] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L753] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L754] 2 y$r_buff0_thd2 = (_Bool)1 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 1 x = 1 [L729] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L734] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L735] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L800] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 y$flush_delayed = weak$$choice2 [L807] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L809] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L810] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L811] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L812] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.5s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1259 SDtfs, 1440 SDslu, 3222 SDs, 0 SdLazy, 2478 SolverSat, 134 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 36 SyntacticMatches, 15 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11568occurred 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: 1.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 2447 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 496 NumberOfCodeBlocks, 496 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 430 ConstructedInterpolants, 0 QuantifiedInterpolants, 81368 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...