/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/mix031_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:45:07,784 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:45:07,787 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:45:07,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:45:07,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:45:07,801 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:45:07,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:45:07,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:45:07,806 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:45:07,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:45:07,808 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:45:07,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:45:07,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:45:07,810 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:45:07,811 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:45:07,812 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:45:07,813 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:45:07,814 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:45:07,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:45:07,817 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:45:07,819 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:45:07,820 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:45:07,821 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:45:07,822 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:45:07,824 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:45:07,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:45:07,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:45:07,825 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:45:07,826 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:45:07,828 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:45:07,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:45:07,829 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:45:07,830 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:45:07,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:45:07,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:45:07,832 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:45:07,833 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:45:07,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:45:07,833 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:45:07,834 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:45:07,835 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:45:07,835 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 16:45:07,852 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:45:07,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:45:07,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:45:07,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:45:07,854 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:45:07,854 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:45:07,854 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:45:07,855 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:45:07,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:45:07,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:45:07,855 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:45:07,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:45:07,856 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:45:07,856 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:45:07,856 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:45:07,856 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:45:07,856 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:45:07,857 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:45:07,857 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:45:07,857 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:45:07,857 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:45:07,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:45:07,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:45:07,858 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:45:07,858 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:45:07,858 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:45:07,859 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:45:07,859 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:45:07,859 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:45:07,859 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:45:07,859 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:45:08,130 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:45:08,147 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:45:08,151 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:45:08,152 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:45:08,153 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:45:08,154 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_rmo.opt.i [2019-12-27 16:45:08,238 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a65f15cf/2f9f7a30a67b4461a87231c0efefd909/FLAGc6a459dda [2019-12-27 16:45:08,871 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:45:08,871 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_rmo.opt.i [2019-12-27 16:45:08,895 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a65f15cf/2f9f7a30a67b4461a87231c0efefd909/FLAGc6a459dda [2019-12-27 16:45:09,107 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a65f15cf/2f9f7a30a67b4461a87231c0efefd909 [2019-12-27 16:45:09,115 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:45:09,117 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:45:09,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:45:09,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:45:09,122 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:45:09,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:45:09" (1/1) ... [2019-12-27 16:45:09,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3e8ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:09, skipping insertion in model container [2019-12-27 16:45:09,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:45:09" (1/1) ... [2019-12-27 16:45:09,134 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:45:09,207 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:45:09,757 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:45:09,776 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:45:09,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:45:09,935 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:45:09,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:09 WrapperNode [2019-12-27 16:45:09,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:45:09,937 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:45:09,937 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:45:09,937 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:45:09,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:09" (1/1) ... [2019-12-27 16:45:09,967 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:09" (1/1) ... [2019-12-27 16:45:09,999 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:45:09,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:45:09,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:45:10,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:45:10,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:09" (1/1) ... [2019-12-27 16:45:10,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:09" (1/1) ... [2019-12-27 16:45:10,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:09" (1/1) ... [2019-12-27 16:45:10,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:09" (1/1) ... [2019-12-27 16:45:10,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:09" (1/1) ... [2019-12-27 16:45:10,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:09" (1/1) ... [2019-12-27 16:45:10,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:09" (1/1) ... [2019-12-27 16:45:10,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:45:10,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:45:10,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:45:10,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:45:10,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:09" (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 16:45:10,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:45:10,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:45:10,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:45:10,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:45:10,112 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:45:10,113 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:45:10,115 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:45:10,115 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:45:10,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:45:10,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:45:10,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:45:10,118 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 16:45:10,811 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:45:10,811 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:45:10,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:45:10 BoogieIcfgContainer [2019-12-27 16:45:10,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:45:10,814 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:45:10,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:45:10,820 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:45:10,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:45:09" (1/3) ... [2019-12-27 16:45:10,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e198fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:45:10, skipping insertion in model container [2019-12-27 16:45:10,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:45:09" (2/3) ... [2019-12-27 16:45:10,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e198fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:45:10, skipping insertion in model container [2019-12-27 16:45:10,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:45:10" (3/3) ... [2019-12-27 16:45:10,828 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_rmo.opt.i [2019-12-27 16:45:10,839 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:45:10,839 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:45:10,853 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:45:10,854 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:45:10,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,917 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,917 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,921 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,922 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,923 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,924 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,925 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,926 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,927 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,928 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,929 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,930 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,938 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,939 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,940 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,945 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,946 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,947 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,948 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,949 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,953 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,954 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,961 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,961 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,962 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,962 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,962 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,988 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,990 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,999 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,999 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:10,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:11,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:11,000 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:11,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:11,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:11,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:11,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:11,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:11,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:45:11,019 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 16:45:11,036 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:45:11,036 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:45:11,036 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:45:11,036 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:45:11,036 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:45:11,036 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:45:11,037 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:45:11,037 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:45:11,054 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 167 transitions [2019-12-27 16:45:11,056 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-12-27 16:45:11,180 INFO L132 PetriNetUnfolder]: 35/165 cut-off events. [2019-12-27 16:45:11,180 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:45:11,199 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 0/128 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 16:45:11,216 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-12-27 16:45:11,280 INFO L132 PetriNetUnfolder]: 35/165 cut-off events. [2019-12-27 16:45:11,280 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:45:11,285 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 0/128 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 16:45:11,298 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 16:45:11,299 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:45:15,823 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-12-27 16:45:15,933 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-12-27 16:45:16,086 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 16:45:16,200 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 16:45:16,239 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44937 [2019-12-27 16:45:16,239 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-27 16:45:16,243 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 78 transitions [2019-12-27 16:45:16,588 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6574 states. [2019-12-27 16:45:16,591 INFO L276 IsEmpty]: Start isEmpty. Operand 6574 states. [2019-12-27 16:45:16,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 16:45:16,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:16,599 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 16:45:16,600 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:16,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:16,607 INFO L82 PathProgramCache]: Analyzing trace with hash 689015014, now seen corresponding path program 1 times [2019-12-27 16:45:16,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:16,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409555332] [2019-12-27 16:45:16,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:16,899 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 16:45:16,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409555332] [2019-12-27 16:45:16,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:16,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:45:16,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2131098140] [2019-12-27 16:45:16,905 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:16,911 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:16,926 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 16:45:16,926 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:16,930 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:45:16,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:45:16,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:16,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:45:16,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:45:16,949 INFO L87 Difference]: Start difference. First operand 6574 states. Second operand 3 states. [2019-12-27 16:45:17,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:17,177 INFO L93 Difference]: Finished difference Result 6414 states and 21608 transitions. [2019-12-27 16:45:17,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:45:17,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 16:45:17,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:17,258 INFO L225 Difference]: With dead ends: 6414 [2019-12-27 16:45:17,258 INFO L226 Difference]: Without dead ends: 6042 [2019-12-27 16:45:17,259 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 16:45:17,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2019-12-27 16:45:17,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 6042. [2019-12-27 16:45:17,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6042 states. [2019-12-27 16:45:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6042 states to 6042 states and 20317 transitions. [2019-12-27 16:45:17,639 INFO L78 Accepts]: Start accepts. Automaton has 6042 states and 20317 transitions. Word has length 5 [2019-12-27 16:45:17,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:17,639 INFO L462 AbstractCegarLoop]: Abstraction has 6042 states and 20317 transitions. [2019-12-27 16:45:17,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:45:17,639 INFO L276 IsEmpty]: Start isEmpty. Operand 6042 states and 20317 transitions. [2019-12-27 16:45:17,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:45:17,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:17,643 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:17,643 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:17,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:17,644 INFO L82 PathProgramCache]: Analyzing trace with hash 288534667, now seen corresponding path program 1 times [2019-12-27 16:45:17,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:17,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853539476] [2019-12-27 16:45:17,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:17,716 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 16:45:17,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853539476] [2019-12-27 16:45:17,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:17,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:45:17,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1179762561] [2019-12-27 16:45:17,717 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:17,719 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:17,723 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:45:17,725 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:17,726 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:45:17,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:45:17,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:17,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:45:17,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:45:17,728 INFO L87 Difference]: Start difference. First operand 6042 states and 20317 transitions. Second operand 3 states. [2019-12-27 16:45:17,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:17,760 INFO L93 Difference]: Finished difference Result 1215 states and 3009 transitions. [2019-12-27 16:45:17,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:45:17,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 16:45:17,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:17,769 INFO L225 Difference]: With dead ends: 1215 [2019-12-27 16:45:17,769 INFO L226 Difference]: Without dead ends: 1215 [2019-12-27 16:45:17,771 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 16:45:17,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2019-12-27 16:45:17,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1215. [2019-12-27 16:45:17,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2019-12-27 16:45:17,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 3009 transitions. [2019-12-27 16:45:17,811 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 3009 transitions. Word has length 11 [2019-12-27 16:45:17,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:17,811 INFO L462 AbstractCegarLoop]: Abstraction has 1215 states and 3009 transitions. [2019-12-27 16:45:17,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:45:17,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 3009 transitions. [2019-12-27 16:45:17,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:45:17,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:17,820 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:17,821 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:17,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:17,822 INFO L82 PathProgramCache]: Analyzing trace with hash -869921106, now seen corresponding path program 1 times [2019-12-27 16:45:17,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:17,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242783240] [2019-12-27 16:45:17,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:17,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:45:17,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242783240] [2019-12-27 16:45:17,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:17,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:45:17,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1783591251] [2019-12-27 16:45:17,944 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:17,947 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:17,957 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 16:45:17,958 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:18,026 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:45:18,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:45:18,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:18,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:45:18,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:45:18,029 INFO L87 Difference]: Start difference. First operand 1215 states and 3009 transitions. Second operand 5 states. [2019-12-27 16:45:18,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:18,214 INFO L93 Difference]: Finished difference Result 1870 states and 4688 transitions. [2019-12-27 16:45:18,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:45:18,214 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 16:45:18,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:18,226 INFO L225 Difference]: With dead ends: 1870 [2019-12-27 16:45:18,226 INFO L226 Difference]: Without dead ends: 1870 [2019-12-27 16:45:18,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:45:18,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2019-12-27 16:45:18,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1354. [2019-12-27 16:45:18,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1354 states. [2019-12-27 16:45:18,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 3400 transitions. [2019-12-27 16:45:18,300 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 3400 transitions. Word has length 14 [2019-12-27 16:45:18,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:18,300 INFO L462 AbstractCegarLoop]: Abstraction has 1354 states and 3400 transitions. [2019-12-27 16:45:18,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:45:18,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 3400 transitions. [2019-12-27 16:45:18,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:45:18,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:18,303 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:18,303 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:18,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:18,303 INFO L82 PathProgramCache]: Analyzing trace with hash -732651370, now seen corresponding path program 1 times [2019-12-27 16:45:18,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:18,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536580263] [2019-12-27 16:45:18,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:18,431 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 16:45:18,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536580263] [2019-12-27 16:45:18,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:18,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:45:18,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1423054423] [2019-12-27 16:45:18,435 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:18,437 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:18,441 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 16:45:18,442 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:18,461 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:45:18,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:45:18,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:18,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:45:18,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:45:18,462 INFO L87 Difference]: Start difference. First operand 1354 states and 3400 transitions. Second operand 5 states. [2019-12-27 16:45:18,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:18,704 INFO L93 Difference]: Finished difference Result 1775 states and 4313 transitions. [2019-12-27 16:45:18,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:45:18,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 16:45:18,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:18,716 INFO L225 Difference]: With dead ends: 1775 [2019-12-27 16:45:18,716 INFO L226 Difference]: Without dead ends: 1775 [2019-12-27 16:45:18,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:45:18,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2019-12-27 16:45:18,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1643. [2019-12-27 16:45:18,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1643 states. [2019-12-27 16:45:18,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 4018 transitions. [2019-12-27 16:45:18,787 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 4018 transitions. Word has length 14 [2019-12-27 16:45:18,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:18,787 INFO L462 AbstractCegarLoop]: Abstraction has 1643 states and 4018 transitions. [2019-12-27 16:45:18,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:45:18,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 4018 transitions. [2019-12-27 16:45:18,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:45:18,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:18,789 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:18,789 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:18,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:18,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1514120075, now seen corresponding path program 1 times [2019-12-27 16:45:18,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:18,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445391618] [2019-12-27 16:45:18,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:18,891 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 16:45:18,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445391618] [2019-12-27 16:45:18,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:18,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:45:18,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2065788224] [2019-12-27 16:45:18,892 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:18,894 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:18,898 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 16:45:18,899 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:18,924 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:45:18,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:45:18,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:18,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:45:18,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:45:18,925 INFO L87 Difference]: Start difference. First operand 1643 states and 4018 transitions. Second operand 5 states. [2019-12-27 16:45:19,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:19,159 INFO L93 Difference]: Finished difference Result 2036 states and 4889 transitions. [2019-12-27 16:45:19,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:45:19,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 16:45:19,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:19,171 INFO L225 Difference]: With dead ends: 2036 [2019-12-27 16:45:19,172 INFO L226 Difference]: Without dead ends: 2036 [2019-12-27 16:45:19,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:45:19,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2019-12-27 16:45:19,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 1664. [2019-12-27 16:45:19,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1664 states. [2019-12-27 16:45:19,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 4070 transitions. [2019-12-27 16:45:19,223 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 4070 transitions. Word has length 14 [2019-12-27 16:45:19,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:19,224 INFO L462 AbstractCegarLoop]: Abstraction has 1664 states and 4070 transitions. [2019-12-27 16:45:19,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:45:19,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 4070 transitions. [2019-12-27 16:45:19,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 16:45:19,227 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:19,227 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] [2019-12-27 16:45:19,227 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:19,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:19,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1710596290, now seen corresponding path program 1 times [2019-12-27 16:45:19,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:19,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002475023] [2019-12-27 16:45:19,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:19,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:45:19,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002475023] [2019-12-27 16:45:19,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:19,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:45:19,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1670137214] [2019-12-27 16:45:19,297 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:19,302 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:19,317 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 86 transitions. [2019-12-27 16:45:19,317 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:19,332 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:45:19,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:45:19,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:19,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:45:19,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:45:19,334 INFO L87 Difference]: Start difference. First operand 1664 states and 4070 transitions. Second operand 5 states. [2019-12-27 16:45:19,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:19,372 INFO L93 Difference]: Finished difference Result 723 states and 1652 transitions. [2019-12-27 16:45:19,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:45:19,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 16:45:19,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:19,377 INFO L225 Difference]: With dead ends: 723 [2019-12-27 16:45:19,378 INFO L226 Difference]: Without dead ends: 723 [2019-12-27 16:45:19,378 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 16:45:19,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-12-27 16:45:19,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 703. [2019-12-27 16:45:19,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-12-27 16:45:19,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1612 transitions. [2019-12-27 16:45:19,399 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1612 transitions. Word has length 26 [2019-12-27 16:45:19,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:19,400 INFO L462 AbstractCegarLoop]: Abstraction has 703 states and 1612 transitions. [2019-12-27 16:45:19,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:45:19,400 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1612 transitions. [2019-12-27 16:45:19,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 16:45:19,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:19,402 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:19,403 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:19,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:19,403 INFO L82 PathProgramCache]: Analyzing trace with hash -310616313, now seen corresponding path program 1 times [2019-12-27 16:45:19,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:19,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778141552] [2019-12-27 16:45:19,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:19,530 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 16:45:19,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778141552] [2019-12-27 16:45:19,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:19,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:45:19,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1543317946] [2019-12-27 16:45:19,532 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:19,544 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:19,644 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 115 transitions. [2019-12-27 16:45:19,645 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:19,660 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:45:19,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:45:19,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:19,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:45:19,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:45:19,662 INFO L87 Difference]: Start difference. First operand 703 states and 1612 transitions. Second operand 5 states. [2019-12-27 16:45:19,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:19,689 INFO L93 Difference]: Finished difference Result 1112 states and 2596 transitions. [2019-12-27 16:45:19,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:45:19,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 16:45:19,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:19,692 INFO L225 Difference]: With dead ends: 1112 [2019-12-27 16:45:19,693 INFO L226 Difference]: Without dead ends: 428 [2019-12-27 16:45:19,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:45:19,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-12-27 16:45:19,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2019-12-27 16:45:19,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-12-27 16:45:19,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1015 transitions. [2019-12-27 16:45:19,709 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1015 transitions. Word has length 41 [2019-12-27 16:45:19,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:19,709 INFO L462 AbstractCegarLoop]: Abstraction has 428 states and 1015 transitions. [2019-12-27 16:45:19,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:45:19,709 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1015 transitions. [2019-12-27 16:45:19,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 16:45:19,711 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:19,712 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:19,712 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:19,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:19,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1541326249, now seen corresponding path program 2 times [2019-12-27 16:45:19,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:19,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656507663] [2019-12-27 16:45:19,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:19,816 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 16:45:19,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656507663] [2019-12-27 16:45:19,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:19,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:45:19,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [324053363] [2019-12-27 16:45:19,817 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:19,832 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:19,873 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 76 transitions. [2019-12-27 16:45:19,873 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:19,890 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:45:19,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:45:19,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:19,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:45:19,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:45:19,892 INFO L87 Difference]: Start difference. First operand 428 states and 1015 transitions. Second operand 7 states. [2019-12-27 16:45:20,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:20,083 INFO L93 Difference]: Finished difference Result 824 states and 1900 transitions. [2019-12-27 16:45:20,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 16:45:20,084 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 16:45:20,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:20,089 INFO L225 Difference]: With dead ends: 824 [2019-12-27 16:45:20,089 INFO L226 Difference]: Without dead ends: 536 [2019-12-27 16:45:20,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:45:20,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-12-27 16:45:20,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 476. [2019-12-27 16:45:20,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-12-27 16:45:20,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1097 transitions. [2019-12-27 16:45:20,104 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1097 transitions. Word has length 41 [2019-12-27 16:45:20,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:20,104 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 1097 transitions. [2019-12-27 16:45:20,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:45:20,104 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1097 transitions. [2019-12-27 16:45:20,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 16:45:20,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:20,106 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:20,107 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:20,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:20,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1953316183, now seen corresponding path program 3 times [2019-12-27 16:45:20,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:20,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770020289] [2019-12-27 16:45:20,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:20,249 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 16:45:20,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770020289] [2019-12-27 16:45:20,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:20,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:45:20,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1770489817] [2019-12-27 16:45:20,251 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:20,262 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:20,293 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 101 transitions. [2019-12-27 16:45:20,294 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:20,311 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:45:20,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:45:20,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:20,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:45:20,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:45:20,312 INFO L87 Difference]: Start difference. First operand 476 states and 1097 transitions. Second operand 6 states. [2019-12-27 16:45:20,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:20,736 INFO L93 Difference]: Finished difference Result 808 states and 1797 transitions. [2019-12-27 16:45:20,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:45:20,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 16:45:20,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:20,741 INFO L225 Difference]: With dead ends: 808 [2019-12-27 16:45:20,742 INFO L226 Difference]: Without dead ends: 796 [2019-12-27 16:45:20,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:45:20,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2019-12-27 16:45:20,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 753. [2019-12-27 16:45:20,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-12-27 16:45:20,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1693 transitions. [2019-12-27 16:45:20,761 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1693 transitions. Word has length 41 [2019-12-27 16:45:20,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:20,761 INFO L462 AbstractCegarLoop]: Abstraction has 753 states and 1693 transitions. [2019-12-27 16:45:20,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:45:20,761 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1693 transitions. [2019-12-27 16:45:20,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 16:45:20,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:20,764 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:20,764 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:20,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:20,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1269710711, now seen corresponding path program 4 times [2019-12-27 16:45:20,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:20,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468855983] [2019-12-27 16:45:20,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:20,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:45:20,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468855983] [2019-12-27 16:45:20,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:20,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:45:20,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2016624680] [2019-12-27 16:45:20,832 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:20,842 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:20,935 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 86 transitions. [2019-12-27 16:45:20,935 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:20,936 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:45:20,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:45:20,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:20,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:45:20,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:45:20,937 INFO L87 Difference]: Start difference. First operand 753 states and 1693 transitions. Second operand 3 states. [2019-12-27 16:45:20,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:20,950 INFO L93 Difference]: Finished difference Result 751 states and 1688 transitions. [2019-12-27 16:45:20,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:45:20,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 16:45:20,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:20,954 INFO L225 Difference]: With dead ends: 751 [2019-12-27 16:45:20,955 INFO L226 Difference]: Without dead ends: 751 [2019-12-27 16:45:20,955 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 16:45:20,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2019-12-27 16:45:20,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 695. [2019-12-27 16:45:20,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2019-12-27 16:45:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1581 transitions. [2019-12-27 16:45:20,972 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1581 transitions. Word has length 41 [2019-12-27 16:45:20,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:20,974 INFO L462 AbstractCegarLoop]: Abstraction has 695 states and 1581 transitions. [2019-12-27 16:45:20,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:45:20,974 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1581 transitions. [2019-12-27 16:45:20,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 16:45:20,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:20,976 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:20,977 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:20,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:20,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1106289564, now seen corresponding path program 1 times [2019-12-27 16:45:20,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:20,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593091144] [2019-12-27 16:45:20,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:45:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:45:21,066 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:45:21,066 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:45:21,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_96 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_280 0) (= v_~y$mem_tmp~0_16 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_66 0) (= |v_ULTIMATE.start_main_~#t843~0.offset_26| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_614 0) (= |v_#NULL.offset_3| 0) (= 0 v_~y$flush_delayed~0_46) (= v_~x~0_15 0) (= v_~y$r_buff1_thd0~0_156 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t843~0.base_37| 4)) (= v_~y$w_buff1_used~0_428 0) (= 0 v_~y$r_buff1_thd2~0_121) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t843~0.base_37| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t843~0.base_37|) |v_ULTIMATE.start_main_~#t843~0.offset_26| 0)) |v_#memory_int_15|) (= 0 v_~y$w_buff0~0_385) (= 0 v_~__unbuffered_p0_EAX~0_43) (= v_~main$tmp_guard1~0_39 0) (= v_~y~0_143 0) (= v_~a~0_73 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t843~0.base_37|)) (< 0 |v_#StackHeapBarrier_14|) (= v_~__unbuffered_p0_EBX~0_65 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~main$tmp_guard0~0_21 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t843~0.base_37|) (= 0 v_~y$r_buff0_thd2~0_193) (= v_~y$w_buff1~0_254 0) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_115 0) (= v_~y$r_buff1_thd1~0_232 0) (= 0 v_~__unbuffered_p1_EAX~0_96) (= v_~y$r_buff0_thd0~0_131 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t843~0.base_37| 1)) (= 0 v_~__unbuffered_cnt~0_84))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_614, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_~#t844~0.base=|v_ULTIMATE.start_main_~#t844~0.base_23|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_232, ~a~0=v_~a~0_73, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ULTIMATE.start_main_~#t843~0.base=|v_ULTIMATE.start_main_~#t843~0.base_37|, ~y$w_buff0~0=v_~y$w_buff0~0_385, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_280, ~y$flush_delayed~0=v_~y$flush_delayed~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_143, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_65, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_29|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_99|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_59|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_121, ULTIMATE.start_main_~#t844~0.offset=|v_ULTIMATE.start_main_~#t844~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_131, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_193, #memory_int=|v_#memory_int_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, ~z~0=v_~z~0_66, ULTIMATE.start_main_~#t843~0.offset=|v_ULTIMATE.start_main_~#t843~0.offset_26|, ~weak$$choice2~0=v_~weak$$choice2~0_115, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_156, ~x~0=v_~x~0_15, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_428} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t844~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t843~0.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t844~0.offset, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ULTIMATE.start_main_~#t843~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 16:45:21,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L810-1-->L812: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t844~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t844~0.base_12| 0)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t844~0.base_12| 1) |v_#valid_27|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t844~0.base_12|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t844~0.base_12| 4)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t844~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t844~0.base_12|) |v_ULTIMATE.start_main_~#t844~0.offset_10| 1))) (= 0 |v_ULTIMATE.start_main_~#t844~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t844~0.offset=|v_ULTIMATE.start_main_~#t844~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t844~0.base=|v_ULTIMATE.start_main_~#t844~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t844~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t844~0.base] because there is no mapped edge [2019-12-27 16:45:21,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L5-->L787: Formula: (and (= ~y$r_buff0_thd1~0_In249244933 ~y$r_buff1_thd1~0_Out249244933) (= ~y$r_buff0_thd2~0_In249244933 ~y$r_buff1_thd2~0_Out249244933) (not (= 0 P1Thread1of1ForFork1___VERIFIER_assert_~expression_In249244933)) (= ~z~0_Out249244933 ~__unbuffered_p1_EAX~0_Out249244933) (= ~z~0_Out249244933 1) (= ~y$r_buff0_thd0~0_In249244933 ~y$r_buff1_thd0~0_Out249244933) (= 1 ~y$r_buff0_thd2~0_Out249244933) (= ~__unbuffered_p1_EBX~0_Out249244933 ~a~0_In249244933)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In249244933, ~a~0=~a~0_In249244933, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In249244933, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In249244933, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In249244933} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out249244933, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In249244933, ~a~0=~a~0_In249244933, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out249244933, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out249244933, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out249244933, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In249244933, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out249244933, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In249244933, ~z~0=~z~0_Out249244933, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out249244933} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 16:45:21,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In676013440 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In676013440 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out676013440|)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out676013440| ~y$w_buff0_used~0_In676013440)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In676013440, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In676013440} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In676013440, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In676013440, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out676013440|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 16:45:21,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1478528051 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1478528051 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1478528051 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1478528051 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite29_Out-1478528051| ~y$w_buff1_used~0_In-1478528051)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-1478528051| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1478528051, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1478528051, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1478528051, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1478528051} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1478528051, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1478528051|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1478528051, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1478528051, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1478528051} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 16:45:21,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [594] [594] L751-->L752: Formula: (and (= v_~y$r_buff0_thd1~0_84 v_~y$r_buff0_thd1~0_83) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_9|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_11|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 16:45:21,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L752-->L752-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-299013996 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-299013996 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In-299013996 256) 0) .cse1) (and .cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-299013996 256))) (= 0 (mod ~y$w_buff0_used~0_In-299013996 256)))) (= |P0Thread1of1ForFork0_#t~ite23_Out-299013996| ~y$r_buff1_thd1~0_In-299013996) (= |P0Thread1of1ForFork0_#t~ite23_Out-299013996| |P0Thread1of1ForFork0_#t~ite24_Out-299013996|)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite24_Out-299013996| ~y$r_buff1_thd1~0_In-299013996) (= |P0Thread1of1ForFork0_#t~ite23_In-299013996| |P0Thread1of1ForFork0_#t~ite23_Out-299013996|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-299013996, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-299013996, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-299013996, ~weak$$choice2~0=~weak$$choice2~0_In-299013996, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-299013996, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In-299013996|} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-299013996, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-299013996, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-299013996, ~weak$$choice2~0=~weak$$choice2~0_In-299013996, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out-299013996|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out-299013996|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-299013996} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-27 16:45:21,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [627] [627] L754-->L762: Formula: (and (= 0 v_~y$flush_delayed~0_15) (= v_~y~0_40 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_23|, ~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-27 16:45:21,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L790-->L791: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-386097498 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-386097498 256)))) (or (and (not .cse0) (= ~y$r_buff0_thd2~0_Out-386097498 0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In-386097498 ~y$r_buff0_thd2~0_Out-386097498) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-386097498, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-386097498} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-386097498|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-386097498, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-386097498} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 16:45:21,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L791-->L791-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-377052188 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-377052188 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-377052188 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-377052188 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite31_Out-377052188|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$r_buff1_thd2~0_In-377052188 |P1Thread1of1ForFork1_#t~ite31_Out-377052188|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-377052188, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-377052188, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-377052188, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-377052188} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-377052188, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-377052188, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-377052188|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-377052188, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-377052188} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 16:45:21,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L791-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= |v_P1Thread1of1ForFork1_#t~ite31_30| v_~y$r_buff1_thd2~0_59)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_59, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 16:45:21,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] L812-1-->L818: Formula: (and (= 2 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:45:21,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L818-2-->L818-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1217646019 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1217646019 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-1217646019| ~y~0_In-1217646019)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-1217646019| ~y$w_buff1~0_In-1217646019)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1217646019, ~y~0=~y~0_In-1217646019, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1217646019, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1217646019} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1217646019, ~y~0=~y~0_In-1217646019, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1217646019, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1217646019|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1217646019} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 16:45:21,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [612] [612] L818-4-->L819: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite34_12|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~y~0=v_~y~0_31, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 16:45:21,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L819-->L819-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In57778335 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In57778335 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite36_Out57778335|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In57778335 |ULTIMATE.start_main_#t~ite36_Out57778335|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In57778335, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In57778335} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In57778335, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In57778335, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out57778335|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 16:45:21,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In160657366 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In160657366 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In160657366 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In160657366 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite37_Out160657366| 0)) (and (= ~y$w_buff1_used~0_In160657366 |ULTIMATE.start_main_#t~ite37_Out160657366|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In160657366, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In160657366, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In160657366, ~y$w_buff1_used~0=~y$w_buff1_used~0_In160657366} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In160657366, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In160657366, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out160657366|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In160657366, ~y$w_buff1_used~0=~y$w_buff1_used~0_In160657366} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 16:45:21,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1699010122 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1699010122 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out1699010122| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out1699010122| ~y$r_buff0_thd0~0_In1699010122)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1699010122, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1699010122} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1699010122, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1699010122, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1699010122|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 16:45:21,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-792734234 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-792734234 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-792734234 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-792734234 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-792734234 |ULTIMATE.start_main_#t~ite39_Out-792734234|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite39_Out-792734234|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-792734234, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-792734234, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-792734234, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-792734234} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-792734234, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-792734234|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-792734234, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-792734234, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-792734234} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 16:45:21,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p1_EBX~0_67 0) (= 1 v_~__unbuffered_p1_EAX~0_67) (= v_~__unbuffered_p0_EBX~0_37 0) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= 1 v_~__unbuffered_p0_EAX~0_21) (= v_~main$tmp_guard1~0_19 0) (= v_~y$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite39_42|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_123, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:45:21,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:45:21 BasicIcfg [2019-12-27 16:45:21,177 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:45:21,179 INFO L168 Benchmark]: Toolchain (without parser) took 12061.99 ms. Allocated memory was 143.7 MB in the beginning and 403.2 MB in the end (delta: 259.5 MB). Free memory was 99.8 MB in the beginning and 254.7 MB in the end (delta: -155.0 MB). Peak memory consumption was 104.6 MB. Max. memory is 7.1 GB. [2019-12-27 16:45:21,180 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 16:45:21,181 INFO L168 Benchmark]: CACSL2BoogieTranslator took 818.55 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 99.4 MB in the beginning and 155.8 MB in the end (delta: -56.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:45:21,182 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.15 ms. Allocated memory is still 201.3 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 16:45:21,184 INFO L168 Benchmark]: Boogie Preprocessor took 35.47 ms. Allocated memory is still 201.3 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:45:21,186 INFO L168 Benchmark]: RCFGBuilder took 778.14 ms. Allocated memory is still 201.3 MB. Free memory was 151.1 MB in the beginning and 109.6 MB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. [2019-12-27 16:45:21,186 INFO L168 Benchmark]: TraceAbstraction took 10362.75 ms. Allocated memory was 201.3 MB in the beginning and 403.2 MB in the end (delta: 201.9 MB). Free memory was 109.0 MB in the beginning and 254.7 MB in the end (delta: -145.8 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. [2019-12-27 16:45:21,195 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 818.55 ms. Allocated memory was 143.7 MB in the beginning and 201.3 MB in the end (delta: 57.7 MB). Free memory was 99.4 MB in the beginning and 155.8 MB in the end (delta: -56.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.15 ms. Allocated memory is still 201.3 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.47 ms. Allocated memory is still 201.3 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 778.14 ms. Allocated memory is still 201.3 MB. Free memory was 151.1 MB in the beginning and 109.6 MB in the end (delta: 41.4 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10362.75 ms. Allocated memory was 201.3 MB in the beginning and 403.2 MB in the end (delta: 201.9 MB). Free memory was 109.0 MB in the beginning and 254.7 MB in the end (delta: -145.8 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 139 ProgramPointsBefore, 67 ProgramPointsAfterwards, 167 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 20 ChoiceCompositions, 4461 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 36 SemBasedMoverChecksPositive, 178 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 44937 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t843, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t844, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L746] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L752] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L818] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 133 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.0s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1031 SDtfs, 807 SDslu, 1932 SDs, 0 SdLazy, 829 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6574occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 1199 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 238 ConstructedInterpolants, 0 QuantifiedInterpolants, 22022 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...