/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/safe011_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:12:55,794 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:12:55,797 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:12:55,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:12:55,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:12:55,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:12:55,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:12:55,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:12:55,834 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:12:55,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:12:55,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:12:55,841 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:12:55,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:12:55,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:12:55,845 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:12:55,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:12:55,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:12:55,849 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:12:55,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:12:55,855 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:12:55,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:12:55,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:12:55,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:12:55,867 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:12:55,869 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:12:55,870 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:12:55,870 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:12:55,872 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:12:55,873 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:12:55,874 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:12:55,874 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:12:55,875 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:12:55,876 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:12:55,877 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:12:55,878 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:12:55,878 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:12:55,879 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:12:55,879 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:12:55,879 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:12:55,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:12:55,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:12:55,882 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:12:55,909 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:12:55,910 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:12:55,913 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:12:55,913 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:12:55,913 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:12:55,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:12:55,915 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:12:55,915 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:12:55,915 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:12:55,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:12:55,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:12:55,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:12:55,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:12:55,916 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:12:55,916 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:12:55,917 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:12:55,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:12:55,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:12:55,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:12:55,919 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:12:55,919 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:12:55,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:12:55,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:12:55,920 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:12:55,924 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:12:55,924 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:12:55,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:12:55,924 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:12:55,925 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:12:55,925 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:12:55,925 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:12:56,207 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:12:56,227 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:12:56,231 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:12:56,232 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:12:56,233 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:12:56,234 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i [2019-12-27 18:12:56,296 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/324a8b719/49147a7afae54daba578a6970b54b540/FLAG1083092b4 [2019-12-27 18:12:56,829 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:12:56,830 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc.i [2019-12-27 18:12:56,853 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/324a8b719/49147a7afae54daba578a6970b54b540/FLAG1083092b4 [2019-12-27 18:12:57,131 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/324a8b719/49147a7afae54daba578a6970b54b540 [2019-12-27 18:12:57,141 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:12:57,146 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:12:57,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:12:57,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:12:57,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:12:57,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:12:57" (1/1) ... [2019-12-27 18:12:57,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691f4c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:57, skipping insertion in model container [2019-12-27 18:12:57,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:12:57" (1/1) ... [2019-12-27 18:12:57,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:12:57,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:12:57,799 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:12:57,813 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:12:57,884 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:12:57,963 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:12:57,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:57 WrapperNode [2019-12-27 18:12:57,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:12:57,965 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:12:57,965 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:12:57,965 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:12:57,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:57" (1/1) ... [2019-12-27 18:12:58,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:57" (1/1) ... [2019-12-27 18:12:58,036 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:12:58,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:12:58,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:12:58,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:12:58,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:57" (1/1) ... [2019-12-27 18:12:58,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:57" (1/1) ... [2019-12-27 18:12:58,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:57" (1/1) ... [2019-12-27 18:12:58,051 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:57" (1/1) ... [2019-12-27 18:12:58,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:57" (1/1) ... [2019-12-27 18:12:58,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:57" (1/1) ... [2019-12-27 18:12:58,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:57" (1/1) ... [2019-12-27 18:12:58,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:12:58,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:12:58,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:12:58,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:12:58,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:12:58,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:12:58,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:12:58,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:12:58,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:12:58,150 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:12:58,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:12:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:12:58,152 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:12:58,152 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:12:58,153 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:12:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:12:58,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:12:58,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:12:58,155 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 18:12:58,843 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:12:58,843 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:12:58,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:12:58 BoogieIcfgContainer [2019-12-27 18:12:58,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:12:58,846 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:12:58,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:12:58,850 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:12:58,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:12:57" (1/3) ... [2019-12-27 18:12:58,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21862abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:12:58, skipping insertion in model container [2019-12-27 18:12:58,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:12:57" (2/3) ... [2019-12-27 18:12:58,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21862abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:12:58, skipping insertion in model container [2019-12-27 18:12:58,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:12:58" (3/3) ... [2019-12-27 18:12:58,854 INFO L109 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc.i [2019-12-27 18:12:58,865 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:12:58,865 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:12:58,874 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:12:58,875 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:12:58,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,935 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,935 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,936 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,936 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,936 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,966 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,976 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,976 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,978 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,986 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,986 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,987 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,992 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,993 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,994 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:58,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,003 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,004 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,009 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,013 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,014 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,017 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,018 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:12:59,034 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:12:59,050 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:12:59,051 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:12:59,051 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:12:59,051 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:12:59,051 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:12:59,051 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:12:59,051 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:12:59,052 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:12:59,068 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 18:12:59,070 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 18:12:59,168 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 18:12:59,168 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:12:59,184 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 18:12:59,205 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 18:12:59,256 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 18:12:59,256 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:12:59,264 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 18:12:59,283 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-27 18:12:59,284 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:13:04,347 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 18:13:04,454 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 18:13:04,483 INFO L206 etLargeBlockEncoding]: Checked pairs total: 86146 [2019-12-27 18:13:04,483 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 18:13:04,487 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 104 transitions [2019-12-27 18:13:20,833 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104862 states. [2019-12-27 18:13:20,835 INFO L276 IsEmpty]: Start isEmpty. Operand 104862 states. [2019-12-27 18:13:20,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:13:20,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:13:20,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:13:20,841 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:13:20,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:13:20,846 INFO L82 PathProgramCache]: Analyzing trace with hash 844471, now seen corresponding path program 1 times [2019-12-27 18:13:20,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:13:20,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988995653] [2019-12-27 18:13:20,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:13:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:13:21,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:13:21,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988995653] [2019-12-27 18:13:21,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:13:21,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:13:21,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [741257998] [2019-12-27 18:13:21,067 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:13:21,072 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:13:21,084 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:13:21,085 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:13:21,088 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:13:21,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:13:21,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:13:21,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:13:21,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:13:21,106 INFO L87 Difference]: Start difference. First operand 104862 states. Second operand 3 states. [2019-12-27 18:13:21,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:13:21,967 INFO L93 Difference]: Finished difference Result 104560 states and 448162 transitions. [2019-12-27 18:13:21,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:13:21,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:13:21,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:13:25,376 INFO L225 Difference]: With dead ends: 104560 [2019-12-27 18:13:25,376 INFO L226 Difference]: Without dead ends: 102376 [2019-12-27 18:13:25,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:13:28,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102376 states. [2019-12-27 18:13:31,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102376 to 102376. [2019-12-27 18:13:31,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102376 states. [2019-12-27 18:13:31,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102376 states to 102376 states and 439244 transitions. [2019-12-27 18:13:31,718 INFO L78 Accepts]: Start accepts. Automaton has 102376 states and 439244 transitions. Word has length 3 [2019-12-27 18:13:31,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:13:31,719 INFO L462 AbstractCegarLoop]: Abstraction has 102376 states and 439244 transitions. [2019-12-27 18:13:31,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:13:31,719 INFO L276 IsEmpty]: Start isEmpty. Operand 102376 states and 439244 transitions. [2019-12-27 18:13:31,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:13:31,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:13:31,723 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:13:31,724 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:13:31,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:13:31,724 INFO L82 PathProgramCache]: Analyzing trace with hash 205437058, now seen corresponding path program 1 times [2019-12-27 18:13:31,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:13:31,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809945566] [2019-12-27 18:13:31,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:13:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:13:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:13:31,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809945566] [2019-12-27 18:13:31,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:13:31,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:13:31,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [943066606] [2019-12-27 18:13:31,848 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:13:31,850 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:13:31,852 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 18:13:31,853 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:13:31,853 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:13:31,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:13:31,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:13:31,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:13:31,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:13:31,855 INFO L87 Difference]: Start difference. First operand 102376 states and 439244 transitions. Second operand 4 states. [2019-12-27 18:13:36,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:13:36,422 INFO L93 Difference]: Finished difference Result 164490 states and 678436 transitions. [2019-12-27 18:13:36,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:13:36,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 18:13:36,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:13:37,688 INFO L225 Difference]: With dead ends: 164490 [2019-12-27 18:13:37,689 INFO L226 Difference]: Without dead ends: 164441 [2019-12-27 18:13:37,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:13:41,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164441 states. [2019-12-27 18:13:49,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164441 to 148513. [2019-12-27 18:13:49,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148513 states. [2019-12-27 18:13:49,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148513 states to 148513 states and 619831 transitions. [2019-12-27 18:13:49,540 INFO L78 Accepts]: Start accepts. Automaton has 148513 states and 619831 transitions. Word has length 11 [2019-12-27 18:13:49,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:13:49,541 INFO L462 AbstractCegarLoop]: Abstraction has 148513 states and 619831 transitions. [2019-12-27 18:13:49,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:13:49,541 INFO L276 IsEmpty]: Start isEmpty. Operand 148513 states and 619831 transitions. [2019-12-27 18:13:49,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:13:49,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:13:49,546 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:13:49,547 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:13:49,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:13:49,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1045519438, now seen corresponding path program 1 times [2019-12-27 18:13:49,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:13:49,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321733962] [2019-12-27 18:13:49,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:13:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:13:49,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:13:49,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321733962] [2019-12-27 18:13:49,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:13:49,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:13:49,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1943286270] [2019-12-27 18:13:49,660 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:13:49,661 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:13:49,663 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:13:49,663 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:13:49,663 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:13:49,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:13:49,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:13:49,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:13:49,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:13:49,665 INFO L87 Difference]: Start difference. First operand 148513 states and 619831 transitions. Second operand 4 states. [2019-12-27 18:13:52,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:13:52,423 INFO L93 Difference]: Finished difference Result 211896 states and 864765 transitions. [2019-12-27 18:13:52,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:13:52,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:13:52,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:13:59,699 INFO L225 Difference]: With dead ends: 211896 [2019-12-27 18:13:59,700 INFO L226 Difference]: Without dead ends: 211833 [2019-12-27 18:13:59,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:14:03,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211833 states. [2019-12-27 18:14:07,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211833 to 178183. [2019-12-27 18:14:07,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178183 states. [2019-12-27 18:14:08,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178183 states to 178183 states and 738846 transitions. [2019-12-27 18:14:08,894 INFO L78 Accepts]: Start accepts. Automaton has 178183 states and 738846 transitions. Word has length 13 [2019-12-27 18:14:08,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:08,895 INFO L462 AbstractCegarLoop]: Abstraction has 178183 states and 738846 transitions. [2019-12-27 18:14:08,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:14:08,896 INFO L276 IsEmpty]: Start isEmpty. Operand 178183 states and 738846 transitions. [2019-12-27 18:14:08,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:14:08,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:08,899 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:08,900 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:08,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:08,900 INFO L82 PathProgramCache]: Analyzing trace with hash 31849685, now seen corresponding path program 1 times [2019-12-27 18:14:08,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:08,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464224009] [2019-12-27 18:14:08,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:08,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:08,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464224009] [2019-12-27 18:14:08,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:08,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:14:08,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [388917200] [2019-12-27 18:14:08,957 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:08,959 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:08,960 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:14:08,961 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:08,962 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:08,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:14:08,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:08,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:14:08,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:08,963 INFO L87 Difference]: Start difference. First operand 178183 states and 738846 transitions. Second operand 3 states. [2019-12-27 18:14:09,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:09,121 INFO L93 Difference]: Finished difference Result 36088 states and 117391 transitions. [2019-12-27 18:14:09,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:14:09,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 18:14:09,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:09,183 INFO L225 Difference]: With dead ends: 36088 [2019-12-27 18:14:09,183 INFO L226 Difference]: Without dead ends: 36088 [2019-12-27 18:14:09,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:09,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36088 states. [2019-12-27 18:14:09,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36088 to 36088. [2019-12-27 18:14:09,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36088 states. [2019-12-27 18:14:09,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36088 states to 36088 states and 117391 transitions. [2019-12-27 18:14:09,871 INFO L78 Accepts]: Start accepts. Automaton has 36088 states and 117391 transitions. Word has length 13 [2019-12-27 18:14:09,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:09,871 INFO L462 AbstractCegarLoop]: Abstraction has 36088 states and 117391 transitions. [2019-12-27 18:14:09,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:14:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 36088 states and 117391 transitions. [2019-12-27 18:14:09,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:14:09,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:09,875 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:09,876 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:09,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:09,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1539749953, now seen corresponding path program 1 times [2019-12-27 18:14:09,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:09,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630712747] [2019-12-27 18:14:09,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:10,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:10,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630712747] [2019-12-27 18:14:10,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:10,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:14:10,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [364584022] [2019-12-27 18:14:10,042 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:10,045 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:10,048 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 29 transitions. [2019-12-27 18:14:10,049 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:10,050 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:10,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:14:10,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:10,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:14:10,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:14:10,051 INFO L87 Difference]: Start difference. First operand 36088 states and 117391 transitions. Second operand 5 states. [2019-12-27 18:14:10,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:10,861 INFO L93 Difference]: Finished difference Result 49088 states and 156546 transitions. [2019-12-27 18:14:10,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 18:14:10,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 18:14:10,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:10,937 INFO L225 Difference]: With dead ends: 49088 [2019-12-27 18:14:10,937 INFO L226 Difference]: Without dead ends: 49075 [2019-12-27 18:14:10,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:14:11,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49075 states. [2019-12-27 18:14:12,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49075 to 36431. [2019-12-27 18:14:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36431 states. [2019-12-27 18:14:12,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36431 states to 36431 states and 118357 transitions. [2019-12-27 18:14:12,136 INFO L78 Accepts]: Start accepts. Automaton has 36431 states and 118357 transitions. Word has length 19 [2019-12-27 18:14:12,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:12,137 INFO L462 AbstractCegarLoop]: Abstraction has 36431 states and 118357 transitions. [2019-12-27 18:14:12,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:14:12,137 INFO L276 IsEmpty]: Start isEmpty. Operand 36431 states and 118357 transitions. [2019-12-27 18:14:12,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:14:12,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:12,150 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:12,150 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:12,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:12,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1129453691, now seen corresponding path program 1 times [2019-12-27 18:14:12,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:12,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568136338] [2019-12-27 18:14:12,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:12,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568136338] [2019-12-27 18:14:12,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:12,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:14:12,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [529255504] [2019-12-27 18:14:12,214 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:12,217 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:12,222 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:14:12,222 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:12,223 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:12,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:14:12,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:12,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:14:12,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:14:12,224 INFO L87 Difference]: Start difference. First operand 36431 states and 118357 transitions. Second operand 4 states. [2019-12-27 18:14:12,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:12,266 INFO L93 Difference]: Finished difference Result 7050 states and 19283 transitions. [2019-12-27 18:14:12,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:14:12,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 18:14:12,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:12,276 INFO L225 Difference]: With dead ends: 7050 [2019-12-27 18:14:12,276 INFO L226 Difference]: Without dead ends: 7050 [2019-12-27 18:14:12,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:14:12,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2019-12-27 18:14:12,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6938. [2019-12-27 18:14:12,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6938 states. [2019-12-27 18:14:12,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6938 states to 6938 states and 18963 transitions. [2019-12-27 18:14:12,367 INFO L78 Accepts]: Start accepts. Automaton has 6938 states and 18963 transitions. Word has length 25 [2019-12-27 18:14:12,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:12,367 INFO L462 AbstractCegarLoop]: Abstraction has 6938 states and 18963 transitions. [2019-12-27 18:14:12,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:14:12,367 INFO L276 IsEmpty]: Start isEmpty. Operand 6938 states and 18963 transitions. [2019-12-27 18:14:12,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 18:14:12,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:12,378 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:12,378 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:12,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:12,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1811341367, now seen corresponding path program 1 times [2019-12-27 18:14:12,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:12,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861540416] [2019-12-27 18:14:12,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:12,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:12,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861540416] [2019-12-27 18:14:12,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:12,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:14:12,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [966566387] [2019-12-27 18:14:12,490 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:12,498 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:12,530 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 107 transitions. [2019-12-27 18:14:12,530 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:12,534 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:14:12,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:14:12,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:12,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:14:12,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:14:12,535 INFO L87 Difference]: Start difference. First operand 6938 states and 18963 transitions. Second operand 5 states. [2019-12-27 18:14:12,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:12,573 INFO L93 Difference]: Finished difference Result 5023 states and 14421 transitions. [2019-12-27 18:14:12,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:14:12,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 18:14:12,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:12,582 INFO L225 Difference]: With dead ends: 5023 [2019-12-27 18:14:12,582 INFO L226 Difference]: Without dead ends: 5023 [2019-12-27 18:14:12,583 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 18:14:12,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2019-12-27 18:14:12,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 4659. [2019-12-27 18:14:12,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4659 states. [2019-12-27 18:14:12,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4659 states to 4659 states and 13437 transitions. [2019-12-27 18:14:12,664 INFO L78 Accepts]: Start accepts. Automaton has 4659 states and 13437 transitions. Word has length 37 [2019-12-27 18:14:12,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:12,664 INFO L462 AbstractCegarLoop]: Abstraction has 4659 states and 13437 transitions. [2019-12-27 18:14:12,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:14:12,664 INFO L276 IsEmpty]: Start isEmpty. Operand 4659 states and 13437 transitions. [2019-12-27 18:14:12,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:14:12,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:12,671 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:12,672 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:12,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:12,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1876753934, now seen corresponding path program 1 times [2019-12-27 18:14:12,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:12,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434067520] [2019-12-27 18:14:12,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:12,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:12,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434067520] [2019-12-27 18:14:12,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:12,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:14:12,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2095150053] [2019-12-27 18:14:12,747 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:12,768 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:12,962 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 445 transitions. [2019-12-27 18:14:12,963 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:12,964 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:12,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:14:12,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:12,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:14:12,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:12,966 INFO L87 Difference]: Start difference. First operand 4659 states and 13437 transitions. Second operand 3 states. [2019-12-27 18:14:13,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:13,033 INFO L93 Difference]: Finished difference Result 4668 states and 13449 transitions. [2019-12-27 18:14:13,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:14:13,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 18:14:13,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:13,045 INFO L225 Difference]: With dead ends: 4668 [2019-12-27 18:14:13,045 INFO L226 Difference]: Without dead ends: 4668 [2019-12-27 18:14:13,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:13,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2019-12-27 18:14:13,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4664. [2019-12-27 18:14:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2019-12-27 18:14:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 13445 transitions. [2019-12-27 18:14:13,108 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 13445 transitions. Word has length 65 [2019-12-27 18:14:13,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:13,108 INFO L462 AbstractCegarLoop]: Abstraction has 4664 states and 13445 transitions. [2019-12-27 18:14:13,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:14:13,108 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 13445 transitions. [2019-12-27 18:14:13,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:14:13,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:13,115 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:13,115 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:13,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:13,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1173172274, now seen corresponding path program 1 times [2019-12-27 18:14:13,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:13,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154362152] [2019-12-27 18:14:13,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:13,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:13,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154362152] [2019-12-27 18:14:13,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:13,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:14:13,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [52055730] [2019-12-27 18:14:13,180 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:13,201 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:13,423 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 445 transitions. [2019-12-27 18:14:13,424 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:13,425 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:13,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:14:13,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:13,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:14:13,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:13,426 INFO L87 Difference]: Start difference. First operand 4664 states and 13445 transitions. Second operand 3 states. [2019-12-27 18:14:13,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:13,661 INFO L93 Difference]: Finished difference Result 4668 states and 13441 transitions. [2019-12-27 18:14:13,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:14:13,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 18:14:13,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:13,668 INFO L225 Difference]: With dead ends: 4668 [2019-12-27 18:14:13,668 INFO L226 Difference]: Without dead ends: 4668 [2019-12-27 18:14:13,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:13,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2019-12-27 18:14:13,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4664. [2019-12-27 18:14:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2019-12-27 18:14:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 13437 transitions. [2019-12-27 18:14:13,744 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 13437 transitions. Word has length 65 [2019-12-27 18:14:13,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:13,744 INFO L462 AbstractCegarLoop]: Abstraction has 4664 states and 13437 transitions. [2019-12-27 18:14:13,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:14:13,744 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 13437 transitions. [2019-12-27 18:14:13,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:14:13,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:13,751 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:13,751 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:13,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:13,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1163492121, now seen corresponding path program 1 times [2019-12-27 18:14:13,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:13,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808312346] [2019-12-27 18:14:13,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:13,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:13,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808312346] [2019-12-27 18:14:13,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:13,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:14:13,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1841844304] [2019-12-27 18:14:13,857 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:13,876 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:14,046 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 445 transitions. [2019-12-27 18:14:14,046 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:14,244 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 18:14:14,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 18:14:14,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:14,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 18:14:14,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:14:14,245 INFO L87 Difference]: Start difference. First operand 4664 states and 13437 transitions. Second operand 10 states. [2019-12-27 18:14:14,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:14,905 INFO L93 Difference]: Finished difference Result 7088 states and 20226 transitions. [2019-12-27 18:14:14,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:14:14,905 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 18:14:14,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:14,915 INFO L225 Difference]: With dead ends: 7088 [2019-12-27 18:14:14,915 INFO L226 Difference]: Without dead ends: 7088 [2019-12-27 18:14:14,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:14:14,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7088 states. [2019-12-27 18:14:14,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7088 to 5979. [2019-12-27 18:14:15,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5979 states. [2019-12-27 18:14:15,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5979 states to 5979 states and 17231 transitions. [2019-12-27 18:14:15,009 INFO L78 Accepts]: Start accepts. Automaton has 5979 states and 17231 transitions. Word has length 65 [2019-12-27 18:14:15,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:15,010 INFO L462 AbstractCegarLoop]: Abstraction has 5979 states and 17231 transitions. [2019-12-27 18:14:15,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 18:14:15,010 INFO L276 IsEmpty]: Start isEmpty. Operand 5979 states and 17231 transitions. [2019-12-27 18:14:15,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:14:15,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:15,021 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:15,022 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:15,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:15,022 INFO L82 PathProgramCache]: Analyzing trace with hash -2061317327, now seen corresponding path program 2 times [2019-12-27 18:14:15,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:15,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21358015] [2019-12-27 18:14:15,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:15,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:15,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21358015] [2019-12-27 18:14:15,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:15,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:14:15,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1786940037] [2019-12-27 18:14:15,119 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:15,154 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:15,297 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 232 states and 448 transitions. [2019-12-27 18:14:15,297 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:15,347 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 18:14:15,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:14:15,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:15,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:14:15,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:14:15,348 INFO L87 Difference]: Start difference. First operand 5979 states and 17231 transitions. Second operand 5 states. [2019-12-27 18:14:15,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:15,669 INFO L93 Difference]: Finished difference Result 9067 states and 25836 transitions. [2019-12-27 18:14:15,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:14:15,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 18:14:15,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:15,682 INFO L225 Difference]: With dead ends: 9067 [2019-12-27 18:14:15,683 INFO L226 Difference]: Without dead ends: 9067 [2019-12-27 18:14:15,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 8 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:14:15,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9067 states. [2019-12-27 18:14:15,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9067 to 6731. [2019-12-27 18:14:15,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6731 states. [2019-12-27 18:14:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6731 states to 6731 states and 19498 transitions. [2019-12-27 18:14:15,790 INFO L78 Accepts]: Start accepts. Automaton has 6731 states and 19498 transitions. Word has length 65 [2019-12-27 18:14:15,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:15,790 INFO L462 AbstractCegarLoop]: Abstraction has 6731 states and 19498 transitions. [2019-12-27 18:14:15,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:14:15,791 INFO L276 IsEmpty]: Start isEmpty. Operand 6731 states and 19498 transitions. [2019-12-27 18:14:15,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:14:15,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:15,800 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:15,800 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:15,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:15,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1650424373, now seen corresponding path program 3 times [2019-12-27 18:14:15,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:15,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557623333] [2019-12-27 18:14:15,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:15,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:15,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557623333] [2019-12-27 18:14:15,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:15,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:14:15,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [943883777] [2019-12-27 18:14:15,885 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:15,904 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:16,053 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 206 states and 364 transitions. [2019-12-27 18:14:16,053 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:16,151 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 18:14:16,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:14:16,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:16,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:14:16,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:14:16,152 INFO L87 Difference]: Start difference. First operand 6731 states and 19498 transitions. Second operand 11 states. [2019-12-27 18:14:17,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:17,886 INFO L93 Difference]: Finished difference Result 16480 states and 46651 transitions. [2019-12-27 18:14:17,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 18:14:17,887 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 18:14:17,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:17,909 INFO L225 Difference]: With dead ends: 16480 [2019-12-27 18:14:17,909 INFO L226 Difference]: Without dead ends: 16480 [2019-12-27 18:14:17,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2019-12-27 18:14:17,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16480 states. [2019-12-27 18:14:18,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16480 to 7280. [2019-12-27 18:14:18,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7280 states. [2019-12-27 18:14:18,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7280 states to 7280 states and 21177 transitions. [2019-12-27 18:14:18,091 INFO L78 Accepts]: Start accepts. Automaton has 7280 states and 21177 transitions. Word has length 65 [2019-12-27 18:14:18,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:18,091 INFO L462 AbstractCegarLoop]: Abstraction has 7280 states and 21177 transitions. [2019-12-27 18:14:18,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:14:18,091 INFO L276 IsEmpty]: Start isEmpty. Operand 7280 states and 21177 transitions. [2019-12-27 18:14:18,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:14:18,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:18,102 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:18,102 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:18,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:18,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2063456247, now seen corresponding path program 4 times [2019-12-27 18:14:18,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:18,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074091018] [2019-12-27 18:14:18,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:18,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:18,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074091018] [2019-12-27 18:14:18,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:18,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:14:18,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [783646625] [2019-12-27 18:14:18,190 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:18,208 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:18,436 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 231 states and 438 transitions. [2019-12-27 18:14:18,437 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:18,438 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:18,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:14:18,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:18,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:14:18,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:18,440 INFO L87 Difference]: Start difference. First operand 7280 states and 21177 transitions. Second operand 3 states. [2019-12-27 18:14:18,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:18,533 INFO L93 Difference]: Finished difference Result 7280 states and 21176 transitions. [2019-12-27 18:14:18,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:14:18,533 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 18:14:18,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:18,548 INFO L225 Difference]: With dead ends: 7280 [2019-12-27 18:14:18,549 INFO L226 Difference]: Without dead ends: 7280 [2019-12-27 18:14:18,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:18,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7280 states. [2019-12-27 18:14:18,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7280 to 4655. [2019-12-27 18:14:18,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4655 states. [2019-12-27 18:14:18,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4655 states to 4655 states and 13797 transitions. [2019-12-27 18:14:18,680 INFO L78 Accepts]: Start accepts. Automaton has 4655 states and 13797 transitions. Word has length 65 [2019-12-27 18:14:18,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:18,680 INFO L462 AbstractCegarLoop]: Abstraction has 4655 states and 13797 transitions. [2019-12-27 18:14:18,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:14:18,681 INFO L276 IsEmpty]: Start isEmpty. Operand 4655 states and 13797 transitions. [2019-12-27 18:14:18,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 18:14:18,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:18,690 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:18,690 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:18,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:18,690 INFO L82 PathProgramCache]: Analyzing trace with hash -68576263, now seen corresponding path program 1 times [2019-12-27 18:14:18,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:18,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360585846] [2019-12-27 18:14:18,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:18,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:18,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360585846] [2019-12-27 18:14:18,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:18,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:14:18,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1372937509] [2019-12-27 18:14:18,768 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:18,789 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:18,943 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 233 states and 449 transitions. [2019-12-27 18:14:18,944 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:18,960 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:14:18,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:14:18,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:18,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:14:18,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:14:18,961 INFO L87 Difference]: Start difference. First operand 4655 states and 13797 transitions. Second operand 5 states. [2019-12-27 18:14:19,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:19,160 INFO L93 Difference]: Finished difference Result 5651 states and 16119 transitions. [2019-12-27 18:14:19,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:14:19,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 18:14:19,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:19,169 INFO L225 Difference]: With dead ends: 5651 [2019-12-27 18:14:19,169 INFO L226 Difference]: Without dead ends: 5651 [2019-12-27 18:14:19,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:14:19,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5651 states. [2019-12-27 18:14:19,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5651 to 3559. [2019-12-27 18:14:19,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3559 states. [2019-12-27 18:14:19,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3559 states to 3559 states and 10346 transitions. [2019-12-27 18:14:19,228 INFO L78 Accepts]: Start accepts. Automaton has 3559 states and 10346 transitions. Word has length 66 [2019-12-27 18:14:19,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:19,228 INFO L462 AbstractCegarLoop]: Abstraction has 3559 states and 10346 transitions. [2019-12-27 18:14:19,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:14:19,228 INFO L276 IsEmpty]: Start isEmpty. Operand 3559 states and 10346 transitions. [2019-12-27 18:14:19,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:14:19,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:19,233 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:19,233 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:19,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:19,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1891252769, now seen corresponding path program 1 times [2019-12-27 18:14:19,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:19,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035108337] [2019-12-27 18:14:19,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:19,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:19,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:19,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035108337] [2019-12-27 18:14:19,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:19,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:14:19,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1349333231] [2019-12-27 18:14:19,337 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:19,355 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:19,780 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 416 transitions. [2019-12-27 18:14:19,780 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:19,942 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 18:14:19,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:14:19,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:19,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:14:19,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:14:19,943 INFO L87 Difference]: Start difference. First operand 3559 states and 10346 transitions. Second operand 11 states. [2019-12-27 18:14:20,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:20,972 INFO L93 Difference]: Finished difference Result 6089 states and 17305 transitions. [2019-12-27 18:14:20,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 18:14:20,973 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 18:14:20,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:20,982 INFO L225 Difference]: With dead ends: 6089 [2019-12-27 18:14:20,982 INFO L226 Difference]: Without dead ends: 6089 [2019-12-27 18:14:20,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2019-12-27 18:14:21,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6089 states. [2019-12-27 18:14:21,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6089 to 3559. [2019-12-27 18:14:21,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3559 states. [2019-12-27 18:14:21,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3559 states to 3559 states and 10346 transitions. [2019-12-27 18:14:21,049 INFO L78 Accepts]: Start accepts. Automaton has 3559 states and 10346 transitions. Word has length 67 [2019-12-27 18:14:21,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:21,050 INFO L462 AbstractCegarLoop]: Abstraction has 3559 states and 10346 transitions. [2019-12-27 18:14:21,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:14:21,050 INFO L276 IsEmpty]: Start isEmpty. Operand 3559 states and 10346 transitions. [2019-12-27 18:14:21,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:14:21,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:21,055 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:21,055 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:21,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:21,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1781723931, now seen corresponding path program 2 times [2019-12-27 18:14:21,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:21,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691118975] [2019-12-27 18:14:21,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:21,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:21,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691118975] [2019-12-27 18:14:21,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:21,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:14:21,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1431758627] [2019-12-27 18:14:21,125 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:21,139 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:21,318 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 240 states and 455 transitions. [2019-12-27 18:14:21,319 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:21,323 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:14:21,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:14:21,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:21,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:14:21,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:21,324 INFO L87 Difference]: Start difference. First operand 3559 states and 10346 transitions. Second operand 3 states. [2019-12-27 18:14:21,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:21,347 INFO L93 Difference]: Finished difference Result 3383 states and 9557 transitions. [2019-12-27 18:14:21,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:14:21,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 18:14:21,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:21,352 INFO L225 Difference]: With dead ends: 3383 [2019-12-27 18:14:21,352 INFO L226 Difference]: Without dead ends: 3383 [2019-12-27 18:14:21,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:21,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3383 states. [2019-12-27 18:14:21,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3383 to 2987. [2019-12-27 18:14:21,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2987 states. [2019-12-27 18:14:21,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2987 states to 2987 states and 8451 transitions. [2019-12-27 18:14:21,397 INFO L78 Accepts]: Start accepts. Automaton has 2987 states and 8451 transitions. Word has length 67 [2019-12-27 18:14:21,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:21,397 INFO L462 AbstractCegarLoop]: Abstraction has 2987 states and 8451 transitions. [2019-12-27 18:14:21,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:14:21,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2987 states and 8451 transitions. [2019-12-27 18:14:21,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:14:21,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:21,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:21,402 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:21,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:21,403 INFO L82 PathProgramCache]: Analyzing trace with hash 823194101, now seen corresponding path program 1 times [2019-12-27 18:14:21,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:21,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833043672] [2019-12-27 18:14:21,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:21,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833043672] [2019-12-27 18:14:21,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:21,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:14:21,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1377850006] [2019-12-27 18:14:21,526 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:21,541 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:21,814 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 231 states and 435 transitions. [2019-12-27 18:14:21,814 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:21,837 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:14:21,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:14:21,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:21,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:14:21,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:14:21,839 INFO L87 Difference]: Start difference. First operand 2987 states and 8451 transitions. Second operand 7 states. [2019-12-27 18:14:21,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:21,988 INFO L93 Difference]: Finished difference Result 6098 states and 17352 transitions. [2019-12-27 18:14:21,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:14:21,989 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-27 18:14:21,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:21,997 INFO L225 Difference]: With dead ends: 6098 [2019-12-27 18:14:21,997 INFO L226 Difference]: Without dead ends: 3695 [2019-12-27 18:14:21,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:14:22,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3695 states. [2019-12-27 18:14:22,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3695 to 2815. [2019-12-27 18:14:22,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2815 states. [2019-12-27 18:14:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 7936 transitions. [2019-12-27 18:14:22,090 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 7936 transitions. Word has length 68 [2019-12-27 18:14:22,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:22,090 INFO L462 AbstractCegarLoop]: Abstraction has 2815 states and 7936 transitions. [2019-12-27 18:14:22,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:14:22,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 7936 transitions. [2019-12-27 18:14:22,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:14:22,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:22,097 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:22,097 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:22,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:22,097 INFO L82 PathProgramCache]: Analyzing trace with hash -829052917, now seen corresponding path program 2 times [2019-12-27 18:14:22,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:22,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383179342] [2019-12-27 18:14:22,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:22,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:22,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383179342] [2019-12-27 18:14:22,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:22,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 18:14:22,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [139130238] [2019-12-27 18:14:22,469 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:22,485 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:22,834 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 223 states and 421 transitions. [2019-12-27 18:14:22,834 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:22,942 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 18:14:22,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 18:14:22,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:22,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 18:14:22,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:14:22,943 INFO L87 Difference]: Start difference. First operand 2815 states and 7936 transitions. Second operand 15 states. [2019-12-27 18:14:23,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:23,988 INFO L93 Difference]: Finished difference Result 6367 states and 17837 transitions. [2019-12-27 18:14:23,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 18:14:23,989 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2019-12-27 18:14:23,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:23,998 INFO L225 Difference]: With dead ends: 6367 [2019-12-27 18:14:23,999 INFO L226 Difference]: Without dead ends: 6337 [2019-12-27 18:14:23,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2019-12-27 18:14:24,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6337 states. [2019-12-27 18:14:24,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6337 to 4326. [2019-12-27 18:14:24,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4326 states. [2019-12-27 18:14:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4326 states to 4326 states and 12163 transitions. [2019-12-27 18:14:24,070 INFO L78 Accepts]: Start accepts. Automaton has 4326 states and 12163 transitions. Word has length 68 [2019-12-27 18:14:24,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:24,070 INFO L462 AbstractCegarLoop]: Abstraction has 4326 states and 12163 transitions. [2019-12-27 18:14:24,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 18:14:24,070 INFO L276 IsEmpty]: Start isEmpty. Operand 4326 states and 12163 transitions. [2019-12-27 18:14:24,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:14:24,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:24,075 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:24,075 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:24,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:24,075 INFO L82 PathProgramCache]: Analyzing trace with hash 226058755, now seen corresponding path program 3 times [2019-12-27 18:14:24,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:24,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968244461] [2019-12-27 18:14:24,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:24,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:24,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968244461] [2019-12-27 18:14:24,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:24,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 18:14:24,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [270470692] [2019-12-27 18:14:24,321 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:24,337 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:24,546 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 271 states and 531 transitions. [2019-12-27 18:14:24,547 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:24,632 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 18:14:24,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 18:14:24,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:24,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 18:14:24,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-27 18:14:24,633 INFO L87 Difference]: Start difference. First operand 4326 states and 12163 transitions. Second operand 14 states. [2019-12-27 18:14:25,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:25,191 INFO L93 Difference]: Finished difference Result 7765 states and 21961 transitions. [2019-12-27 18:14:25,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 18:14:25,191 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-27 18:14:25,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:25,203 INFO L225 Difference]: With dead ends: 7765 [2019-12-27 18:14:25,203 INFO L226 Difference]: Without dead ends: 7735 [2019-12-27 18:14:25,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2019-12-27 18:14:25,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7735 states. [2019-12-27 18:14:25,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7735 to 4653. [2019-12-27 18:14:25,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4653 states. [2019-12-27 18:14:25,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4653 states to 4653 states and 13102 transitions. [2019-12-27 18:14:25,282 INFO L78 Accepts]: Start accepts. Automaton has 4653 states and 13102 transitions. Word has length 68 [2019-12-27 18:14:25,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:25,282 INFO L462 AbstractCegarLoop]: Abstraction has 4653 states and 13102 transitions. [2019-12-27 18:14:25,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 18:14:25,282 INFO L276 IsEmpty]: Start isEmpty. Operand 4653 states and 13102 transitions. [2019-12-27 18:14:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:14:25,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:25,287 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:25,287 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:25,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:25,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1101405001, now seen corresponding path program 4 times [2019-12-27 18:14:25,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:25,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019669222] [2019-12-27 18:14:25,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:25,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:25,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019669222] [2019-12-27 18:14:25,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:25,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 18:14:25,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [11976150] [2019-12-27 18:14:25,561 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:25,575 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:25,806 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 256 states and 497 transitions. [2019-12-27 18:14:25,806 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:26,148 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 18:14:26,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 18:14:26,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:26,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 18:14:26,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-12-27 18:14:26,150 INFO L87 Difference]: Start difference. First operand 4653 states and 13102 transitions. Second operand 19 states. [2019-12-27 18:14:27,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:27,799 INFO L93 Difference]: Finished difference Result 6574 states and 18304 transitions. [2019-12-27 18:14:27,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 18:14:27,799 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2019-12-27 18:14:27,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:27,811 INFO L225 Difference]: With dead ends: 6574 [2019-12-27 18:14:27,812 INFO L226 Difference]: Without dead ends: 6544 [2019-12-27 18:14:27,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 9 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=365, Invalid=1275, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 18:14:27,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6544 states. [2019-12-27 18:14:27,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6544 to 4067. [2019-12-27 18:14:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4067 states. [2019-12-27 18:14:27,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4067 states to 4067 states and 11322 transitions. [2019-12-27 18:14:27,938 INFO L78 Accepts]: Start accepts. Automaton has 4067 states and 11322 transitions. Word has length 68 [2019-12-27 18:14:27,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:27,938 INFO L462 AbstractCegarLoop]: Abstraction has 4067 states and 11322 transitions. [2019-12-27 18:14:27,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 18:14:27,939 INFO L276 IsEmpty]: Start isEmpty. Operand 4067 states and 11322 transitions. [2019-12-27 18:14:27,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:14:27,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:27,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:27,947 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:27,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:27,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1851838847, now seen corresponding path program 5 times [2019-12-27 18:14:27,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:27,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342449240] [2019-12-27 18:14:27,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:14:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:14:28,148 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:14:28,148 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:14:28,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2025~0.base_21| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2025~0.base_21|) |v_ULTIMATE.start_main_~#t2025~0.offset_17| 0)) |v_#memory_int_21|) (= v_~__unbuffered_cnt~0_140 0) (= 0 v_~z$flush_delayed~0_34) (= v_~z$r_buff1_thd0~0_308 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2025~0.base_21|) (= v_~z$w_buff1_used~0_516 0) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t2025~0.base_21| 1)) (= v_~z$r_buff1_thd1~0_190 0) (= 0 |v_ULTIMATE.start_main_~#t2025~0.offset_17|) (= v_~z$read_delayed~0_8 0) (= v_~z$w_buff0~0_342 0) (= v_~main$tmp_guard1~0_21 0) (= v_~z$read_delayed_var~0.offset_7 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t2025~0.base_21| 4) |v_#length_25|) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_206 0) (= v_~y~0_34 0) (= 0 |v_#NULL.base_4|) (= 0 v_~z$r_buff0_thd3~0_140) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$r_buff0_thd1~0_226 0) (= v_~main$tmp_guard0~0_21 0) (= v_~weak$$choice2~0_109 0) (= v_~z$mem_tmp~0_19 0) (= v_~z$r_buff0_thd0~0_374 0) (= |v_#NULL.offset_4| 0) (= 0 v_~z$r_buff1_thd3~0_196) (= v_~z$r_buff0_thd2~0_140 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2025~0.base_21|) 0) (= 0 v_~__unbuffered_p2_EAX~0_36) (= v_~z$w_buff0_used~0_875 0) (= 0 v_~weak$$choice0~0_13) (= v_~z$w_buff1~0_249 0) (= 0 v_~x~0_138) (= v_~z~0_182 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ULTIMATE.start_main_~#t2026~0.base=|v_ULTIMATE.start_main_~#t2026~0.base_20|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_206, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_39|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, ULTIMATE.start_main_~#t2026~0.offset=|v_ULTIMATE.start_main_~#t2026~0.offset_17|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_49|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_47|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_25|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_374, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ~z$mem_tmp~0=v_~z$mem_tmp~0_19, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_43|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_42|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_516, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_52|, ULTIMATE.start_main_~#t2027~0.base=|v_ULTIMATE.start_main_~#t2027~0.base_20|, ~z$flush_delayed~0=v_~z$flush_delayed~0_34, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_32|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_190, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_140, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~x~0=v_~x~0_138, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_29|, ~z$w_buff1~0=v_~z$w_buff1~0_249, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_121|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_308, ULTIMATE.start_main_~#t2025~0.offset=|v_ULTIMATE.start_main_~#t2025~0.offset_17|, ~y~0=v_~y~0_34, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_140, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_875, ~z$w_buff0~0=v_~z$w_buff0~0_342, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_196, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_38|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t2025~0.base=|v_ULTIMATE.start_main_~#t2025~0.base_21|, ~z~0=v_~z~0_182, ~weak$$choice2~0=v_~weak$$choice2~0_109, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_226, ULTIMATE.start_main_~#t2027~0.offset=|v_ULTIMATE.start_main_~#t2027~0.offset_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_~#t2026~0.base, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t2026~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t2027~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t2025~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t2025~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t2027~0.offset] because there is no mapped edge [2019-12-27 18:14:28,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L805-1-->L807: Formula: (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2026~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2026~0.base_12|) |v_ULTIMATE.start_main_~#t2026~0.offset_11| 1))) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2026~0.base_12| 4)) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2026~0.base_12|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t2026~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t2026~0.offset_11|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2026~0.base_12| 1) |v_#valid_34|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2026~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2026~0.base=|v_ULTIMATE.start_main_~#t2026~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2026~0.offset=|v_ULTIMATE.start_main_~#t2026~0.offset_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2026~0.base, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, ULTIMATE.start_main_~#t2026~0.offset, #length] because there is no mapped edge [2019-12-27 18:14:28,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_226 v_~z$w_buff1_used~0_114) (= 2 v_~z$w_buff0~0_55) (= v_~z$w_buff0~0_56 v_~z$w_buff1~0_53) (= v_P0Thread1of1ForFork0_~arg.base_22 |v_P0Thread1of1ForFork0_#in~arg.base_22|) (= 0 (mod v_~z$w_buff1_used~0_114 256)) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_26 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_22|) (= v_P0Thread1of1ForFork0_~arg.offset_22 |v_P0Thread1of1ForFork0_#in~arg.offset_22|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_22|) (= v_~z$w_buff0_used~0_225 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_226, ~z$w_buff0~0=v_~z$w_buff0~0_56, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_22|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_225, ~z$w_buff0~0=v_~z$w_buff0~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_114, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_22|, ~z$w_buff1~0=v_~z$w_buff1~0_53, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_22, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_22|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_22} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 18:14:28,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2027~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2027~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2027~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2027~0.base_9|) |v_ULTIMATE.start_main_~#t2027~0.offset_8| 2))) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2027~0.base_9| 4) |v_#length_13|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2027~0.base_9|)) (= 0 |v_ULTIMATE.start_main_~#t2027~0.offset_8|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2027~0.base_9| 1) |v_#valid_27|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2027~0.base=|v_ULTIMATE.start_main_~#t2027~0.base_9|, ULTIMATE.start_main_~#t2027~0.offset=|v_ULTIMATE.start_main_~#t2027~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2027~0.base, ULTIMATE.start_main_~#t2027~0.offset] because there is no mapped edge [2019-12-27 18:14:28,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In649176392 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In649176392 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out649176392|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In649176392 |P0Thread1of1ForFork0_#t~ite5_Out649176392|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In649176392, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In649176392} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out649176392|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In649176392, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In649176392} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 18:14:28,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-1470356930 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1470356930 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In-1470356930 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1470356930 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1470356930| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1470356930| ~z$w_buff1_used~0_In-1470356930) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1470356930, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1470356930, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1470356930, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1470356930} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1470356930|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1470356930, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1470356930, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1470356930, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1470356930} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 18:14:28,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L745-->L746: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1266442095 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1266442095 256)))) (or (and (= 0 ~z$r_buff0_thd1~0_Out-1266442095) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_In-1266442095 ~z$r_buff0_thd1~0_Out-1266442095)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1266442095, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1266442095} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1266442095, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1266442095|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1266442095} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 18:14:28,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L746-->L746-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1747135901 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1747135901 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1747135901 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In1747135901 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd1~0_In1747135901 |P0Thread1of1ForFork0_#t~ite8_Out1747135901|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1747135901|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1747135901, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1747135901, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1747135901, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1747135901} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1747135901, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1747135901|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1747135901, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1747135901, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1747135901} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 18:14:28,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L746-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 18:14:28,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L762-2-->L762-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In1214305044 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1214305044 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite9_Out1214305044| |P1Thread1of1ForFork1_#t~ite10_Out1214305044|))) (or (and .cse0 (or .cse1 .cse2) (= |P1Thread1of1ForFork1_#t~ite9_Out1214305044| ~z~0_In1214305044)) (and (not .cse1) (not .cse2) (= |P1Thread1of1ForFork1_#t~ite9_Out1214305044| ~z$w_buff1~0_In1214305044) .cse0))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1214305044, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1214305044, ~z$w_buff1~0=~z$w_buff1~0_In1214305044, ~z~0=~z~0_In1214305044} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1214305044|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1214305044, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1214305044, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out1214305044|, ~z$w_buff1~0=~z$w_buff1~0_In1214305044, ~z~0=~z~0_In1214305044} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-27 18:14:28,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In2132419478 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In2132419478 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out2132419478| ~z$w_buff1~0_In2132419478) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out2132419478| ~z~0_In2132419478)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2132419478, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2132419478, ~z$w_buff1~0=~z$w_buff1~0_In2132419478, ~z~0=~z~0_In2132419478} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out2132419478|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2132419478, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2132419478, ~z$w_buff1~0=~z$w_buff1~0_In2132419478, ~z~0=~z~0_In2132419478} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 18:14:28,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L782-4-->L783: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork2_#t~ite15_10|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_10|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_9|, ~z~0=v_~z~0_20, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_13|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 18:14:28,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1814129707 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1814129707 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite17_Out1814129707|) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out1814129707| ~z$w_buff0_used~0_In1814129707) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1814129707, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1814129707} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1814129707, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1814129707, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1814129707|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 18:14:28,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd3~0_In70406599 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In70406599 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In70406599 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In70406599 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite18_Out70406599| ~z$w_buff1_used~0_In70406599) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite18_Out70406599| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In70406599, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In70406599, ~z$w_buff1_used~0=~z$w_buff1_used~0_In70406599, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In70406599} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In70406599, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In70406599, ~z$w_buff1_used~0=~z$w_buff1_used~0_In70406599, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In70406599, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out70406599|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 18:14:28,163 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-627772457 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-627772457 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out-627772457| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out-627772457| ~z$r_buff0_thd3~0_In-627772457) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-627772457, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-627772457} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-627772457, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-627772457, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-627772457|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 18:14:28,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In76809626 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In76809626 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In76809626 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In76809626 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In76809626 |P2Thread1of1ForFork2_#t~ite20_Out76809626|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite20_Out76809626|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In76809626, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In76809626, ~z$w_buff1_used~0=~z$w_buff1_used~0_In76809626, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In76809626} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In76809626, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out76809626|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In76809626, ~z$w_buff1_used~0=~z$w_buff1_used~0_In76809626, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In76809626} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 18:14:28,164 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_32| v_~z$r_buff1_thd3~0_67) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1))) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_31|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_67, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 18:14:28,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In873168286 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In873168286 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out873168286|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In873168286 |P1Thread1of1ForFork1_#t~ite11_Out873168286|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In873168286, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In873168286} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In873168286, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out873168286|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In873168286} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 18:14:28,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L764-->L764-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In1478479464 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1478479464 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1478479464 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1478479464 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out1478479464|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1478479464 |P1Thread1of1ForFork1_#t~ite12_Out1478479464|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1478479464, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1478479464, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1478479464, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1478479464} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1478479464, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1478479464, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1478479464, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1478479464|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1478479464} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 18:14:28,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1591062673 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1591062673 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite13_Out1591062673| ~z$r_buff0_thd2~0_In1591062673) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out1591062673| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1591062673, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1591062673} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1591062673, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1591062673|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1591062673} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 18:14:28,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1603632618 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1603632618 256))) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-1603632618 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1603632618 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In-1603632618 |P1Thread1of1ForFork1_#t~ite14_Out-1603632618|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-1603632618|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1603632618, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1603632618, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1603632618, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1603632618} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1603632618, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1603632618, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1603632618, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1603632618|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1603632618} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 18:14:28,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_32| v_~z$r_buff1_thd2~0_84) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_84, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 18:14:28,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_18) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 18:14:28,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L815-2-->L815-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-786335967 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-786335967 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite24_Out-786335967| |ULTIMATE.start_main_#t~ite25_Out-786335967|))) (or (and (not .cse0) .cse1 (= |ULTIMATE.start_main_#t~ite24_Out-786335967| ~z$w_buff1~0_In-786335967) (not .cse2)) (and (or .cse0 .cse2) .cse1 (= |ULTIMATE.start_main_#t~ite24_Out-786335967| ~z~0_In-786335967)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-786335967, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-786335967, ~z$w_buff1~0=~z$w_buff1~0_In-786335967, ~z~0=~z~0_In-786335967} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-786335967, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-786335967|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-786335967, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-786335967|, ~z$w_buff1~0=~z$w_buff1~0_In-786335967, ~z~0=~z~0_In-786335967} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 18:14:28,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L816-->L816-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-1922051253 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1922051253 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1922051253 |ULTIMATE.start_main_#t~ite26_Out-1922051253|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite26_Out-1922051253| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1922051253, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1922051253} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1922051253, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1922051253, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1922051253|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 18:14:28,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L817-->L817-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1929942259 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1929942259 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1929942259 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1929942259 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1929942259 |ULTIMATE.start_main_#t~ite27_Out-1929942259|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite27_Out-1929942259|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1929942259, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1929942259, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1929942259, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1929942259} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1929942259, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1929942259, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1929942259, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1929942259, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1929942259|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 18:14:28,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-38128549 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-38128549 256)))) (or (and (= |ULTIMATE.start_main_#t~ite28_Out-38128549| ~z$r_buff0_thd0~0_In-38128549) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite28_Out-38128549| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-38128549, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-38128549} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-38128549, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-38128549|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-38128549} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 18:14:28,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1858504995 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1858504995 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1858504995 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1858504995 256) 0))) (or (and (= ~z$r_buff1_thd0~0_In-1858504995 |ULTIMATE.start_main_#t~ite29_Out-1858504995|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite29_Out-1858504995|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1858504995, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1858504995, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1858504995, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1858504995} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1858504995, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1858504995|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1858504995, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1858504995, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1858504995} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 18:14:28,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L831-->L832: Formula: (and (= v_~z$r_buff0_thd0~0_103 v_~z$r_buff0_thd0~0_102) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_103, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_102, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 18:14:28,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L834-->L837-1: Formula: (and (= v_~z$mem_tmp~0_11 v_~z~0_133) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= 0 (mod v_~z$flush_delayed~0_21 256))) (= 0 v_~z$flush_delayed~0_20)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_21} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_20, ~z~0=v_~z~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:14:28,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 18:14:28,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:14:28 BasicIcfg [2019-12-27 18:14:28,285 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:14:28,286 INFO L168 Benchmark]: Toolchain (without parser) took 91143.74 ms. Allocated memory was 146.3 MB in the beginning and 3.9 GB in the end (delta: 3.8 GB). Free memory was 102.1 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 18:14:28,288 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 18:14:28,288 INFO L168 Benchmark]: CACSL2BoogieTranslator took 817.46 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.9 MB in the beginning and 155.3 MB in the end (delta: -53.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 18:14:28,290 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.92 ms. Allocated memory is still 203.9 MB. Free memory was 155.3 MB in the beginning and 152.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:14:28,290 INFO L168 Benchmark]: Boogie Preprocessor took 37.72 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 150.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 18:14:28,291 INFO L168 Benchmark]: RCFGBuilder took 770.48 ms. Allocated memory is still 203.9 MB. Free memory was 150.0 MB in the beginning and 100.1 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-27 18:14:28,291 INFO L168 Benchmark]: TraceAbstraction took 89438.31 ms. Allocated memory was 203.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 99.4 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 18:14:28,299 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.20 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 817.46 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.9 MB in the beginning and 155.3 MB in the end (delta: -53.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.92 ms. Allocated memory is still 203.9 MB. Free memory was 155.3 MB in the beginning and 152.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.72 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 150.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 770.48 ms. Allocated memory is still 203.9 MB. Free memory was 150.0 MB in the beginning and 100.1 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 89438.31 ms. Allocated memory was 203.9 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 99.4 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 174 ProgramPointsBefore, 93 ProgramPointsAfterwards, 211 TransitionsBefore, 104 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 30 ChoiceCompositions, 6114 VarBasedMoverChecksPositive, 254 VarBasedMoverChecksNegative, 80 SemBasedMoverChecksPositive, 255 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 86146 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L732] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L733] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L734] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L735] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L809] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 2 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L762] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L782] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L762] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L763] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L764] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L765] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L815] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L816] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L817] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L818] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L819] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 z$flush_delayed = weak$$choice2 [L825] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L827] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L828] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L829] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 89.1s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 29.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2980 SDtfs, 4333 SDslu, 7990 SDs, 0 SdLazy, 5184 SolverSat, 368 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 84 SyntacticMatches, 55 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178183occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 30.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 91444 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1051 NumberOfCodeBlocks, 1051 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 963 ConstructedInterpolants, 0 QuantifiedInterpolants, 229342 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...