/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 00:41:33,819 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 00:41:33,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 00:41:33,868 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 00:41:33,869 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 00:41:33,870 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 00:41:33,871 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 00:41:33,873 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 00:41:33,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 00:41:33,875 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 00:41:33,876 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 00:41:33,877 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 00:41:33,877 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 00:41:33,878 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 00:41:33,879 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 00:41:33,880 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 00:41:33,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 00:41:33,884 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 00:41:33,885 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 00:41:33,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 00:41:33,889 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 00:41:33,890 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 00:41:33,891 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 00:41:33,891 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 00:41:33,894 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 00:41:33,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 00:41:33,895 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 00:41:33,896 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 00:41:33,896 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 00:41:33,897 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 00:41:33,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 00:41:33,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 00:41:33,898 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 00:41:33,899 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 00:41:33,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 00:41:33,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 00:41:33,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 00:41:33,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 00:41:33,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 00:41:33,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 00:41:33,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 00:41:33,904 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-22 00:41:33,926 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 00:41:33,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 00:41:33,928 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 00:41:33,928 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 00:41:33,928 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 00:41:33,928 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 00:41:33,928 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 00:41:33,929 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 00:41:33,929 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 00:41:33,929 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 00:41:33,929 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 00:41:33,929 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 00:41:33,930 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 00:41:33,930 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 00:41:33,930 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 00:41:33,930 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 00:41:33,930 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 00:41:33,931 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 00:41:33,931 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 00:41:33,931 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 00:41:33,931 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 00:41:33,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 00:41:33,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 00:41:33,932 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 00:41:33,932 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 00:41:33,932 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 00:41:33,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 00:41:33,933 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 00:41:33,933 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 00:41:33,933 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 00:41:33,933 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 00:41:34,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 00:41:34,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 00:41:34,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 00:41:34,252 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 00:41:34,252 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 00:41:34,253 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i [2020-10-22 00:41:34,316 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76c95c4b7/06bc863a414e4228affeab3fe8b7203e/FLAGf81f3a9c1 [2020-10-22 00:41:34,844 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 00:41:34,845 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i [2020-10-22 00:41:34,864 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76c95c4b7/06bc863a414e4228affeab3fe8b7203e/FLAGf81f3a9c1 [2020-10-22 00:41:35,137 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76c95c4b7/06bc863a414e4228affeab3fe8b7203e [2020-10-22 00:41:35,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 00:41:35,153 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 00:41:35,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 00:41:35,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 00:41:35,158 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 00:41:35,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:41:35" (1/1) ... [2020-10-22 00:41:35,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5888128f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:35, skipping insertion in model container [2020-10-22 00:41:35,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:41:35" (1/1) ... [2020-10-22 00:41:35,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 00:41:35,244 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 00:41:35,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:41:35,726 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 00:41:35,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:41:35,891 INFO L208 MainTranslator]: Completed translation [2020-10-22 00:41:35,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:35 WrapperNode [2020-10-22 00:41:35,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 00:41:35,892 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 00:41:35,892 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 00:41:35,893 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 00:41:35,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:35" (1/1) ... [2020-10-22 00:41:35,921 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:35" (1/1) ... [2020-10-22 00:41:35,957 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 00:41:35,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 00:41:35,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 00:41:35,958 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 00:41:35,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:35" (1/1) ... [2020-10-22 00:41:35,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:35" (1/1) ... [2020-10-22 00:41:35,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:35" (1/1) ... [2020-10-22 00:41:35,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:35" (1/1) ... [2020-10-22 00:41:35,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:35" (1/1) ... [2020-10-22 00:41:35,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:35" (1/1) ... [2020-10-22 00:41:35,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:35" (1/1) ... [2020-10-22 00:41:35,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 00:41:35,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 00:41:35,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 00:41:35,998 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 00:41:35,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:35" (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 [2020-10-22 00:41:36,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 00:41:36,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 00:41:36,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 00:41:36,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 00:41:36,097 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 00:41:36,097 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 00:41:36,098 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 00:41:36,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 00:41:36,099 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 00:41:36,099 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 00:41:36,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 00:41:36,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 00:41:36,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 00:41:36,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 00:41:36,103 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 00:41:38,198 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 00:41:38,199 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 00:41:38,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:41:38 BoogieIcfgContainer [2020-10-22 00:41:38,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 00:41:38,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 00:41:38,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 00:41:38,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 00:41:38,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 12:41:35" (1/3) ... [2020-10-22 00:41:38,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a0fd01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:41:38, skipping insertion in model container [2020-10-22 00:41:38,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:41:35" (2/3) ... [2020-10-22 00:41:38,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a0fd01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:41:38, skipping insertion in model container [2020-10-22 00:41:38,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:41:38" (3/3) ... [2020-10-22 00:41:38,214 INFO L111 eAbstractionObserver]: Analyzing ICFG safe031_power.opt.i [2020-10-22 00:41:38,227 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 00:41:38,227 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 00:41:38,236 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 00:41:38,237 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 00:41:38,288 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,289 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,289 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,290 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,291 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,291 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,294 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,294 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,295 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,296 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,298 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,299 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,299 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,299 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,299 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,300 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,305 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,305 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,305 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,306 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,306 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,306 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,306 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,306 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,308 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,310 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,311 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,312 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,312 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:41:38,318 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 00:41:38,332 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-22 00:41:38,354 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 00:41:38,355 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 00:41:38,355 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 00:41:38,355 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 00:41:38,355 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 00:41:38,355 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 00:41:38,356 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 00:41:38,356 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 00:41:38,377 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 00:41:38,378 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 100 transitions, 215 flow [2020-10-22 00:41:38,382 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 100 transitions, 215 flow [2020-10-22 00:41:38,386 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 107 places, 100 transitions, 215 flow [2020-10-22 00:41:38,460 INFO L129 PetriNetUnfolder]: 3/97 cut-off events. [2020-10-22 00:41:38,460 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 00:41:38,470 INFO L80 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-10-22 00:41:38,476 INFO L116 LiptonReduction]: Number of co-enabled transitions 1746 [2020-10-22 00:41:39,074 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-10-22 00:41:39,788 WARN L193 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-22 00:41:39,951 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-22 00:41:41,414 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-22 00:41:41,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-22 00:41:41,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:41:41,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-22 00:41:41,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:41:42,242 WARN L193 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-22 00:41:43,084 WARN L193 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2020-10-22 00:41:43,346 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-22 00:41:43,989 WARN L193 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2020-10-22 00:41:44,563 WARN L193 SmtUtils]: Spent 569.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 104 [2020-10-22 00:41:45,584 WARN L193 SmtUtils]: Spent 863.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 130 [2020-10-22 00:41:45,990 WARN L193 SmtUtils]: Spent 403.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-22 00:41:46,295 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2020-10-22 00:41:46,411 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-10-22 00:41:46,813 WARN L193 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-10-22 00:41:46,989 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-22 00:41:46,995 INFO L131 LiptonReduction]: Checked pairs total: 4701 [2020-10-22 00:41:46,996 INFO L133 LiptonReduction]: Total number of compositions: 92 [2020-10-22 00:41:47,003 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-10-22 00:41:47,049 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 650 states. [2020-10-22 00:41:47,052 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states. [2020-10-22 00:41:47,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-22 00:41:47,058 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:47,059 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:47,060 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:47,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:47,065 INFO L82 PathProgramCache]: Analyzing trace with hash 117480453, now seen corresponding path program 1 times [2020-10-22 00:41:47,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:47,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131240780] [2020-10-22 00:41:47,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:47,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131240780] [2020-10-22 00:41:47,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:47,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:41:47,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [170617897] [2020-10-22 00:41:47,357 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:47,360 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:47,375 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-22 00:41:47,375 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:47,380 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:47,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:41:47,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:47,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:41:47,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:41:47,399 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 3 states. [2020-10-22 00:41:47,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:47,514 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-10-22 00:41:47,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:41:47,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-22 00:41:47,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:47,537 INFO L225 Difference]: With dead ends: 550 [2020-10-22 00:41:47,538 INFO L226 Difference]: Without dead ends: 450 [2020-10-22 00:41:47,539 INFO L677 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 [2020-10-22 00:41:47,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-10-22 00:41:47,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-10-22 00:41:47,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-22 00:41:47,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-10-22 00:41:47,621 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 7 [2020-10-22 00:41:47,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:47,622 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-10-22 00:41:47,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:41:47,623 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-10-22 00:41:47,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 00:41:47,626 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:47,626 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:47,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 00:41:47,630 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:47,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:47,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1229600893, now seen corresponding path program 1 times [2020-10-22 00:41:47,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:47,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277501551] [2020-10-22 00:41:47,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:47,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:47,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277501551] [2020-10-22 00:41:47,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:47,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:41:47,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1383578635] [2020-10-22 00:41:47,769 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:47,771 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:47,773 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 00:41:47,773 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:47,774 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:47,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:41:47,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:47,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:41:47,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:41:47,776 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-10-22 00:41:47,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:47,815 INFO L93 Difference]: Finished difference Result 445 states and 1339 transitions. [2020-10-22 00:41:47,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:41:47,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-22 00:41:47,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:47,821 INFO L225 Difference]: With dead ends: 445 [2020-10-22 00:41:47,822 INFO L226 Difference]: Without dead ends: 445 [2020-10-22 00:41:47,822 INFO L677 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 [2020-10-22 00:41:47,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2020-10-22 00:41:47,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2020-10-22 00:41:47,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2020-10-22 00:41:47,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1339 transitions. [2020-10-22 00:41:47,852 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1339 transitions. Word has length 9 [2020-10-22 00:41:47,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:47,852 INFO L481 AbstractCegarLoop]: Abstraction has 445 states and 1339 transitions. [2020-10-22 00:41:47,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:41:47,852 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1339 transitions. [2020-10-22 00:41:47,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 00:41:47,854 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:47,854 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:47,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 00:41:47,855 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:47,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:47,855 INFO L82 PathProgramCache]: Analyzing trace with hash -537078437, now seen corresponding path program 1 times [2020-10-22 00:41:47,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:47,857 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196065849] [2020-10-22 00:41:47,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:47,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196065849] [2020-10-22 00:41:47,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:47,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 00:41:47,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1206632229] [2020-10-22 00:41:47,991 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:47,992 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:47,994 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-10-22 00:41:47,994 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:47,995 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:47,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:41:47,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:47,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:41:47,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:41:47,996 INFO L87 Difference]: Start difference. First operand 445 states and 1339 transitions. Second operand 4 states. [2020-10-22 00:41:48,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:48,036 INFO L93 Difference]: Finished difference Result 440 states and 1320 transitions. [2020-10-22 00:41:48,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:41:48,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-22 00:41:48,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:48,042 INFO L225 Difference]: With dead ends: 440 [2020-10-22 00:41:48,043 INFO L226 Difference]: Without dead ends: 440 [2020-10-22 00:41:48,043 INFO L677 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 [2020-10-22 00:41:48,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-10-22 00:41:48,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-10-22 00:41:48,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-10-22 00:41:48,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2020-10-22 00:41:48,069 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 10 [2020-10-22 00:41:48,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:48,069 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2020-10-22 00:41:48,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:41:48,069 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2020-10-22 00:41:48,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 00:41:48,071 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:48,071 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:48,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 00:41:48,071 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:48,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:48,072 INFO L82 PathProgramCache]: Analyzing trace with hash -537078871, now seen corresponding path program 1 times [2020-10-22 00:41:48,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:48,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005619815] [2020-10-22 00:41:48,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:48,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005619815] [2020-10-22 00:41:48,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:48,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 00:41:48,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [296046408] [2020-10-22 00:41:48,214 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:48,215 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:48,218 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-10-22 00:41:48,218 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:48,252 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-22 00:41:48,253 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:48,254 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 00:41:48,254 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:48,257 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:48,275 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:48,284 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:48,286 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:48,298 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:48,302 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:48,313 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:48,325 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:48,327 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:48,336 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:48,443 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:48,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:41:48,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:48,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:41:48,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:41:48,444 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand 4 states. [2020-10-22 00:41:48,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:48,484 INFO L93 Difference]: Finished difference Result 434 states and 1298 transitions. [2020-10-22 00:41:48,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:41:48,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-22 00:41:48,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:48,489 INFO L225 Difference]: With dead ends: 434 [2020-10-22 00:41:48,489 INFO L226 Difference]: Without dead ends: 434 [2020-10-22 00:41:48,489 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:41:48,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-10-22 00:41:48,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-10-22 00:41:48,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-10-22 00:41:48,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1298 transitions. [2020-10-22 00:41:48,510 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1298 transitions. Word has length 10 [2020-10-22 00:41:48,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:48,510 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1298 transitions. [2020-10-22 00:41:48,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:41:48,510 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1298 transitions. [2020-10-22 00:41:48,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 00:41:48,512 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:48,513 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:48,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 00:41:48,513 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:48,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:48,513 INFO L82 PathProgramCache]: Analyzing trace with hash 530435755, now seen corresponding path program 1 times [2020-10-22 00:41:48,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:48,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907998912] [2020-10-22 00:41:48,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:48,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:48,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907998912] [2020-10-22 00:41:48,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:48,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 00:41:48,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1074033131] [2020-10-22 00:41:48,566 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:48,567 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:48,569 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-22 00:41:48,570 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:48,570 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:48,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:41:48,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:48,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:41:48,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:41:48,571 INFO L87 Difference]: Start difference. First operand 434 states and 1298 transitions. Second operand 3 states. [2020-10-22 00:41:48,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:48,591 INFO L93 Difference]: Finished difference Result 599 states and 1720 transitions. [2020-10-22 00:41:48,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:41:48,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-22 00:41:48,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:48,596 INFO L225 Difference]: With dead ends: 599 [2020-10-22 00:41:48,596 INFO L226 Difference]: Without dead ends: 464 [2020-10-22 00:41:48,596 INFO L677 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 [2020-10-22 00:41:48,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-10-22 00:41:48,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 419. [2020-10-22 00:41:48,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2020-10-22 00:41:48,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 1201 transitions. [2020-10-22 00:41:48,612 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 1201 transitions. Word has length 11 [2020-10-22 00:41:48,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:48,612 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 1201 transitions. [2020-10-22 00:41:48,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:41:48,613 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 1201 transitions. [2020-10-22 00:41:48,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 00:41:48,615 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:48,615 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:48,615 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 00:41:48,615 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:48,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:48,616 INFO L82 PathProgramCache]: Analyzing trace with hash 530436747, now seen corresponding path program 1 times [2020-10-22 00:41:48,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:48,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292038871] [2020-10-22 00:41:48,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:48,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:48,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292038871] [2020-10-22 00:41:48,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:48,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:41:48,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1390689276] [2020-10-22 00:41:48,733 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:48,735 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:48,738 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 25 transitions. [2020-10-22 00:41:48,738 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:48,781 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-22 00:41:48,782 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:48,783 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-22 00:41:48,783 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:48,785 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:48,791 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:48,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:48,797 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:48,810 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:48,811 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:48,819 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:49,026 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [8276#(and (<= ~y~0 0) (or (<= ~y$w_buff1~0 0) (= (mod ~y$w_buff1_used~0 256) 0)) (= ~y$r_buff0_thd0~0 0))] [2020-10-22 00:41:49,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 00:41:49,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:49,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 00:41:49,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:41:49,027 INFO L87 Difference]: Start difference. First operand 419 states and 1201 transitions. Second operand 6 states. [2020-10-22 00:41:49,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:49,116 INFO L93 Difference]: Finished difference Result 407 states and 1157 transitions. [2020-10-22 00:41:49,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:41:49,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-22 00:41:49,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:49,121 INFO L225 Difference]: With dead ends: 407 [2020-10-22 00:41:49,121 INFO L226 Difference]: Without dead ends: 407 [2020-10-22 00:41:49,121 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:41:49,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2020-10-22 00:41:49,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2020-10-22 00:41:49,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-10-22 00:41:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1157 transitions. [2020-10-22 00:41:49,135 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1157 transitions. Word has length 11 [2020-10-22 00:41:49,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:49,136 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 1157 transitions. [2020-10-22 00:41:49,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 00:41:49,136 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1157 transitions. [2020-10-22 00:41:49,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 00:41:49,140 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:49,140 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:49,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 00:41:49,141 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:49,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:49,141 INFO L82 PathProgramCache]: Analyzing trace with hash -769299944, now seen corresponding path program 1 times [2020-10-22 00:41:49,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:49,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461000791] [2020-10-22 00:41:49,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:49,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:49,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461000791] [2020-10-22 00:41:49,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:49,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:41:49,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [218700467] [2020-10-22 00:41:49,258 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:49,260 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:49,266 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 58 transitions. [2020-10-22 00:41:49,266 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:49,286 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-22 00:41:49,286 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:49,287 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 00:41:49,287 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:49,290 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:49,310 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:49,317 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:49,318 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:49,325 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:49,327 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:49,333 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:49,806 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:49,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:41:49,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:49,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:41:49,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:41:49,807 INFO L87 Difference]: Start difference. First operand 407 states and 1157 transitions. Second operand 5 states. [2020-10-22 00:41:49,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:49,883 INFO L93 Difference]: Finished difference Result 402 states and 1138 transitions. [2020-10-22 00:41:49,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:41:49,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-22 00:41:49,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:49,887 INFO L225 Difference]: With dead ends: 402 [2020-10-22 00:41:49,888 INFO L226 Difference]: Without dead ends: 402 [2020-10-22 00:41:49,888 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:41:49,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2020-10-22 00:41:49,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 398. [2020-10-22 00:41:49,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-10-22 00:41:49,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1127 transitions. [2020-10-22 00:41:49,902 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1127 transitions. Word has length 12 [2020-10-22 00:41:49,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:49,903 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 1127 transitions. [2020-10-22 00:41:49,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:41:49,903 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1127 transitions. [2020-10-22 00:41:49,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 00:41:49,904 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:49,904 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:49,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 00:41:49,905 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:49,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:49,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1921518076, now seen corresponding path program 1 times [2020-10-22 00:41:49,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:49,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459315205] [2020-10-22 00:41:49,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:50,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:50,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459315205] [2020-10-22 00:41:50,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:50,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:41:50,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1235280907] [2020-10-22 00:41:50,060 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:50,062 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:50,068 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 61 transitions. [2020-10-22 00:41:50,068 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:50,106 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-22 00:41:50,106 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:50,108 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-22 00:41:50,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:50,110 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:50,116 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:50,117 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:50,127 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:50,140 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 00:41:50,140 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:50,159 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:50,162 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:50,170 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:41:50,178 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:41:50,182 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:50,186 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:41:50,198 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:41:50,972 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [10709#(and (or (<= ~y~0 0) (= ~y~0 1)) (or (<= ~y$w_buff1~0 0) (= ~y$w_buff1~0 1) (= (mod ~y$w_buff1_used~0 256) 0)) (= ~y$r_buff0_thd0~0 0)), 10710#(and (or (<= ~y$w_buff1~0 0) (= ~y$w_buff1~0 1) (= (mod ~y$w_buff1_used~0 256) 0)) (= ~y$r_buff0_thd0~0 0))] [2020-10-22 00:41:50,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 00:41:50,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:50,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 00:41:50,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:41:50,977 INFO L87 Difference]: Start difference. First operand 398 states and 1127 transitions. Second operand 8 states. [2020-10-22 00:41:51,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:51,136 INFO L93 Difference]: Finished difference Result 470 states and 1310 transitions. [2020-10-22 00:41:51,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:41:51,137 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-10-22 00:41:51,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:51,140 INFO L225 Difference]: With dead ends: 470 [2020-10-22 00:41:51,140 INFO L226 Difference]: Without dead ends: 422 [2020-10-22 00:41:51,140 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2020-10-22 00:41:51,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2020-10-22 00:41:51,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 416. [2020-10-22 00:41:51,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2020-10-22 00:41:51,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1156 transitions. [2020-10-22 00:41:51,154 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1156 transitions. Word has length 13 [2020-10-22 00:41:51,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:51,155 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 1156 transitions. [2020-10-22 00:41:51,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 00:41:51,155 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1156 transitions. [2020-10-22 00:41:51,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 00:41:51,156 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:51,156 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:51,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 00:41:51,156 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:51,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:51,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1352377110, now seen corresponding path program 1 times [2020-10-22 00:41:51,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:51,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686896680] [2020-10-22 00:41:51,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:51,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686896680] [2020-10-22 00:41:51,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:51,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:41:51,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [182606407] [2020-10-22 00:41:51,238 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:51,240 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:51,244 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 30 transitions. [2020-10-22 00:41:51,244 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:51,249 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:51,250 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:41:51,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:51,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:41:51,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:41:51,251 INFO L87 Difference]: Start difference. First operand 416 states and 1156 transitions. Second operand 4 states. [2020-10-22 00:41:51,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:51,291 INFO L93 Difference]: Finished difference Result 410 states and 1002 transitions. [2020-10-22 00:41:51,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:41:51,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-22 00:41:51,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:51,295 INFO L225 Difference]: With dead ends: 410 [2020-10-22 00:41:51,295 INFO L226 Difference]: Without dead ends: 298 [2020-10-22 00:41:51,296 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:41:51,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2020-10-22 00:41:51,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2020-10-22 00:41:51,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2020-10-22 00:41:51,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 708 transitions. [2020-10-22 00:41:51,305 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 708 transitions. Word has length 13 [2020-10-22 00:41:51,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:51,305 INFO L481 AbstractCegarLoop]: Abstraction has 298 states and 708 transitions. [2020-10-22 00:41:51,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:41:51,306 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 708 transitions. [2020-10-22 00:41:51,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 00:41:51,306 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:51,306 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:51,307 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 00:41:51,307 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:51,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:51,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1882145435, now seen corresponding path program 1 times [2020-10-22 00:41:51,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:51,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110314868] [2020-10-22 00:41:51,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:51,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:51,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:51,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110314868] [2020-10-22 00:41:51,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:51,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:41:51,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1307368076] [2020-10-22 00:41:51,388 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:51,390 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:51,395 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 33 transitions. [2020-10-22 00:41:51,395 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:51,471 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:51,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:41:51,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:51,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:41:51,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:41:51,472 INFO L87 Difference]: Start difference. First operand 298 states and 708 transitions. Second operand 5 states. [2020-10-22 00:41:51,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:51,521 INFO L93 Difference]: Finished difference Result 245 states and 530 transitions. [2020-10-22 00:41:51,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:41:51,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-22 00:41:51,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:51,524 INFO L225 Difference]: With dead ends: 245 [2020-10-22 00:41:51,524 INFO L226 Difference]: Without dead ends: 186 [2020-10-22 00:41:51,524 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:41:51,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-10-22 00:41:51,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2020-10-22 00:41:51,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-10-22 00:41:51,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 390 transitions. [2020-10-22 00:41:51,530 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 390 transitions. Word has length 14 [2020-10-22 00:41:51,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:51,531 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 390 transitions. [2020-10-22 00:41:51,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:41:51,531 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 390 transitions. [2020-10-22 00:41:51,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-22 00:41:51,532 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:51,532 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:51,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 00:41:51,532 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:51,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:51,533 INFO L82 PathProgramCache]: Analyzing trace with hash 573655817, now seen corresponding path program 1 times [2020-10-22 00:41:51,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:51,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516976457] [2020-10-22 00:41:51,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:51,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:51,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516976457] [2020-10-22 00:41:51,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:51,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:41:51,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1907868213] [2020-10-22 00:41:51,614 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:51,616 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:51,624 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 55 transitions. [2020-10-22 00:41:51,624 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:51,644 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [13659#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 00:41:51,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:41:51,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:51,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:41:51,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:41:51,646 INFO L87 Difference]: Start difference. First operand 186 states and 390 transitions. Second operand 7 states. [2020-10-22 00:41:51,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:51,707 INFO L93 Difference]: Finished difference Result 166 states and 349 transitions. [2020-10-22 00:41:51,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:41:51,708 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-22 00:41:51,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:51,709 INFO L225 Difference]: With dead ends: 166 [2020-10-22 00:41:51,709 INFO L226 Difference]: Without dead ends: 105 [2020-10-22 00:41:51,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:41:51,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-10-22 00:41:51,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2020-10-22 00:41:51,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-22 00:41:51,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 176 transitions. [2020-10-22 00:41:51,713 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 176 transitions. Word has length 16 [2020-10-22 00:41:51,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:51,713 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 176 transitions. [2020-10-22 00:41:51,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:41:51,713 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 176 transitions. [2020-10-22 00:41:51,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 00:41:51,714 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:51,714 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:51,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 00:41:51,715 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:51,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:51,715 INFO L82 PathProgramCache]: Analyzing trace with hash -2071543388, now seen corresponding path program 1 times [2020-10-22 00:41:51,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:51,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702057215] [2020-10-22 00:41:51,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:51,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:51,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702057215] [2020-10-22 00:41:51,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:51,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-22 00:41:51,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2117631098] [2020-10-22 00:41:51,906 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:51,908 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:51,926 INFO L252 McrAutomatonBuilder]: Finished intersection with 76 states and 145 transitions. [2020-10-22 00:41:51,926 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:52,455 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [14012#(and (= ~__unbuffered_p0_EAX~0 1) (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0) (not (= 2 ~y$w_buff1~0))), 14013#(and (= ~x~0 1) (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0) (not (= 2 ~y$w_buff1~0)))] [2020-10-22 00:41:52,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-22 00:41:52,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:52,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-22 00:41:52,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-10-22 00:41:52,457 INFO L87 Difference]: Start difference. First operand 87 states and 176 transitions. Second operand 12 states. [2020-10-22 00:41:52,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:52,886 INFO L93 Difference]: Finished difference Result 139 states and 287 transitions. [2020-10-22 00:41:52,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-22 00:41:52,887 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2020-10-22 00:41:52,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:52,888 INFO L225 Difference]: With dead ends: 139 [2020-10-22 00:41:52,889 INFO L226 Difference]: Without dead ends: 113 [2020-10-22 00:41:52,890 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-10-22 00:41:52,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-10-22 00:41:52,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2020-10-22 00:41:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-10-22 00:41:52,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 228 transitions. [2020-10-22 00:41:52,894 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 228 transitions. Word has length 20 [2020-10-22 00:41:52,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:52,895 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 228 transitions. [2020-10-22 00:41:52,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-22 00:41:52,895 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 228 transitions. [2020-10-22 00:41:52,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 00:41:52,927 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:52,927 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:52,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 00:41:52,929 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:52,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:52,930 INFO L82 PathProgramCache]: Analyzing trace with hash -2143931996, now seen corresponding path program 2 times [2020-10-22 00:41:52,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:52,935 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619420522] [2020-10-22 00:41:52,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:41:52,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:41:52,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619420522] [2020-10-22 00:41:52,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:41:52,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:41:52,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [88665354] [2020-10-22 00:41:52,993 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:41:52,998 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:41:53,016 INFO L252 McrAutomatonBuilder]: Finished intersection with 73 states and 140 transitions. [2020-10-22 00:41:53,016 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:41:53,364 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:41:53,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:41:53,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:41:53,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:41:53,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:41:53,366 INFO L87 Difference]: Start difference. First operand 113 states and 228 transitions. Second operand 4 states. [2020-10-22 00:41:53,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:41:53,385 INFO L93 Difference]: Finished difference Result 139 states and 276 transitions. [2020-10-22 00:41:53,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:41:53,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-22 00:41:53,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:41:53,387 INFO L225 Difference]: With dead ends: 139 [2020-10-22 00:41:53,387 INFO L226 Difference]: Without dead ends: 47 [2020-10-22 00:41:53,387 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:41:53,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-22 00:41:53,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-22 00:41:53,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-22 00:41:53,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 80 transitions. [2020-10-22 00:41:53,390 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 80 transitions. Word has length 20 [2020-10-22 00:41:53,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:41:53,390 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 80 transitions. [2020-10-22 00:41:53,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:41:53,391 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2020-10-22 00:41:53,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 00:41:53,391 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:41:53,392 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:41:53,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-22 00:41:53,392 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:41:53,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:41:53,392 INFO L82 PathProgramCache]: Analyzing trace with hash -7896946, now seen corresponding path program 3 times [2020-10-22 00:41:53,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:41:53,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687274407] [2020-10-22 00:41:53,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:41:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:41:53,481 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:41:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:41:53,537 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:41:53,593 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 00:41:53,594 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 00:41:53,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-22 00:41:53,595 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 00:41:53,609 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L2-->L831: Formula: (let ((.cse6 (= (mod ~y$r_buff1_thd0~0_In1396603605 256) 0)) (.cse7 (= (mod ~y$w_buff1_used~0_In1396603605 256) 0)) (.cse8 (= (mod ~y$w_buff0_used~0_In1396603605 256) 0)) (.cse9 (= (mod ~y$r_buff0_thd0~0_In1396603605 256) 0))) (let ((.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse5 (or .cse8 .cse9)) (.cse3 (not .cse7)) (.cse4 (not .cse6)) (.cse2 (or .cse6 .cse7))) (and (= ~y$r_buff0_thd0~0_Out1396603605 ~y$r_buff0_thd0~0_In1396603605) (or (and .cse0 .cse1 (= ~y~0_Out1396603605 ~y$w_buff0~0_In1396603605)) (and (or (and (= ~y~0_In1396603605 ~y~0_Out1396603605) .cse2) (and .cse3 (= ~y~0_Out1396603605 ~y$w_buff1~0_In1396603605) .cse4)) .cse5)) (= ~y$r_buff1_thd0~0_Out1396603605 ~y$r_buff1_thd0~0_In1396603605) (or (and .cse0 .cse1 (= ~y$w_buff0_used~0_Out1396603605 0)) (and .cse5 (= ~y$w_buff0_used~0_In1396603605 ~y$w_buff0_used~0_Out1396603605))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1396603605 0)) (or (and .cse3 .cse4 (= ~y$w_buff1_used~0_Out1396603605 0)) (and .cse2 (= ~y$w_buff1_used~0_Out1396603605 ~y$w_buff1_used~0_In1396603605))) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1396603605 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1396603605|)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1396603605|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1396603605, ~y$w_buff1~0=~y$w_buff1~0_In1396603605, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1396603605, ~y$w_buff0~0=~y$w_buff0~0_In1396603605, ~y~0=~y~0_In1396603605, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1396603605, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1396603605} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out1396603605, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1396603605|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1396603605|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1396603605|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1396603605|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1396603605|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1396603605|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1396603605|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1396603605, ~y$w_buff1~0=~y$w_buff1~0_In1396603605, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out1396603605, ~y$w_buff0~0=~y$w_buff0~0_In1396603605, ~y~0=~y~0_Out1396603605, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1396603605, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1396603605} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-22 00:41:53,619 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:53,620 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:53,620 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:53,620 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [777] [2020-10-22 00:41:53,621 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:53,622 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:53,622 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:53,624 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:53,624 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:53,624 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:53,624 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:53,624 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:53,625 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:53,625 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:53,625 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:53,625 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:53,625 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:53,626 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:53,626 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:53,626 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:53,626 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:53,626 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:53,626 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:53,627 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:53,627 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:53,627 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:53,628 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:53,628 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:53,628 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:53,628 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:53,628 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:53,629 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:53,629 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:53,629 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:53,629 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:53,629 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:53,629 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:53,630 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:53,630 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:53,630 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:53,630 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:53,630 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:53,631 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:53,631 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:53,631 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:53,631 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:53,631 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:41:53,631 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:41:53,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 12:41:53 BasicIcfg [2020-10-22 00:41:53,689 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 00:41:53,691 INFO L168 Benchmark]: Toolchain (without parser) took 18543.41 ms. Allocated memory was 140.0 MB in the beginning and 391.1 MB in the end (delta: 251.1 MB). Free memory was 101.4 MB in the beginning and 246.8 MB in the end (delta: -145.4 MB). Peak memory consumption was 105.7 MB. Max. memory is 7.1 GB. [2020-10-22 00:41:53,692 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.1 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-10-22 00:41:53,693 INFO L168 Benchmark]: CACSL2BoogieTranslator took 737.31 ms. Allocated memory was 140.0 MB in the beginning and 202.4 MB in the end (delta: 62.4 MB). Free memory was 100.5 MB in the beginning and 152.9 MB in the end (delta: -52.4 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2020-10-22 00:41:53,693 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.37 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-22 00:41:53,694 INFO L168 Benchmark]: Boogie Preprocessor took 39.65 ms. Allocated memory is still 202.4 MB. Free memory was 150.0 MB in the beginning and 148.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-22 00:41:53,695 INFO L168 Benchmark]: RCFGBuilder took 2204.63 ms. Allocated memory was 202.4 MB in the beginning and 246.9 MB in the end (delta: 44.6 MB). Free memory was 147.0 MB in the beginning and 184.0 MB in the end (delta: -37.0 MB). Peak memory consumption was 100.1 MB. Max. memory is 7.1 GB. [2020-10-22 00:41:53,696 INFO L168 Benchmark]: TraceAbstraction took 15484.76 ms. Allocated memory was 246.9 MB in the beginning and 391.1 MB in the end (delta: 144.2 MB). Free memory was 184.0 MB in the beginning and 246.8 MB in the end (delta: -62.8 MB). Peak memory consumption was 81.4 MB. Max. memory is 7.1 GB. [2020-10-22 00:41:53,700 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.1 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 737.31 ms. Allocated memory was 140.0 MB in the beginning and 202.4 MB in the end (delta: 62.4 MB). Free memory was 100.5 MB in the beginning and 152.9 MB in the end (delta: -52.4 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.37 ms. Allocated memory is still 202.4 MB. Free memory was 152.9 MB in the beginning and 150.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.65 ms. Allocated memory is still 202.4 MB. Free memory was 150.0 MB in the beginning and 148.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2204.63 ms. Allocated memory was 202.4 MB in the beginning and 246.9 MB in the end (delta: 44.6 MB). Free memory was 147.0 MB in the beginning and 184.0 MB in the end (delta: -37.0 MB). Peak memory consumption was 100.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15484.76 ms. Allocated memory was 246.9 MB in the beginning and 391.1 MB in the end (delta: 144.2 MB). Free memory was 184.0 MB in the beginning and 246.8 MB in the end (delta: -62.8 MB). Peak memory consumption was 81.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 963 VarBasedMoverChecksPositive, 36 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 67 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.6s, 107 PlacesBefore, 35 PlacesAfterwards, 100 TransitionsBefore, 25 TransitionsAfterwards, 1746 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 92 TotalNumberOfCompositions, 4701 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2516; [L816] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t2517; [L818] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L819] 0 pthread_t t2518; [L820] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L18] COND TRUE 3 !expression [L17] COND FALSE 3 !(0) [L17] 3 __assert_fail ("0", "safe031_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L758] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, 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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, 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=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L793] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L793] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L796] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L797] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 3 return 0; [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L837] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L838] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L838] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L839] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L839] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L840] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L840] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L841] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L841] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L842] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L843] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe031_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.2s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.6s, HoareTripleCheckerStatistics: 290 SDtfs, 283 SDslu, 507 SDs, 0 SdLazy, 494 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 150 GetRequests, 94 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 73 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 12744 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...