/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/rfi000_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:40:26,692 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:40:26,694 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:40:26,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:40:26,713 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:40:26,715 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:40:26,716 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:40:26,726 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:40:26,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:40:26,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:40:26,734 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:40:26,737 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:40:26,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:40:26,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:40:26,739 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:40:26,741 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:40:26,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:40:26,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:40:26,745 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:40:26,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:40:26,753 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:40:26,754 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:40:26,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:40:26,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:40:26,760 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:40:26,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:40:26,760 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:40:26,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:40:26,763 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:40:26,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:40:26,765 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:40:26,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:40:26,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:40:26,767 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:40:26,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:40:26,768 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:40:26,768 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:40:26,769 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:40:26,769 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:40:26,770 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:40:26,770 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:40:26,771 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:26,784 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:40:26,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:40:26,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:40:26,786 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:40:26,786 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:40:26,786 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:40:26,786 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:40:26,787 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:40:26,787 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:40:26,787 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:40:26,787 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:40:26,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:40:26,787 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:40:26,788 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:40:26,788 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:40:26,788 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:40:26,788 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:40:26,788 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:40:26,789 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:40:26,789 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:40:26,789 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:40:26,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:40:26,789 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:40:26,790 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:40:26,790 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:40:26,790 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:40:26,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:40:26,790 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:40:26,790 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:40:26,791 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:40:26,791 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:40:27,064 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:40:27,082 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:40:27,085 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:40:27,086 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:40:27,086 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:40:27,087 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_rmo.opt.i [2019-12-27 17:40:27,158 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/680fbbd19/e3f182eb2a4844b0813a372d3c81f7d9/FLAG106f5d2c8 [2019-12-27 17:40:27,673 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:40:27,677 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_rmo.opt.i [2019-12-27 17:40:27,705 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/680fbbd19/e3f182eb2a4844b0813a372d3c81f7d9/FLAG106f5d2c8 [2019-12-27 17:40:27,998 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/680fbbd19/e3f182eb2a4844b0813a372d3c81f7d9 [2019-12-27 17:40:28,007 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:40:28,009 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:40:28,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:40:28,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:40:28,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:40:28,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:40:28" (1/1) ... [2019-12-27 17:40:28,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c1335d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:28, skipping insertion in model container [2019-12-27 17:40:28,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:40:28" (1/1) ... [2019-12-27 17:40:28,025 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:40:28,086 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:40:28,601 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:40:28,619 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:40:28,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:40:28,770 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:40:28,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:28 WrapperNode [2019-12-27 17:40:28,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:40:28,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:40:28,772 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:40:28,772 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:40:28,781 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:28" (1/1) ... [2019-12-27 17:40:28,808 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:28" (1/1) ... [2019-12-27 17:40:28,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:40:28,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:40:28,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:40:28,846 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:40:28,857 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:28" (1/1) ... [2019-12-27 17:40:28,857 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:28" (1/1) ... [2019-12-27 17:40:28,862 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:28" (1/1) ... [2019-12-27 17:40:28,862 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:28" (1/1) ... [2019-12-27 17:40:28,872 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:28" (1/1) ... [2019-12-27 17:40:28,876 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:28" (1/1) ... [2019-12-27 17:40:28,879 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:28" (1/1) ... [2019-12-27 17:40:28,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:40:28,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:40:28,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:40:28,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:40:28,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:28" (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:28,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:40:28,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:40:28,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:40:28,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:40:28,972 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:40:28,972 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:40:28,973 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:40:28,973 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:40:28,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:40:28,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:40:28,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:40:28,977 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:29,724 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:40:29,725 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:40:29,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:40:29 BoogieIcfgContainer [2019-12-27 17:40:29,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:40:29,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:40:29,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:40:29,731 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:40:29,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:40:28" (1/3) ... [2019-12-27 17:40:29,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60319a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:40:29, skipping insertion in model container [2019-12-27 17:40:29,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:40:28" (2/3) ... [2019-12-27 17:40:29,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60319a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:40:29, skipping insertion in model container [2019-12-27 17:40:29,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:40:29" (3/3) ... [2019-12-27 17:40:29,735 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_rmo.opt.i [2019-12-27 17:40:29,747 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:40:29,747 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:40:29,758 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:40:29,759 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:40:29,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,798 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,799 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,808 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,808 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,808 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:29,808 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,808 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,809 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,822 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,823 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,825 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,826 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,826 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,827 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:29,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:40:29,844 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:40:29,861 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:40:29,862 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:40:29,862 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:40:29,862 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:40:29,862 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:40:29,862 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:40:29,863 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:40:29,863 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:40:29,880 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 17:40:29,883 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 17:40:29,993 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 17:40:29,994 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:40:30,007 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 254 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:40:30,024 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 17:40:30,083 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 17:40:30,083 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:40:30,088 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 254 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:40:30,100 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 17:40:30,101 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:40:34,451 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 17:40:34,555 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 17:40:34,582 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50487 [2019-12-27 17:40:34,582 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-27 17:40:34,587 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 94 transitions [2019-12-27 17:40:35,129 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9480 states. [2019-12-27 17:40:35,131 INFO L276 IsEmpty]: Start isEmpty. Operand 9480 states. [2019-12-27 17:40:35,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 17:40:35,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:35,138 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 17:40:35,138 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:35,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:35,143 INFO L82 PathProgramCache]: Analyzing trace with hash 692929394, now seen corresponding path program 1 times [2019-12-27 17:40:35,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:35,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94434245] [2019-12-27 17:40:35,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:35,407 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:35,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94434245] [2019-12-27 17:40:35,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:35,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:40:35,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [244195665] [2019-12-27 17:40:35,413 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:35,419 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:35,435 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 17:40:35,436 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:35,440 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:40:35,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:40:35,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:35,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:40:35,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:40:35,459 INFO L87 Difference]: Start difference. First operand 9480 states. Second operand 3 states. [2019-12-27 17:40:35,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:35,745 INFO L93 Difference]: Finished difference Result 9416 states and 31128 transitions. [2019-12-27 17:40:35,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:40:35,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 17:40:35,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:35,912 INFO L225 Difference]: With dead ends: 9416 [2019-12-27 17:40:35,912 INFO L226 Difference]: Without dead ends: 9234 [2019-12-27 17:40:35,913 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:36,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9234 states. [2019-12-27 17:40:36,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9234 to 9234. [2019-12-27 17:40:36,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9234 states. [2019-12-27 17:40:36,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9234 states to 9234 states and 30568 transitions. [2019-12-27 17:40:36,506 INFO L78 Accepts]: Start accepts. Automaton has 9234 states and 30568 transitions. Word has length 5 [2019-12-27 17:40:36,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:36,506 INFO L462 AbstractCegarLoop]: Abstraction has 9234 states and 30568 transitions. [2019-12-27 17:40:36,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:40:36,507 INFO L276 IsEmpty]: Start isEmpty. Operand 9234 states and 30568 transitions. [2019-12-27 17:40:36,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:40:36,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:36,513 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:40:36,514 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:36,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:36,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1820083367, now seen corresponding path program 1 times [2019-12-27 17:40:36,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:36,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863433712] [2019-12-27 17:40:36,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:36,684 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:36,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863433712] [2019-12-27 17:40:36,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:36,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:40:36,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1556346524] [2019-12-27 17:40:36,685 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:36,687 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:36,692 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 17:40:36,692 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:36,694 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:40:36,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:40:36,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:36,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:40:36,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:40:36,697 INFO L87 Difference]: Start difference. First operand 9234 states and 30568 transitions. Second operand 4 states. [2019-12-27 17:40:37,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:37,193 INFO L93 Difference]: Finished difference Result 14362 states and 45554 transitions. [2019-12-27 17:40:37,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:40:37,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:40:37,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:37,271 INFO L225 Difference]: With dead ends: 14362 [2019-12-27 17:40:37,271 INFO L226 Difference]: Without dead ends: 14355 [2019-12-27 17:40:37,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:40:37,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14355 states. [2019-12-27 17:40:38,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14355 to 13038. [2019-12-27 17:40:38,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13038 states. [2019-12-27 17:40:38,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13038 states to 13038 states and 41962 transitions. [2019-12-27 17:40:38,423 INFO L78 Accepts]: Start accepts. Automaton has 13038 states and 41962 transitions. Word has length 11 [2019-12-27 17:40:38,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:38,423 INFO L462 AbstractCegarLoop]: Abstraction has 13038 states and 41962 transitions. [2019-12-27 17:40:38,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:40:38,423 INFO L276 IsEmpty]: Start isEmpty. Operand 13038 states and 41962 transitions. [2019-12-27 17:40:38,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:40:38,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:38,431 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:40:38,432 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:40:38,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:38,432 INFO L82 PathProgramCache]: Analyzing trace with hash 417951775, now seen corresponding path program 1 times [2019-12-27 17:40:38,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:38,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324192477] [2019-12-27 17:40:38,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:38,501 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:38,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324192477] [2019-12-27 17:40:38,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:38,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:40:38,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [103589026] [2019-12-27 17:40:38,502 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:38,503 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:38,504 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:40:38,505 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:38,505 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:40:38,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:40:38,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:38,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:40:38,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:40:38,506 INFO L87 Difference]: Start difference. First operand 13038 states and 41962 transitions. Second operand 3 states. [2019-12-27 17:40:38,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:38,531 INFO L93 Difference]: Finished difference Result 1778 states and 4038 transitions. [2019-12-27 17:40:38,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:40:38,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 17:40:38,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:38,537 INFO L225 Difference]: With dead ends: 1778 [2019-12-27 17:40:38,537 INFO L226 Difference]: Without dead ends: 1778 [2019-12-27 17:40:38,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:40:38,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1778 states. [2019-12-27 17:40:38,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1778 to 1778. [2019-12-27 17:40:38,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1778 states. [2019-12-27 17:40:38,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 4038 transitions. [2019-12-27 17:40:38,591 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 4038 transitions. Word has length 11 [2019-12-27 17:40:38,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:38,599 INFO L462 AbstractCegarLoop]: Abstraction has 1778 states and 4038 transitions. [2019-12-27 17:40:38,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:40:38,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 4038 transitions. [2019-12-27 17:40:38,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 17:40:38,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:38,604 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:40:38,604 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:40:38,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:38,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1954901459, now seen corresponding path program 1 times [2019-12-27 17:40:38,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:38,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872359337] [2019-12-27 17:40:38,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:38,708 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:38,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872359337] [2019-12-27 17:40:38,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:38,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:40:38,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1990078852] [2019-12-27 17:40:38,709 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:38,713 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:38,728 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 71 transitions. [2019-12-27 17:40:38,728 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:38,776 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:40:38,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:40:38,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:38,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:40:38,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:40:38,777 INFO L87 Difference]: Start difference. First operand 1778 states and 4038 transitions. Second operand 5 states. [2019-12-27 17:40:38,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:38,802 INFO L93 Difference]: Finished difference Result 371 states and 689 transitions. [2019-12-27 17:40:38,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:40:38,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 17:40:38,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:38,804 INFO L225 Difference]: With dead ends: 371 [2019-12-27 17:40:38,804 INFO L226 Difference]: Without dead ends: 371 [2019-12-27 17:40:38,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:40:38,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-12-27 17:40:38,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 336. [2019-12-27 17:40:38,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-27 17:40:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 624 transitions. [2019-12-27 17:40:38,813 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 624 transitions. Word has length 23 [2019-12-27 17:40:38,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:38,813 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 624 transitions. [2019-12-27 17:40:38,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:40:38,813 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 624 transitions. [2019-12-27 17:40:38,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:40:38,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:38,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] [2019-12-27 17:40:38,816 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:40:38,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:38,816 INFO L82 PathProgramCache]: Analyzing trace with hash 798988436, now seen corresponding path program 1 times [2019-12-27 17:40:38,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:38,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205598346] [2019-12-27 17:40:38,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:38,926 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:38,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205598346] [2019-12-27 17:40:38,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:38,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:40:38,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [168077052] [2019-12-27 17:40:38,927 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:38,948 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:38,983 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 98 transitions. [2019-12-27 17:40:38,983 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:38,984 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:40:38,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:40:38,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:38,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:40:38,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:40:38,985 INFO L87 Difference]: Start difference. First operand 336 states and 624 transitions. Second operand 3 states. [2019-12-27 17:40:39,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:39,036 INFO L93 Difference]: Finished difference Result 345 states and 638 transitions. [2019-12-27 17:40:39,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:40:39,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 17:40:39,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:39,038 INFO L225 Difference]: With dead ends: 345 [2019-12-27 17:40:39,038 INFO L226 Difference]: Without dead ends: 345 [2019-12-27 17:40:39,039 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:40:39,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-27 17:40:39,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2019-12-27 17:40:39,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-27 17:40:39,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 634 transitions. [2019-12-27 17:40:39,047 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 634 transitions. Word has length 52 [2019-12-27 17:40:39,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:39,047 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 634 transitions. [2019-12-27 17:40:39,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:40:39,048 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 634 transitions. [2019-12-27 17:40:39,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:40:39,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:39,049 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:40:39,050 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:40:39,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:39,050 INFO L82 PathProgramCache]: Analyzing trace with hash 112676449, now seen corresponding path program 1 times [2019-12-27 17:40:39,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:39,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77395690] [2019-12-27 17:40:39,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:39,111 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:39,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77395690] [2019-12-27 17:40:39,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:39,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:40:39,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1577109770] [2019-12-27 17:40:39,112 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:39,131 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:39,253 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 98 transitions. [2019-12-27 17:40:39,253 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:39,254 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:40:39,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:40:39,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:39,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:40:39,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:40:39,255 INFO L87 Difference]: Start difference. First operand 341 states and 634 transitions. Second operand 3 states. [2019-12-27 17:40:39,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:39,299 INFO L93 Difference]: Finished difference Result 345 states and 628 transitions. [2019-12-27 17:40:39,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:40:39,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 17:40:39,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:39,301 INFO L225 Difference]: With dead ends: 345 [2019-12-27 17:40:39,301 INFO L226 Difference]: Without dead ends: 345 [2019-12-27 17:40:39,302 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:40:39,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-12-27 17:40:39,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2019-12-27 17:40:39,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-12-27 17:40:39,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 624 transitions. [2019-12-27 17:40:39,312 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 624 transitions. Word has length 52 [2019-12-27 17:40:39,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:39,315 INFO L462 AbstractCegarLoop]: Abstraction has 341 states and 624 transitions. [2019-12-27 17:40:39,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:40:39,315 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 624 transitions. [2019-12-27 17:40:39,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:40:39,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:39,317 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:40:39,317 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:40:39,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:39,317 INFO L82 PathProgramCache]: Analyzing trace with hash 107384222, now seen corresponding path program 1 times [2019-12-27 17:40:39,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:39,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709272965] [2019-12-27 17:40:39,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:39,421 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:39,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709272965] [2019-12-27 17:40:39,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:39,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:40:39,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [71280182] [2019-12-27 17:40:39,423 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:39,437 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:39,468 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 98 transitions. [2019-12-27 17:40:39,468 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:39,469 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:40:39,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:40:39,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:39,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:40:39,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:40:39,470 INFO L87 Difference]: Start difference. First operand 341 states and 624 transitions. Second operand 3 states. [2019-12-27 17:40:39,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:39,486 INFO L93 Difference]: Finished difference Result 328 states and 585 transitions. [2019-12-27 17:40:39,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:40:39,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 17:40:39,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:39,487 INFO L225 Difference]: With dead ends: 328 [2019-12-27 17:40:39,487 INFO L226 Difference]: Without dead ends: 328 [2019-12-27 17:40:39,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:40:39,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-12-27 17:40:39,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2019-12-27 17:40:39,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 17:40:39,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 585 transitions. [2019-12-27 17:40:39,496 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 585 transitions. Word has length 52 [2019-12-27 17:40:39,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:39,496 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 585 transitions. [2019-12-27 17:40:39,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:40:39,496 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 585 transitions. [2019-12-27 17:40:39,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 17:40:39,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:39,498 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:40:39,499 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:40:39,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:39,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1649755206, now seen corresponding path program 1 times [2019-12-27 17:40:39,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:39,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862778237] [2019-12-27 17:40:39,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:39,687 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:39,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862778237] [2019-12-27 17:40:39,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:39,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:40:39,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1012940661] [2019-12-27 17:40:39,688 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:39,703 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:39,740 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 113 transitions. [2019-12-27 17:40:39,740 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:39,741 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:40:39,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:40:39,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:39,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:40:39,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:40:39,742 INFO L87 Difference]: Start difference. First operand 328 states and 585 transitions. Second operand 5 states. [2019-12-27 17:40:39,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:39,958 INFO L93 Difference]: Finished difference Result 459 states and 819 transitions. [2019-12-27 17:40:39,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:40:39,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 17:40:39,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:39,959 INFO L225 Difference]: With dead ends: 459 [2019-12-27 17:40:39,960 INFO L226 Difference]: Without dead ends: 459 [2019-12-27 17:40:39,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:40:39,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-12-27 17:40:39,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 363. [2019-12-27 17:40:39,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-12-27 17:40:39,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 652 transitions. [2019-12-27 17:40:39,970 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 652 transitions. Word has length 53 [2019-12-27 17:40:39,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:39,970 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 652 transitions. [2019-12-27 17:40:39,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:40:39,970 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 652 transitions. [2019-12-27 17:40:39,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 17:40:39,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:39,972 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:40:39,972 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:40:39,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:39,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1934699814, now seen corresponding path program 2 times [2019-12-27 17:40:39,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:39,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478987123] [2019-12-27 17:40:39,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:40,135 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:40,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478987123] [2019-12-27 17:40:40,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:40,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:40:40,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1127697949] [2019-12-27 17:40:40,136 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:40,229 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:40,263 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 109 transitions. [2019-12-27 17:40:40,264 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:40,284 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:40:40,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:40:40,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:40,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:40:40,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:40:40,286 INFO L87 Difference]: Start difference. First operand 363 states and 652 transitions. Second operand 6 states. [2019-12-27 17:40:40,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:40,483 INFO L93 Difference]: Finished difference Result 502 states and 893 transitions. [2019-12-27 17:40:40,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:40:40,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-27 17:40:40,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:40,485 INFO L225 Difference]: With dead ends: 502 [2019-12-27 17:40:40,485 INFO L226 Difference]: Without dead ends: 502 [2019-12-27 17:40:40,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:40:40,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-12-27 17:40:40,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 377. [2019-12-27 17:40:40,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-12-27 17:40:40,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 678 transitions. [2019-12-27 17:40:40,495 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 678 transitions. Word has length 53 [2019-12-27 17:40:40,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:40,495 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 678 transitions. [2019-12-27 17:40:40,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:40:40,495 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 678 transitions. [2019-12-27 17:40:40,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 17:40:40,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:40,497 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:40:40,497 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:40:40,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:40,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1416640772, now seen corresponding path program 3 times [2019-12-27 17:40:40,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:40,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850301429] [2019-12-27 17:40:40,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:40,717 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:40,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850301429] [2019-12-27 17:40:40,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:40,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 17:40:40,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [395063960] [2019-12-27 17:40:40,718 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:40,735 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:40,771 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 119 transitions. [2019-12-27 17:40:40,771 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:40,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:40:40,834 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:40:40,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:40:40,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:40,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:40:40,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:40:40,835 INFO L87 Difference]: Start difference. First operand 377 states and 678 transitions. Second operand 10 states. [2019-12-27 17:40:41,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:41,861 INFO L93 Difference]: Finished difference Result 649 states and 1145 transitions. [2019-12-27 17:40:41,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 17:40:41,862 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-12-27 17:40:41,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:41,863 INFO L225 Difference]: With dead ends: 649 [2019-12-27 17:40:41,864 INFO L226 Difference]: Without dead ends: 649 [2019-12-27 17:40:41,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-12-27 17:40:41,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-12-27 17:40:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 363. [2019-12-27 17:40:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-12-27 17:40:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 648 transitions. [2019-12-27 17:40:41,875 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 648 transitions. Word has length 53 [2019-12-27 17:40:41,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:41,875 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 648 transitions. [2019-12-27 17:40:41,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:40:41,875 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 648 transitions. [2019-12-27 17:40:41,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 17:40:41,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:41,877 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:40:41,877 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:40:41,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:41,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1073733746, now seen corresponding path program 4 times [2019-12-27 17:40:41,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:41,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400800284] [2019-12-27 17:40:41,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:42,036 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:42,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400800284] [2019-12-27 17:40:42,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:42,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:40:42,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1264373055] [2019-12-27 17:40:42,038 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:42,049 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:42,082 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 103 transitions. [2019-12-27 17:40:42,082 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:42,085 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:40:42,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:40:42,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:42,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:40:42,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:40:42,087 INFO L87 Difference]: Start difference. First operand 363 states and 648 transitions. Second operand 5 states. [2019-12-27 17:40:42,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:42,140 INFO L93 Difference]: Finished difference Result 587 states and 1029 transitions. [2019-12-27 17:40:42,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:40:42,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-12-27 17:40:42,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:42,142 INFO L225 Difference]: With dead ends: 587 [2019-12-27 17:40:42,142 INFO L226 Difference]: Without dead ends: 241 [2019-12-27 17:40:42,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:40:42,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-12-27 17:40:42,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2019-12-27 17:40:42,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-12-27 17:40:42,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 407 transitions. [2019-12-27 17:40:42,147 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 407 transitions. Word has length 53 [2019-12-27 17:40:42,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:42,148 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 407 transitions. [2019-12-27 17:40:42,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:40:42,148 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 407 transitions. [2019-12-27 17:40:42,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 17:40:42,149 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:42,149 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:40:42,149 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:40:42,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:42,150 INFO L82 PathProgramCache]: Analyzing trace with hash 175082296, now seen corresponding path program 5 times [2019-12-27 17:40:42,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:42,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360838388] [2019-12-27 17:40:42,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:40:42,202 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:42,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360838388] [2019-12-27 17:40:42,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:40:42,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:40:42,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [324960176] [2019-12-27 17:40:42,203 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:40:42,217 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:40:42,253 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 85 states and 105 transitions. [2019-12-27 17:40:42,253 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:40:42,254 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:40:42,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:40:42,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:40:42,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:40:42,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:40:42,255 INFO L87 Difference]: Start difference. First operand 241 states and 407 transitions. Second operand 3 states. [2019-12-27 17:40:42,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:40:42,299 INFO L93 Difference]: Finished difference Result 240 states and 405 transitions. [2019-12-27 17:40:42,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:40:42,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 17:40:42,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:40:42,301 INFO L225 Difference]: With dead ends: 240 [2019-12-27 17:40:42,301 INFO L226 Difference]: Without dead ends: 240 [2019-12-27 17:40:42,302 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:40:42,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-12-27 17:40:42,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 197. [2019-12-27 17:40:42,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-12-27 17:40:42,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 332 transitions. [2019-12-27 17:40:42,308 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 332 transitions. Word has length 53 [2019-12-27 17:40:42,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:40:42,308 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 332 transitions. [2019-12-27 17:40:42,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:40:42,309 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 332 transitions. [2019-12-27 17:40:42,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 17:40:42,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:40:42,310 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:40:42,310 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:40:42,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:40:42,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1455781027, now seen corresponding path program 1 times [2019-12-27 17:40:42,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:40:42,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993164980] [2019-12-27 17:40:42,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:40:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:40:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:40:42,465 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:40:42,465 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:40:42,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] ULTIMATE.startENTRY-->L787: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x~0_169) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1595~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1595~0.base_19|) |v_ULTIMATE.start_main_~#t1595~0.offset_14| 0)) |v_#memory_int_17|) (= 0 v_~x$read_delayed_var~0.offset_6) (= |v_#NULL.offset_7| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1595~0.base_19|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1595~0.base_19| 4)) (= v_~x$r_buff1_thd2~0_98 0) (= 0 v_~__unbuffered_cnt~0_67) (= v_~main$tmp_guard1~0_21 0) (= 0 v_~x$w_buff1_used~0_304) (= v_~x$r_buff0_thd0~0_295 0) (= 0 v_~x$r_buff0_thd2~0_162) (< 0 |v_#StackHeapBarrier_15|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1595~0.base_19|) (= 0 v_~x$read_delayed~0_6) (= v_~y~0_104 0) (= v_~__unbuffered_p1_EBX~0_62 0) (= v_~x$mem_tmp~0_16 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1595~0.base_19| 1) |v_#valid_46|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~weak$$choice2~0_83) (= 0 v_~weak$$choice0~0_11) (= 0 v_~__unbuffered_p1_EAX~0_62) (= 0 |v_#NULL.base_7|) (= 0 v_~x$w_buff1~0_172) (= 0 |v_ULTIMATE.start_main_~#t1595~0.offset_14|) (= v_~main$tmp_guard0~0_26 0) (= v_~x$r_buff1_thd1~0_135 0) (= v_~x$r_buff0_thd1~0_120 0) (= 0 v_~x$w_buff0~0_199) (= v_~x$r_buff1_thd0~0_177 0) (= 0 v_~x$w_buff0_used~0_556))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_199, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_30|, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_25|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_135, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_29|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_32|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_25|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_62, #length=|v_#length_17|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_295, ULTIMATE.start_main_~#t1595~0.offset=|v_ULTIMATE.start_main_~#t1595~0.offset_14|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_31|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_30|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_15|, ~x$w_buff1~0=v_~x$w_buff1~0_172, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_23|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_304, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_98, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_34|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_~#t1595~0.base=|v_ULTIMATE.start_main_~#t1595~0.base_19|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ULTIMATE.start_main_~#t1596~0.base=|v_ULTIMATE.start_main_~#t1596~0.base_17|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, ~x~0=v_~x~0_169, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_120, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_19|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_32|, ~x$mem_tmp~0=v_~x$mem_tmp~0_16, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_37|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_30|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_28|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_34|, ~y~0=v_~y~0_104, ULTIMATE.start_main_~#t1596~0.offset=|v_ULTIMATE.start_main_~#t1596~0.offset_14|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_37|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_15|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_177, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_162, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_23|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_28|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_556, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_23|, ~weak$$choice2~0=v_~weak$$choice2~0_83, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1595~0.offset, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_~#t1595~0.base, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1596~0.base, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ULTIMATE.start_main_~#t1596~0.offset, ~__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, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 17:40:42,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L787-1-->L789: Formula: (and (= |v_ULTIMATE.start_main_~#t1596~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1596~0.base_10|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1596~0.base_10| 1)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1596~0.base_10| 4) |v_#length_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1596~0.base_10|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1596~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1596~0.base_10|) |v_ULTIMATE.start_main_~#t1596~0.offset_9| 1))) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1596~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1596~0.base=|v_ULTIMATE.start_main_~#t1596~0.base_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_3|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1596~0.offset=|v_ULTIMATE.start_main_~#t1596~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1596~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1596~0.offset] because there is no mapped edge [2019-12-27 17:40:42,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L4-->L764: Formula: (and (= ~y~0_Out-1134078595 1) (= ~y~0_Out-1134078595 ~__unbuffered_p1_EBX~0_Out-1134078595) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1134078595 0)) (= ~x$r_buff1_thd2~0_Out-1134078595 ~x$r_buff0_thd2~0_In-1134078595) (= ~x$r_buff0_thd1~0_In-1134078595 ~x$r_buff1_thd1~0_Out-1134078595) (= ~__unbuffered_p1_EAX~0_Out-1134078595 ~y~0_Out-1134078595) (= ~x$r_buff0_thd2~0_Out-1134078595 1) (= ~x$r_buff1_thd0~0_Out-1134078595 ~x$r_buff0_thd0~0_In-1134078595)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1134078595, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1134078595, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1134078595, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1134078595} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1134078595, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1134078595, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1134078595, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-1134078595, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-1134078595, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-1134078595, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-1134078595, ~y~0=~y~0_Out-1134078595, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1134078595, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1134078595} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 17:40:42,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L730-2-->L730-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1899841780 256))) (.cse0 (= (mod ~x$r_buff1_thd1~0_In1899841780 256) 0))) (or (and (or .cse0 .cse1) (= ~x~0_In1899841780 |P0Thread1of1ForFork0_#t~ite3_Out1899841780|)) (and (not .cse1) (not .cse0) (= ~x$w_buff1~0_In1899841780 |P0Thread1of1ForFork0_#t~ite3_Out1899841780|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1899841780, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1899841780, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1899841780, ~x~0=~x~0_In1899841780} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1899841780|, ~x$w_buff1~0=~x$w_buff1~0_In1899841780, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1899841780, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1899841780, ~x~0=~x~0_In1899841780} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-12-27 17:40:42,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L730-4-->L731: Formula: (= v_~x~0_20 |v_P0Thread1of1ForFork0_#t~ite3_16|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_16|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_15|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_7|, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~x~0] because there is no mapped edge [2019-12-27 17:40:42,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L731-->L731-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1393113958 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1393113958 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1393113958| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1393113958 |P0Thread1of1ForFork0_#t~ite5_Out1393113958|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1393113958, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1393113958} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1393113958|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1393113958, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1393113958} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 17:40:42,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L732-->L732-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-383435319 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-383435319 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-383435319 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In-383435319 256)))) (or (and (= ~x$w_buff1_used~0_In-383435319 |P0Thread1of1ForFork0_#t~ite6_Out-383435319|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-383435319|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-383435319, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-383435319, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-383435319, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-383435319} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-383435319|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-383435319, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-383435319, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-383435319, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-383435319} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 17:40:42,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L733-->L733-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1595296037 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1595296037 256) 0))) (or (and (= ~x$r_buff0_thd1~0_In1595296037 |P0Thread1of1ForFork0_#t~ite7_Out1595296037|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out1595296037|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1595296037, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1595296037} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1595296037, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1595296037|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1595296037} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 17:40:42,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1278888744 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1278888744 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1278888744 |P1Thread1of1ForFork1_#t~ite11_Out1278888744|)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out1278888744| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1278888744, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1278888744} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1278888744|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1278888744, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1278888744} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 17:40:42,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L766-->L766-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1932969569 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1932969569 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1932969569 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1932969569 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1932969569 |P1Thread1of1ForFork1_#t~ite12_Out1932969569|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1932969569|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1932969569, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1932969569, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1932969569, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1932969569} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1932969569, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1932969569, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1932969569|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1932969569, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1932969569} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 17:40:42,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L767-->L768: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-822109310 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-822109310 256)))) (or (and (= ~x$r_buff0_thd2~0_Out-822109310 ~x$r_buff0_thd2~0_In-822109310) (or .cse0 .cse1)) (and (= ~x$r_buff0_thd2~0_Out-822109310 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-822109310, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-822109310} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-822109310|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-822109310, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-822109310} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 17:40:42,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L768-->L768-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-2091993043 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-2091993043 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-2091993043 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-2091993043 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-2091993043| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~x$r_buff1_thd2~0_In-2091993043 |P1Thread1of1ForFork1_#t~ite14_Out-2091993043|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2091993043, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2091993043, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2091993043, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2091993043} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2091993043, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2091993043, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2091993043, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-2091993043|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2091993043} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 17:40:42,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= v_~x$r_buff1_thd2~0_46 |v_P1Thread1of1ForFork1_#t~ite14_34|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_34|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_46, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_33|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 17:40:42,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L734-->L734-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In938177317 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In938177317 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd1~0_In938177317 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In938177317 256)))) (or (and (= ~x$r_buff1_thd1~0_In938177317 |P0Thread1of1ForFork0_#t~ite8_Out938177317|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out938177317|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In938177317, ~x$w_buff1_used~0=~x$w_buff1_used~0_In938177317, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In938177317, ~x$w_buff0_used~0=~x$w_buff0_used~0_In938177317} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In938177317, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out938177317|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In938177317, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In938177317, ~x$w_buff0_used~0=~x$w_buff0_used~0_In938177317} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 17:40:42,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L734-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_94 |v_P0Thread1of1ForFork0_#t~ite8_34|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_33|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_94} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 17:40:42,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L789-1-->L795: Formula: (and (= 2 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 17:40:42,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L795-2-->L795-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In1641304603 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In1641304603 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite17_Out1641304603| ~x$w_buff1~0_In1641304603)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite17_Out1641304603| ~x~0_In1641304603)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1641304603, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1641304603, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1641304603, ~x~0=~x~0_In1641304603} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1641304603|, ~x$w_buff1~0=~x$w_buff1~0_In1641304603, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1641304603, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1641304603, ~x~0=~x~0_In1641304603} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17] because there is no mapped edge [2019-12-27 17:40:42,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [624] [624] L795-4-->L796: Formula: (= v_~x~0_42 |v_ULTIMATE.start_main_#t~ite17_11|) InVars {ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_11|} OutVars{ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_10|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_6|, ~x~0=v_~x~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ~x~0] because there is no mapped edge [2019-12-27 17:40:42,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In473651950 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In473651950 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite19_Out473651950| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In473651950 |ULTIMATE.start_main_#t~ite19_Out473651950|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In473651950, ~x$w_buff0_used~0=~x$w_buff0_used~0_In473651950} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In473651950, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out473651950|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In473651950} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 17:40:42,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-241540941 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-241540941 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-241540941 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-241540941 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite20_Out-241540941| ~x$w_buff1_used~0_In-241540941)) (and (= 0 |ULTIMATE.start_main_#t~ite20_Out-241540941|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-241540941, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-241540941, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-241540941, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-241540941} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-241540941, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-241540941, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-241540941|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-241540941, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-241540941} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 17:40:42,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-71790279 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In-71790279 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite21_Out-71790279| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite21_Out-71790279| ~x$r_buff0_thd0~0_In-71790279)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-71790279, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-71790279} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-71790279, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-71790279|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-71790279} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 17:40:42,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In2008743895 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd0~0_In2008743895 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In2008743895 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In2008743895 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite22_Out2008743895|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd0~0_In2008743895 |ULTIMATE.start_main_#t~ite22_Out2008743895|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2008743895, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2008743895, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2008743895, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2008743895} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2008743895, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2008743895, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2008743895, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out2008743895|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2008743895} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 17:40:42,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L812: Formula: (and (not (= (mod v_~weak$$choice2~0_40 256) 0)) (= v_~x$r_buff0_thd0~0_150 v_~x$r_buff0_thd0~0_151)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_151, ~weak$$choice2~0=v_~weak$$choice2~0_40} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_150, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ~weak$$choice2~0=v_~weak$$choice2~0_40} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 17:40:42,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L814-->L817-1: Formula: (and (= v_~x$mem_tmp~0_10 v_~x~0_111) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7| (mod v_~main$tmp_guard1~0_11 256)) (not (= 0 (mod v_~x$flush_delayed~0_20 256))) (= v_~x$flush_delayed~0_19 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_111, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:40:42,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L817-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 17:40:42,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:40:42 BasicIcfg [2019-12-27 17:40:42,602 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:40:42,605 INFO L168 Benchmark]: Toolchain (without parser) took 14595.43 ms. Allocated memory was 144.7 MB in the beginning and 590.3 MB in the end (delta: 445.6 MB). Free memory was 100.7 MB in the beginning and 237.3 MB in the end (delta: -136.5 MB). Peak memory consumption was 309.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:40:42,606 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 17:40:42,609 INFO L168 Benchmark]: CACSL2BoogieTranslator took 761.26 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.3 MB in the beginning and 154.5 MB in the end (delta: -54.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 17:40:42,610 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.29 ms. Allocated memory is still 201.9 MB. Free memory was 154.5 MB in the beginning and 151.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-27 17:40:42,611 INFO L168 Benchmark]: Boogie Preprocessor took 38.74 ms. Allocated memory is still 201.9 MB. Free memory was 151.1 MB in the beginning and 149.0 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:40:42,612 INFO L168 Benchmark]: RCFGBuilder took 841.42 ms. Allocated memory is still 201.9 MB. Free memory was 149.0 MB in the beginning and 103.9 MB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:40:42,615 INFO L168 Benchmark]: TraceAbstraction took 12874.33 ms. Allocated memory was 201.9 MB in the beginning and 590.3 MB in the end (delta: 388.5 MB). Free memory was 103.9 MB in the beginning and 237.3 MB in the end (delta: -133.3 MB). Peak memory consumption was 255.2 MB. Max. memory is 7.1 GB. [2019-12-27 17:40:42,619 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.17 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 761.26 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.3 MB in the beginning and 154.5 MB in the end (delta: -54.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.29 ms. Allocated memory is still 201.9 MB. Free memory was 154.5 MB in the beginning and 151.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.74 ms. Allocated memory is still 201.9 MB. Free memory was 151.1 MB in the beginning and 149.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 841.42 ms. Allocated memory is still 201.9 MB. Free memory was 149.0 MB in the beginning and 103.9 MB in the end (delta: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12874.33 ms. Allocated memory was 201.9 MB in the beginning and 590.3 MB in the end (delta: 388.5 MB). Free memory was 103.9 MB in the beginning and 237.3 MB in the end (delta: -133.3 MB). Peak memory consumption was 255.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.7s, 147 ProgramPointsBefore, 81 ProgramPointsAfterwards, 181 TransitionsBefore, 94 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 24 ChoiceCompositions, 3783 VarBasedMoverChecksPositive, 170 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 202 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 50487 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L787] FCALL, FORK 0 pthread_create(&t1595, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] FCALL, FORK 0 pthread_create(&t1596, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 2 x$w_buff1 = x$w_buff0 [L745] 2 x$w_buff0 = 2 [L746] 2 x$w_buff1_used = x$w_buff0_used [L747] 2 x$w_buff0_used = (_Bool)1 [L724] 1 y = 2 [L727] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L730] 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L731] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L733] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L795] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L797] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L798] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L799] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L802] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 0 x$flush_delayed = weak$$choice2 [L805] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L807] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L807] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L808] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L809] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L810] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L810] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L812] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L812] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.6s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1200 SDtfs, 614 SDslu, 1884 SDs, 0 SdLazy, 1108 SolverSat, 73 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 26 SyntacticMatches, 17 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13038occurred 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.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 1910 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 525 NumberOfCodeBlocks, 525 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 459 ConstructedInterpolants, 0 QuantifiedInterpolants, 61484 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...