/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-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 02:10:32,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 02:10:32,750 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 02:10:32,775 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 02:10:32,776 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 02:10:32,777 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 02:10:32,779 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 02:10:32,781 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 02:10:32,782 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 02:10:32,783 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 02:10:32,790 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 02:10:32,791 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 02:10:32,791 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 02:10:32,792 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 02:10:32,793 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 02:10:32,795 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 02:10:32,796 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 02:10:32,802 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 02:10:32,805 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 02:10:32,808 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 02:10:32,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 02:10:32,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 02:10:32,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 02:10:32,817 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 02:10:32,824 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 02:10:32,825 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 02:10:32,826 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 02:10:32,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 02:10:32,829 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 02:10:32,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 02:10:32,832 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 02:10:32,833 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 02:10:32,834 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 02:10:32,835 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 02:10:32,846 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 02:10:32,847 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 02:10:32,848 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 02:10:32,848 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 02:10:32,848 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 02:10:32,849 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 02:10:32,850 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 02:10:32,854 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-SP.epf [2020-10-22 02:10:32,901 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 02:10:32,901 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 02:10:32,902 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 02:10:32,903 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 02:10:32,903 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 02:10:32,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 02:10:32,903 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 02:10:32,903 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 02:10:32,904 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 02:10:32,904 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 02:10:32,905 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 02:10:32,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 02:10:32,906 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 02:10:32,906 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 02:10:32,906 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 02:10:32,906 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 02:10:32,906 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 02:10:32,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 02:10:32,908 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 02:10:32,908 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 02:10:32,909 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 02:10:32,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 02:10:32,909 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 02:10:32,909 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 02:10:32,910 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 02:10:32,910 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 02:10:32,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 02:10:32,911 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 02:10:32,911 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 02:10:32,911 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 02:10:32,911 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 02:10:33,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 02:10:33,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 02:10:33,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 02:10:33,284 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 02:10:33,285 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 02:10:33,286 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_power.opt.i [2020-10-22 02:10:33,353 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72999f7d5/bd6f0e424b4a4c9bab35f825bbbdb924/FLAG143ccd25e [2020-10-22 02:10:33,945 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 02:10:33,946 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_power.opt.i [2020-10-22 02:10:33,964 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72999f7d5/bd6f0e424b4a4c9bab35f825bbbdb924/FLAG143ccd25e [2020-10-22 02:10:34,182 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72999f7d5/bd6f0e424b4a4c9bab35f825bbbdb924 [2020-10-22 02:10:34,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 02:10:34,199 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 02:10:34,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 02:10:34,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 02:10:34,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 02:10:34,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:10:34" (1/1) ... [2020-10-22 02:10:34,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4333b738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:34, skipping insertion in model container [2020-10-22 02:10:34,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:10:34" (1/1) ... [2020-10-22 02:10:34,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 02:10:34,261 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 02:10:34,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:10:34,918 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 02:10:35,013 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:10:35,093 INFO L208 MainTranslator]: Completed translation [2020-10-22 02:10:35,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:35 WrapperNode [2020-10-22 02:10:35,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 02:10:35,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 02:10:35,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 02:10:35,095 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 02:10:35,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:35" (1/1) ... [2020-10-22 02:10:35,126 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:35" (1/1) ... [2020-10-22 02:10:35,165 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 02:10:35,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 02:10:35,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 02:10:35,166 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 02:10:35,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:35" (1/1) ... [2020-10-22 02:10:35,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:35" (1/1) ... [2020-10-22 02:10:35,181 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:35" (1/1) ... [2020-10-22 02:10:35,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:35" (1/1) ... [2020-10-22 02:10:35,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:35" (1/1) ... [2020-10-22 02:10:35,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:35" (1/1) ... [2020-10-22 02:10:35,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:35" (1/1) ... [2020-10-22 02:10:35,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 02:10:35,208 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 02:10:35,208 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 02:10:35,208 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 02:10:35,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10: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 02:10:35,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 02:10:35,278 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 02:10:35,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 02:10:35,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 02:10:35,279 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 02:10:35,279 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 02:10:35,279 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 02:10:35,279 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 02:10:35,280 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 02:10:35,280 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 02:10:35,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 02:10:35,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 02:10:35,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 02:10:35,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 02:10:35,283 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 02:10:37,522 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 02:10:37,523 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 02:10:37,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:10:37 BoogieIcfgContainer [2020-10-22 02:10:37,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 02:10:37,527 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 02:10:37,527 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 02:10:37,531 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 02:10:37,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 02:10:34" (1/3) ... [2020-10-22 02:10:37,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a8c514c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:10:37, skipping insertion in model container [2020-10-22 02:10:37,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:10:35" (2/3) ... [2020-10-22 02:10:37,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a8c514c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:10:37, skipping insertion in model container [2020-10-22 02:10:37,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:10:37" (3/3) ... [2020-10-22 02:10:37,535 INFO L111 eAbstractionObserver]: Analyzing ICFG safe001_power.opt.i [2020-10-22 02:10:37,548 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 02:10:37,548 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 02:10:37,557 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 02:10:37,558 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 02:10:37,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,589 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,589 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,592 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,592 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,593 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,593 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,593 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,594 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,594 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,597 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,597 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,597 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,598 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,599 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,600 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,605 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,606 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,610 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,612 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,612 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,615 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,616 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:10:37,619 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 02:10:37,633 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-22 02:10:37,655 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 02:10:37,655 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 02:10:37,655 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 02:10:37,655 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 02:10:37,655 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 02:10:37,656 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 02:10:37,656 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 02:10:37,656 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 02:10:37,671 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 02:10:37,671 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 101 transitions, 217 flow [2020-10-22 02:10:37,674 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 101 transitions, 217 flow [2020-10-22 02:10:37,677 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 108 places, 101 transitions, 217 flow [2020-10-22 02:10:37,727 INFO L129 PetriNetUnfolder]: 3/98 cut-off events. [2020-10-22 02:10:37,727 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 02:10:37,733 INFO L80 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 3/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2020-10-22 02:10:37,737 INFO L116 LiptonReduction]: Number of co-enabled transitions 1862 [2020-10-22 02:10:38,368 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-10-22 02:10:39,959 WARN L193 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2020-10-22 02:10:39,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-22 02:10:39,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:10:39,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-22 02:10:39,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:10:41,202 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2020-10-22 02:10:41,871 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-10-22 02:10:41,985 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-22 02:10:43,179 WARN L193 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2020-10-22 02:10:43,480 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-22 02:10:44,877 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 141 DAG size of output: 132 [2020-10-22 02:10:45,365 WARN L193 SmtUtils]: Spent 484.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-22 02:10:45,922 WARN L193 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-10-22 02:10:46,124 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-22 02:10:46,131 INFO L131 LiptonReduction]: Checked pairs total: 5081 [2020-10-22 02:10:46,131 INFO L133 LiptonReduction]: Total number of compositions: 89 [2020-10-22 02:10:46,139 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-22 02:10:46,195 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 822 states. [2020-10-22 02:10:46,198 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states. [2020-10-22 02:10:46,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-22 02:10:46,205 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:10:46,206 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-22 02:10:46,206 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:10:46,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:10:46,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1048842805, now seen corresponding path program 1 times [2020-10-22 02:10:46,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:10:46,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797546217] [2020-10-22 02:10:46,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:10:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:10:46,529 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 02:10:46,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797546217] [2020-10-22 02:10:46,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:10:46,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:10:46,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2080347008] [2020-10-22 02:10:46,533 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:10:46,537 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:10:46,551 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-10-22 02:10:46,551 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:10:46,556 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:10:46,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:10:46,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:10:46,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:10:46,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:10:46,575 INFO L87 Difference]: Start difference. First operand 822 states. Second operand 3 states. [2020-10-22 02:10:46,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:10:46,671 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-10-22 02:10:46,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:10:46,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-22 02:10:46,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:10:46,696 INFO L225 Difference]: With dead ends: 687 [2020-10-22 02:10:46,696 INFO L226 Difference]: Without dead ends: 562 [2020-10-22 02:10:46,698 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 02:10:46,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-10-22 02:10:46,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-10-22 02:10:46,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-22 02:10:46,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-10-22 02:10:46,806 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 5 [2020-10-22 02:10:46,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:10:46,807 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-10-22 02:10:46,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:10:46,807 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-10-22 02:10:46,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 02:10:46,809 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:10:46,809 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:10:46,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 02:10:46,810 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:10:46,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:10:46,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1612320360, now seen corresponding path program 1 times [2020-10-22 02:10:46,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:10:46,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909366193] [2020-10-22 02:10:46,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:10:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:10:47,030 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 02:10:47,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909366193] [2020-10-22 02:10:47,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:10:47,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:10:47,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [294401272] [2020-10-22 02:10:47,033 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:10:47,034 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:10:47,037 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 02:10:47,037 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:10:47,038 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:10:47,041 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:10:47,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:10:47,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:10:47,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:10:47,043 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 4 states. [2020-10-22 02:10:47,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:10:47,107 INFO L93 Difference]: Finished difference Result 557 states and 1706 transitions. [2020-10-22 02:10:47,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:10:47,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2020-10-22 02:10:47,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:10:47,114 INFO L225 Difference]: With dead ends: 557 [2020-10-22 02:10:47,115 INFO L226 Difference]: Without dead ends: 557 [2020-10-22 02:10:47,116 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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 02:10:47,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-10-22 02:10:47,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2020-10-22 02:10:47,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2020-10-22 02:10:47,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1706 transitions. [2020-10-22 02:10:47,153 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1706 transitions. Word has length 9 [2020-10-22 02:10:47,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:10:47,154 INFO L481 AbstractCegarLoop]: Abstraction has 557 states and 1706 transitions. [2020-10-22 02:10:47,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:10:47,155 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1706 transitions. [2020-10-22 02:10:47,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 02:10:47,157 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:10:47,157 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:10:47,157 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 02:10:47,157 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:10:47,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:10:47,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1557278652, now seen corresponding path program 1 times [2020-10-22 02:10:47,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:10:47,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255566959] [2020-10-22 02:10:47,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:10:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:10:47,258 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 02:10:47,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255566959] [2020-10-22 02:10:47,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:10:47,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:10:47,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1324005322] [2020-10-22 02:10:47,259 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:10:47,261 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:10:47,263 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-10-22 02:10:47,264 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:10:47,330 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:10:47,330 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:10:47,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:10:47,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:10:47,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:10:47,331 INFO L87 Difference]: Start difference. First operand 557 states and 1706 transitions. Second operand 3 states. [2020-10-22 02:10:47,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:10:47,352 INFO L93 Difference]: Finished difference Result 537 states and 1635 transitions. [2020-10-22 02:10:47,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:10:47,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-22 02:10:47,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:10:47,359 INFO L225 Difference]: With dead ends: 537 [2020-10-22 02:10:47,360 INFO L226 Difference]: Without dead ends: 537 [2020-10-22 02:10:47,360 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 02:10:47,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-10-22 02:10:47,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2020-10-22 02:10:47,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2020-10-22 02:10:47,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1635 transitions. [2020-10-22 02:10:47,390 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 1635 transitions. Word has length 10 [2020-10-22 02:10:47,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:10:47,391 INFO L481 AbstractCegarLoop]: Abstraction has 537 states and 1635 transitions. [2020-10-22 02:10:47,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:10:47,391 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1635 transitions. [2020-10-22 02:10:47,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 02:10:47,399 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:10:47,399 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:10:47,399 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 02:10:47,400 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:10:47,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:10:47,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1557677095, now seen corresponding path program 1 times [2020-10-22 02:10:47,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:10:47,402 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277436916] [2020-10-22 02:10:47,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:10:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:10:47,521 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 02:10:47,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277436916] [2020-10-22 02:10:47,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:10:47,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:10:47,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [993589989] [2020-10-22 02:10:47,523 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:10:47,524 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:10:47,527 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-10-22 02:10:47,527 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:10:47,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:47,571 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:10:47,586 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:47,595 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 02:10:47,607 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:10:47,710 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:10:47,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:10:47,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:10:47,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:10:47,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:10:47,712 INFO L87 Difference]: Start difference. First operand 537 states and 1635 transitions. Second operand 4 states. [2020-10-22 02:10:47,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:10:47,775 INFO L93 Difference]: Finished difference Result 797 states and 2374 transitions. [2020-10-22 02:10:47,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:10:47,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-22 02:10:47,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:10:47,779 INFO L225 Difference]: With dead ends: 797 [2020-10-22 02:10:47,780 INFO L226 Difference]: Without dead ends: 449 [2020-10-22 02:10:47,780 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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 02:10:47,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2020-10-22 02:10:47,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2020-10-22 02:10:47,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2020-10-22 02:10:47,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 1335 transitions. [2020-10-22 02:10:47,797 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 1335 transitions. Word has length 10 [2020-10-22 02:10:47,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:10:47,797 INFO L481 AbstractCegarLoop]: Abstraction has 449 states and 1335 transitions. [2020-10-22 02:10:47,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:10:47,798 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 1335 transitions. [2020-10-22 02:10:47,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 02:10:47,799 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:10:47,799 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:10:47,799 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 02:10:47,799 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:10:47,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:10:47,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1933706461, now seen corresponding path program 1 times [2020-10-22 02:10:47,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:10:47,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525375298] [2020-10-22 02:10:47,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:10:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:10:47,856 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 02:10:47,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525375298] [2020-10-22 02:10:47,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:10:47,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:10:47,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [248248416] [2020-10-22 02:10:47,857 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:10:47,862 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:10:47,866 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 34 transitions. [2020-10-22 02:10:47,866 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:10:48,041 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:10:48,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:10:48,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:10:48,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:10:48,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:10:48,043 INFO L87 Difference]: Start difference. First operand 449 states and 1335 transitions. Second operand 3 states. [2020-10-22 02:10:48,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:10:48,058 INFO L93 Difference]: Finished difference Result 437 states and 1294 transitions. [2020-10-22 02:10:48,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:10:48,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-22 02:10:48,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:10:48,063 INFO L225 Difference]: With dead ends: 437 [2020-10-22 02:10:48,063 INFO L226 Difference]: Without dead ends: 437 [2020-10-22 02:10:48,063 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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 02:10:48,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2020-10-22 02:10:48,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2020-10-22 02:10:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2020-10-22 02:10:48,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 1294 transitions. [2020-10-22 02:10:48,078 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 1294 transitions. Word has length 12 [2020-10-22 02:10:48,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:10:48,078 INFO L481 AbstractCegarLoop]: Abstraction has 437 states and 1294 transitions. [2020-10-22 02:10:48,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:10:48,079 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 1294 transitions. [2020-10-22 02:10:48,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 02:10:48,080 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:10:48,080 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:10:48,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 02:10:48,080 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:10:48,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:10:48,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1867591583, now seen corresponding path program 1 times [2020-10-22 02:10:48,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:10:48,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243864445] [2020-10-22 02:10:48,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:10:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:10:48,178 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 02:10:48,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243864445] [2020-10-22 02:10:48,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:10:48,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:10:48,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [427701584] [2020-10-22 02:10:48,180 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:10:48,185 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:10:48,189 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 24 transitions. [2020-10-22 02:10:48,189 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:10:48,298 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:10:48,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:10:48,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:10:48,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:10:48,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:10:48,299 INFO L87 Difference]: Start difference. First operand 437 states and 1294 transitions. Second operand 4 states. [2020-10-22 02:10:48,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:10:48,330 INFO L93 Difference]: Finished difference Result 593 states and 1731 transitions. [2020-10-22 02:10:48,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:10:48,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-22 02:10:48,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:10:48,334 INFO L225 Difference]: With dead ends: 593 [2020-10-22 02:10:48,334 INFO L226 Difference]: Without dead ends: 317 [2020-10-22 02:10:48,334 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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 02:10:48,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-10-22 02:10:48,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2020-10-22 02:10:48,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2020-10-22 02:10:48,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 908 transitions. [2020-10-22 02:10:48,345 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 908 transitions. Word has length 12 [2020-10-22 02:10:48,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:10:48,345 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 908 transitions. [2020-10-22 02:10:48,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:10:48,345 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 908 transitions. [2020-10-22 02:10:48,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 02:10:48,346 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:10:48,346 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:10:48,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 02:10:48,347 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:10:48,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:10:48,347 INFO L82 PathProgramCache]: Analyzing trace with hash 197916404, now seen corresponding path program 1 times [2020-10-22 02:10:48,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:10:48,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958714324] [2020-10-22 02:10:48,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:10:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:10:48,413 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 02:10:48,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958714324] [2020-10-22 02:10:48,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:10:48,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:10:48,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [581304365] [2020-10-22 02:10:48,415 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:10:48,417 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:10:48,424 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 47 transitions. [2020-10-22 02:10:48,424 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:10:48,642 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:10:48,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:10:48,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:10:48,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:10:48,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:10:48,644 INFO L87 Difference]: Start difference. First operand 317 states and 908 transitions. Second operand 3 states. [2020-10-22 02:10:48,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:10:48,661 INFO L93 Difference]: Finished difference Result 305 states and 867 transitions. [2020-10-22 02:10:48,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:10:48,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-22 02:10:48,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:10:48,665 INFO L225 Difference]: With dead ends: 305 [2020-10-22 02:10:48,665 INFO L226 Difference]: Without dead ends: 305 [2020-10-22 02:10:48,665 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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 02:10:48,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-10-22 02:10:48,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2020-10-22 02:10:48,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2020-10-22 02:10:48,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 867 transitions. [2020-10-22 02:10:48,678 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 867 transitions. Word has length 13 [2020-10-22 02:10:48,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:10:48,678 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 867 transitions. [2020-10-22 02:10:48,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:10:48,678 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 867 transitions. [2020-10-22 02:10:48,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 02:10:48,680 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:10:48,680 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:10:48,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 02:10:48,680 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:10:48,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:10:48,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1840407851, now seen corresponding path program 1 times [2020-10-22 02:10:48,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:10:48,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014448325] [2020-10-22 02:10:48,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:10:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:10:48,787 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 02:10:48,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014448325] [2020-10-22 02:10:48,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:10:48,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:10:48,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [170565135] [2020-10-22 02:10:48,789 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:10:48,792 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:10:48,799 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 40 transitions. [2020-10-22 02:10:48,799 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:10:48,945 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-22 02:10:48,946 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:48,946 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:10:48,947 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:48,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:48,954 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:48,961 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:10:48,972 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:10:48,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:48,989 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:48,989 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:48,997 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:10:49,261 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:10:49,261 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 02:10:49,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:10:49,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 02:10:49,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:10:49,263 INFO L87 Difference]: Start difference. First operand 305 states and 867 transitions. Second operand 5 states. [2020-10-22 02:10:49,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:10:49,376 INFO L93 Difference]: Finished difference Result 304 states and 863 transitions. [2020-10-22 02:10:49,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:10:49,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-22 02:10:49,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:10:49,379 INFO L225 Difference]: With dead ends: 304 [2020-10-22 02:10:49,379 INFO L226 Difference]: Without dead ends: 304 [2020-10-22 02:10:49,380 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 6 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:10:49,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2020-10-22 02:10:49,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2020-10-22 02:10:49,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-10-22 02:10:49,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 863 transitions. [2020-10-22 02:10:49,390 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 863 transitions. Word has length 14 [2020-10-22 02:10:49,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:10:49,390 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 863 transitions. [2020-10-22 02:10:49,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 02:10:49,390 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 863 transitions. [2020-10-22 02:10:49,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 02:10:49,391 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:10:49,392 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:10:49,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 02:10:49,392 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:10:49,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:10:49,392 INFO L82 PathProgramCache]: Analyzing trace with hash 950022406, now seen corresponding path program 1 times [2020-10-22 02:10:49,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:10:49,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177992642] [2020-10-22 02:10:49,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:10:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:10:49,529 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 02:10:49,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177992642] [2020-10-22 02:10:49,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:10:49,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:10:49,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1997210544] [2020-10-22 02:10:49,531 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:10:49,535 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:10:49,544 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 60 transitions. [2020-10-22 02:10:49,545 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:10:49,615 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:49,669 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:49,963 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:50,018 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [12947#(= (mod ~main$tmp_guard0~0 256) 0), 12948#(not (= 3 ~__unbuffered_cnt~0))] [2020-10-22 02:10:50,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:10:50,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:10:50,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:10:50,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:10:50,019 INFO L87 Difference]: Start difference. First operand 304 states and 863 transitions. Second operand 6 states. [2020-10-22 02:10:50,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:10:50,079 INFO L93 Difference]: Finished difference Result 222 states and 553 transitions. [2020-10-22 02:10:50,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 02:10:50,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-22 02:10:50,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:10:50,082 INFO L225 Difference]: With dead ends: 222 [2020-10-22 02:10:50,082 INFO L226 Difference]: Without dead ends: 145 [2020-10-22 02:10:50,082 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:10:50,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-10-22 02:10:50,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2020-10-22 02:10:50,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-10-22 02:10:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 315 transitions. [2020-10-22 02:10:50,088 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 315 transitions. Word has length 15 [2020-10-22 02:10:50,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:10:50,088 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 315 transitions. [2020-10-22 02:10:50,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:10:50,088 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 315 transitions. [2020-10-22 02:10:50,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-22 02:10:50,089 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:10:50,089 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:10:50,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 02:10:50,090 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:10:50,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:10:50,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1023864462, now seen corresponding path program 1 times [2020-10-22 02:10:50,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:10:50,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511417594] [2020-10-22 02:10:50,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:10:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:10:50,176 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 02:10:50,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511417594] [2020-10-22 02:10:50,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:10:50,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 02:10:50,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1817633038] [2020-10-22 02:10:50,177 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:10:50,180 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:10:50,191 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 59 transitions. [2020-10-22 02:10:50,192 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:10:50,220 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:50,620 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [13472#(not (= 3 ~__unbuffered_cnt~0)), 13473#(not (= ~__unbuffered_cnt~0 2)), 13474#(not (= ~__unbuffered_cnt~0 1)), 13475#(<= ~__unbuffered_cnt~0 0), 13471#(= (mod ~main$tmp_guard0~0 256) 0)] [2020-10-22 02:10:50,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-22 02:10:50,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:10:50,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-22 02:10:50,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-22 02:10:50,622 INFO L87 Difference]: Start difference. First operand 145 states and 315 transitions. Second operand 11 states. [2020-10-22 02:10:50,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:10:50,703 INFO L93 Difference]: Finished difference Result 129 states and 281 transitions. [2020-10-22 02:10:50,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:10:50,705 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-10-22 02:10:50,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:10:50,706 INFO L225 Difference]: With dead ends: 129 [2020-10-22 02:10:50,706 INFO L226 Difference]: Without dead ends: 118 [2020-10-22 02:10:50,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2020-10-22 02:10:50,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-10-22 02:10:50,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2020-10-22 02:10:50,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2020-10-22 02:10:50,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 261 transitions. [2020-10-22 02:10:50,710 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 261 transitions. Word has length 18 [2020-10-22 02:10:50,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:10:50,710 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 261 transitions. [2020-10-22 02:10:50,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-22 02:10:50,711 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 261 transitions. [2020-10-22 02:10:50,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 02:10:50,711 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:10:50,712 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, 1] [2020-10-22 02:10:50,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 02:10:50,712 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:10:50,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:10:50,712 INFO L82 PathProgramCache]: Analyzing trace with hash -2015020648, now seen corresponding path program 1 times [2020-10-22 02:10:50,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:10:50,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981806867] [2020-10-22 02:10:50,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:10:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:10:51,029 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 02:10:51,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981806867] [2020-10-22 02:10:51,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:10:51,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 02:10:51,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1344591355] [2020-10-22 02:10:51,031 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:10:51,035 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:10:51,049 INFO L252 McrAutomatonBuilder]: Finished intersection with 44 states and 66 transitions. [2020-10-22 02:10:51,050 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:10:51,457 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 102 [2020-10-22 02:10:51,488 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:10:51,489 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:51,490 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:10:51,491 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:51,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:51,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:51,498 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:10:51,505 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:10:51,510 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:10:51,513 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:51,524 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:10:51,533 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:10:51,540 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:51,541 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:10:51,546 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:51,547 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:51,552 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:10:51,553 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:10:51,554 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:51,562 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:51,563 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:51,569 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:10:51,582 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term [2020-10-22 02:10:51,582 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:10:51,611 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:10:51,612 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:51,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:51,614 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:51,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:51,621 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:10:51,628 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:51,629 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:51,631 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:10:51,634 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:10:51,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:51,640 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:51,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:10:51,647 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:51,648 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:10:51,654 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:51,658 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:51,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:51,671 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term [2020-10-22 02:10:51,672 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:10:51,974 WARN L193 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 100 [2020-10-22 02:10:51,989 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-10-22 02:10:51,992 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:51,993 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-10-22 02:10:51,994 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:51,995 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:10:51,995 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:51,997 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:10:51,997 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:51,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:52,004 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:10:52,010 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:52,015 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,016 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,017 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,021 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:10:52,022 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:10:52,023 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,032 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:10:52,033 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:10:52,034 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,040 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:10:52,051 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,052 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:10:52,058 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,061 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,065 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:52,066 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:10:52,073 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:52,075 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-22 02:10:52,076 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:52,196 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:10:52,196 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:52,197 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:52,198 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:52,205 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,207 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:10:52,215 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:52,216 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:10:52,216 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:52,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:10:52,222 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term [2020-10-22 02:10:52,223 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:10:52,268 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:10:52,268 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:52,269 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:52,270 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:10:52,274 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,275 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,290 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:52,292 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:10:52,305 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,306 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 02:10:52,311 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,313 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,323 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,388 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,406 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,408 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,413 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,424 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,430 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:52,431 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:10:52,431 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:52,440 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,441 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,447 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,460 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 02:10:52,466 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:10:52,467 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:52,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,540 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,577 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,623 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,624 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:10:52,629 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term [2020-10-22 02:10:52,630 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:10:52,926 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:10:52,926 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:52,928 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:10:52,928 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:52,929 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:52,930 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:52,931 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:10:52,935 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:10:52,987 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:10:52,990 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:52,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:10:53,006 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:10:53,017 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:53,018 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:10:53,020 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:53,021 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:10:53,030 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:53,034 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:53,043 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term [2020-10-22 02:10:53,043 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:10:53,277 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2020-10-22 02:10:53,423 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 97 [2020-10-22 02:10:53,434 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:10:53,434 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:53,436 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:10:53,437 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:53,439 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:53,440 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:10:53,445 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:53,447 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:10:53,452 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:10:53,456 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:53,464 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:10:53,471 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:53,472 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:53,478 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:10:53,482 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:10:53,483 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:53,491 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:53,492 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:53,496 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:53,501 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:10:53,513 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:53,515 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term [2020-10-22 02:10:53,516 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:10:53,951 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 130 [2020-10-22 02:10:53,961 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:10:53,961 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:53,963 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:10:53,964 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:53,965 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:53,966 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:10:53,967 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:10:53,970 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:10:53,971 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:53,972 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:10:53,995 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:53,996 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:10:54,002 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:54,003 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:10:54,008 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:10:54,015 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:54,017 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:54,020 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:10:54,021 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:54,030 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:10:54,035 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:54,036 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:54,038 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:10:54,042 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term [2020-10-22 02:10:54,043 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:10:54,176 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [13856#(and (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (or (= ~x$w_buff0_used~0 0) (and (not (= (mod ~x$r_buff0_thd3~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0)))) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0)), 13857#(and (or (and (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0))) (= ~x$w_buff0_used~0 0) (and (not (= (mod ~x$r_buff0_thd3~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0)))) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0)), 13858#(and (= 0 ~x$r_buff0_thd3~0) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff1~0) (= ~x$r_buff1_thd0~0 0) (or (and (<= ~x$w_buff0_used~0 0) (<= 0 ~x$w_buff0_used~0)) (and (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0)))))] [2020-10-22 02:10:54,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-22 02:10:54,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:10:54,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-22 02:10:54,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-22 02:10:54,178 INFO L87 Difference]: Start difference. First operand 118 states and 261 transitions. Second operand 12 states. [2020-10-22 02:10:54,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:10:54,407 INFO L93 Difference]: Finished difference Result 162 states and 348 transitions. [2020-10-22 02:10:54,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:10:54,408 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-10-22 02:10:54,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:10:54,410 INFO L225 Difference]: With dead ends: 162 [2020-10-22 02:10:54,410 INFO L226 Difference]: Without dead ends: 90 [2020-10-22 02:10:54,410 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-10-22 02:10:54,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-10-22 02:10:54,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2020-10-22 02:10:54,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-10-22 02:10:54,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 181 transitions. [2020-10-22 02:10:54,413 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 181 transitions. Word has length 21 [2020-10-22 02:10:54,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:10:54,414 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 181 transitions. [2020-10-22 02:10:54,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-22 02:10:54,416 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 181 transitions. [2020-10-22 02:10:54,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 02:10:54,416 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:10:54,417 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, 1] [2020-10-22 02:10:54,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 02:10:54,417 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:10:54,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:10:54,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1452915720, now seen corresponding path program 2 times [2020-10-22 02:10:54,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:10:54,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165503378] [2020-10-22 02:10:54,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:10:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:10:54,513 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:10:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:10:54,576 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:10:54,633 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 02:10:54,633 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 02:10:54,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 02:10:54,635 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 02:10:54,647 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1057] [1057] L826-->L834: Formula: (let ((.cse9 (= (mod ~x$r_buff1_thd0~0_In1479285739 256) 0)) (.cse8 (= (mod ~x$w_buff1_used~0_In1479285739 256) 0)) (.cse6 (= (mod ~x$w_buff0_used~0_In1479285739 256) 0)) (.cse7 (= (mod ~x$r_buff0_thd0~0_In1479285739 256) 0))) (let ((.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse3 (or .cse6 .cse7))) (and (= ~x$r_buff1_thd0~0_In1479285739 ~x$r_buff1_thd0~0_Out1479285739) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_Out1479285739| ULTIMATE.start_assume_abort_if_not_~cond_Out1479285739) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_Out1479285739| (mod ~main$tmp_guard0~0_In1479285739 256)) (or (and (= ~x$w_buff1_used~0_In1479285739 ~x$w_buff1_used~0_Out1479285739) .cse0) (and (= ~x$w_buff1_used~0_Out1479285739 0) .cse1 .cse2)) (or (and .cse3 (= ~x$w_buff0_used~0_Out1479285739 ~x$w_buff0_used~0_In1479285739)) (and .cse4 (= ~x$w_buff0_used~0_Out1479285739 0) .cse5)) (or (and .cse4 (= ~x$w_buff0~0_In1479285739 ~x~0_Out1479285739) .cse5) (and (or (and .cse1 (= ~x$w_buff1~0_In1479285739 ~x~0_Out1479285739) .cse2) (and .cse0 (= ~x~0_In1479285739 ~x~0_Out1479285739))) .cse3)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1479285739 0)) (= ~x$r_buff0_thd0~0_Out1479285739 ~x$r_buff0_thd0~0_In1479285739)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1479285739, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1479285739, ~x$w_buff1~0=~x$w_buff1~0_In1479285739, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1479285739, ~main$tmp_guard0~0=~main$tmp_guard0~0_In1479285739, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1479285739, ~x~0=~x~0_In1479285739, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1479285739} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1479285739, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out1479285739, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1479285739|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1479285739|, ~x$w_buff1~0=~x$w_buff1~0_In1479285739, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out1479285739, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1479285739|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1479285739|, ~main$tmp_guard0~0=~main$tmp_guard0~0_In1479285739, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out1479285739|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1479285739, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out1479285739, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_Out1479285739|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out1479285739|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1479285739, ~x~0=~x~0_Out1479285739} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite31, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ~x~0] because there is no mapped edge [2020-10-22 02:10:54,653 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 02:10:54,654 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [760] [2020-10-22 02:10:54,655 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 02:10:54,655 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,655 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 02:10:54,655 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,655 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 02:10:54,656 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,656 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 02:10:54,656 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,656 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 02:10:54,656 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,656 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 02:10:54,657 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,658 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 02:10:54,658 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,658 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 02:10:54,658 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,658 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 02:10:54,658 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,658 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 02:10:54,659 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,659 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 02:10:54,659 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,659 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 02:10:54,659 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,660 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 02:10:54,660 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,660 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 02:10:54,660 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,660 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 02:10:54,661 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,661 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 02:10:54,661 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,661 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 02:10:54,661 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,662 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 02:10:54,662 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,662 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 02:10:54,662 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,663 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 02:10:54,663 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,663 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 02:10:54,663 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,663 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 02:10:54,664 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,664 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 02:10:54,664 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,664 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 02:10:54,664 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,664 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 02:10:54,665 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,665 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 02:10:54,665 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,665 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 02:10:54,665 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,665 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 02:10:54,666 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,666 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 02:10:54,666 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,666 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 02:10:54,666 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:10:54,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 02:10:54 BasicIcfg [2020-10-22 02:10:54,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 02:10:54,736 INFO L168 Benchmark]: Toolchain (without parser) took 20541.77 ms. Allocated memory was 138.9 MB in the beginning and 410.5 MB in the end (delta: 271.6 MB). Free memory was 100.9 MB in the beginning and 181.1 MB in the end (delta: -80.3 MB). Peak memory consumption was 191.3 MB. Max. memory is 7.1 GB. [2020-10-22 02:10:54,737 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-10-22 02:10:54,738 INFO L168 Benchmark]: CACSL2BoogieTranslator took 893.04 ms. Allocated memory was 138.9 MB in the beginning and 200.3 MB in the end (delta: 61.3 MB). Free memory was 99.8 MB in the beginning and 150.7 MB in the end (delta: -50.9 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. [2020-10-22 02:10:54,738 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.24 ms. Allocated memory is still 200.3 MB. Free memory was 150.7 MB in the beginning and 147.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-10-22 02:10:54,739 INFO L168 Benchmark]: Boogie Preprocessor took 41.57 ms. Allocated memory is still 200.3 MB. Free memory was 147.2 MB in the beginning and 145.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-22 02:10:54,740 INFO L168 Benchmark]: RCFGBuilder took 2318.21 ms. Allocated memory was 200.3 MB in the beginning and 249.6 MB in the end (delta: 49.3 MB). Free memory was 145.2 MB in the beginning and 161.3 MB in the end (delta: -16.1 MB). Peak memory consumption was 101.5 MB. Max. memory is 7.1 GB. [2020-10-22 02:10:54,741 INFO L168 Benchmark]: TraceAbstraction took 17207.56 ms. Allocated memory was 249.6 MB in the beginning and 410.5 MB in the end (delta: 161.0 MB). Free memory was 161.3 MB in the beginning and 181.1 MB in the end (delta: -19.8 MB). Peak memory consumption was 141.1 MB. Max. memory is 7.1 GB. [2020-10-22 02:10:54,752 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.22 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.2 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 893.04 ms. Allocated memory was 138.9 MB in the beginning and 200.3 MB in the end (delta: 61.3 MB). Free memory was 99.8 MB in the beginning and 150.7 MB in the end (delta: -50.9 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.24 ms. Allocated memory is still 200.3 MB. Free memory was 150.7 MB in the beginning and 147.2 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.57 ms. Allocated memory is still 200.3 MB. Free memory was 147.2 MB in the beginning and 145.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2318.21 ms. Allocated memory was 200.3 MB in the beginning and 249.6 MB in the end (delta: 49.3 MB). Free memory was 145.2 MB in the beginning and 161.3 MB in the end (delta: -16.1 MB). Peak memory consumption was 101.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17207.56 ms. Allocated memory was 249.6 MB in the beginning and 410.5 MB in the end (delta: 161.0 MB). Free memory was 161.3 MB in the beginning and 181.1 MB in the end (delta: -19.8 MB). Peak memory consumption was 141.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 978 VarBasedMoverChecksPositive, 40 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 65 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.4s, 108 PlacesBefore, 36 PlacesAfterwards, 101 TransitionsBefore, 26 TransitionsAfterwards, 1862 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 89 TotalNumberOfCompositions, 5081 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; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1804; [L819] FCALL, FORK 0 pthread_create(&t1804, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] 0 pthread_t t1805; [L821] FCALL, FORK 0 pthread_create(&t1805, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] 0 pthread_t t1806; [L823] FCALL, FORK 0 pthread_create(&t1806, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L741] 1 __unbuffered_p0_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L842] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe001_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 16.9s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 218 SDtfs, 329 SDslu, 330 SDs, 0 SdLazy, 174 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 97 SyntacticMatches, 15 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=822occurred 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, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 13884 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...