/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 13:22:20,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 13:22:20,061 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 13:22:20,089 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 13:22:20,089 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 13:22:20,096 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 13:22:20,099 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 13:22:20,101 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 13:22:20,104 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 13:22:20,106 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 13:22:20,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 13:22:20,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 13:22:20,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 13:22:20,112 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 13:22:20,115 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 13:22:20,116 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 13:22:20,117 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 13:22:20,118 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 13:22:20,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 13:22:20,126 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 13:22:20,127 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 13:22:20,130 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 13:22:20,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 13:22:20,132 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 13:22:20,144 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 13:22:20,144 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 13:22:20,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 13:22:20,145 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 13:22:20,146 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 13:22:20,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 13:22:20,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 13:22:20,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 13:22:20,151 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 13:22:20,152 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 13:22:20,153 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 13:22:20,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 13:22:20,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 13:22:20,154 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 13:22:20,155 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 13:22:20,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 13:22:20,157 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 13:22:20,157 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-16 13:22:20,207 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 13:22:20,207 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 13:22:20,209 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 13:22:20,209 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 13:22:20,209 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 13:22:20,209 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 13:22:20,209 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 13:22:20,210 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 13:22:20,210 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 13:22:20,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 13:22:20,210 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 13:22:20,210 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 13:22:20,210 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 13:22:20,211 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 13:22:20,211 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 13:22:20,212 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 13:22:20,212 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 13:22:20,212 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 13:22:20,212 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 13:22:20,213 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 13:22:20,213 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 13:22:20,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 13:22:20,213 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 13:22:20,213 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 13:22:20,214 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 13:22:20,214 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 13:22:20,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 13:22:20,214 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-16 13:22:20,215 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 13:22:20,215 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 13:22:20,215 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-16 13:22:20,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 13:22:20,529 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 13:22:20,532 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 13:22:20,534 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 13:22:20,534 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 13:22:20,536 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_power.opt.i [2020-10-16 13:22:20,607 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f0bdbda7a/942928b7a43747b9b3073829c28ca84e/FLAGee384a2c1 [2020-10-16 13:22:21,141 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 13:22:21,142 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/mix056_power.opt.i [2020-10-16 13:22:21,155 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f0bdbda7a/942928b7a43747b9b3073829c28ca84e/FLAGee384a2c1 [2020-10-16 13:22:21,428 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f0bdbda7a/942928b7a43747b9b3073829c28ca84e [2020-10-16 13:22:21,440 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 13:22:21,442 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 13:22:21,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 13:22:21,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 13:22:21,447 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 13:22:21,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:22:21" (1/1) ... [2020-10-16 13:22:21,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@364a7c7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:21, skipping insertion in model container [2020-10-16 13:22:21,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:22:21" (1/1) ... [2020-10-16 13:22:21,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 13:22:21,525 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 13:22:22,032 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:22:22,044 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 13:22:22,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 13:22:22,185 INFO L208 MainTranslator]: Completed translation [2020-10-16 13:22:22,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:22 WrapperNode [2020-10-16 13:22:22,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 13:22:22,187 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 13:22:22,187 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 13:22:22,187 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 13:22:22,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:22" (1/1) ... [2020-10-16 13:22:22,216 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:22" (1/1) ... [2020-10-16 13:22:22,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 13:22:22,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 13:22:22,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 13:22:22,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 13:22:22,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:22" (1/1) ... [2020-10-16 13:22:22,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:22" (1/1) ... [2020-10-16 13:22:22,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:22" (1/1) ... [2020-10-16 13:22:22,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:22" (1/1) ... [2020-10-16 13:22:22,275 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:22" (1/1) ... [2020-10-16 13:22:22,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:22" (1/1) ... [2020-10-16 13:22:22,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:22" (1/1) ... [2020-10-16 13:22:22,288 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 13:22:22,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 13:22:22,289 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 13:22:22,289 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 13:22:22,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:22" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-16 13:22:22,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 13:22:22,361 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 13:22:22,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 13:22:22,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 13:22:22,362 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 13:22:22,362 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 13:22:22,363 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 13:22:22,363 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 13:22:22,364 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 13:22:22,364 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 13:22:22,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 13:22:22,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 13:22:22,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 13:22:22,367 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 13:22:24,149 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 13:22:24,149 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 13:22:24,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:22:24 BoogieIcfgContainer [2020-10-16 13:22:24,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 13:22:24,153 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 13:22:24,153 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 13:22:24,156 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 13:22:24,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:22:21" (1/3) ... [2020-10-16 13:22:24,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94e2bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:22:24, skipping insertion in model container [2020-10-16 13:22:24,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:22:22" (2/3) ... [2020-10-16 13:22:24,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94e2bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:22:24, skipping insertion in model container [2020-10-16 13:22:24,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:22:24" (3/3) ... [2020-10-16 13:22:24,160 INFO L111 eAbstractionObserver]: Analyzing ICFG mix056_power.opt.i [2020-10-16 13:22:24,171 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 13:22:24,171 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 13:22:24,179 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 13:22:24,180 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 13:22:24,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,212 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,213 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,214 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,214 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,217 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,218 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,218 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,218 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,219 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,219 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,219 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,219 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,219 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,221 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,225 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,225 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,225 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,225 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,229 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,229 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,230 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,230 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,231 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,231 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,231 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,231 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,232 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,233 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,233 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,233 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 13:22:24,234 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 13:22:24,248 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 13:22:24,268 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 13:22:24,268 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 13:22:24,268 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 13:22:24,268 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-16 13:22:24,268 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 13:22:24,269 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 13:22:24,269 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 13:22:24,269 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 13:22:24,282 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 13:22:24,282 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 91 transitions, 197 flow [2020-10-16 13:22:24,285 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 91 transitions, 197 flow [2020-10-16 13:22:24,287 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 197 flow [2020-10-16 13:22:24,331 INFO L129 PetriNetUnfolder]: 2/88 cut-off events. [2020-10-16 13:22:24,332 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 13:22:24,336 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-16 13:22:24,339 INFO L117 LiptonReduction]: Number of co-enabled transitions 1536 [2020-10-16 13:22:24,826 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 13:22:25,736 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 13:22:25,846 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-16 13:22:27,133 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 229 DAG size of output: 188 [2020-10-16 13:22:27,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-16 13:22:27,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:22:27,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 13:22:27,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:22:27,836 WARN L193 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 106 [2020-10-16 13:22:28,795 WARN L193 SmtUtils]: Spent 955.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 188 [2020-10-16 13:22:28,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-16 13:22:28,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:22:28,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 13:22:28,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:22:29,492 WARN L193 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 107 [2020-10-16 13:22:30,984 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 243 DAG size of output: 203 [2020-10-16 13:22:30,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 13:22:31,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:22:31,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 13:22:31,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 13:22:32,029 WARN L193 SmtUtils]: Spent 999.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 130 [2020-10-16 13:22:32,258 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-16 13:22:32,398 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-16 13:22:32,404 INFO L132 LiptonReduction]: Checked pairs total: 4174 [2020-10-16 13:22:32,404 INFO L134 LiptonReduction]: Total number of compositions: 80 [2020-10-16 13:22:32,413 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-10-16 13:22:32,493 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 650 states. [2020-10-16 13:22:32,495 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states. [2020-10-16 13:22:32,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-16 13:22:32,502 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:32,503 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:32,504 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:32,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:32,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1913445642, now seen corresponding path program 1 times [2020-10-16 13:22:32,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:32,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807676337] [2020-10-16 13:22:32,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:32,771 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-16 13:22:32,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807676337] [2020-10-16 13:22:32,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:32,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:22:32,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [118630746] [2020-10-16 13:22:32,775 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:32,778 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:32,795 INFO L258 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-16 13:22:32,795 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:32,800 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:32,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:22:32,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:32,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:22:32,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:22:32,817 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 3 states. [2020-10-16 13:22:32,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:32,905 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-10-16 13:22:32,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:22:32,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-16 13:22:32,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:32,926 INFO L225 Difference]: With dead ends: 550 [2020-10-16 13:22:32,927 INFO L226 Difference]: Without dead ends: 450 [2020-10-16 13:22:32,928 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-16 13:22:32,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-10-16 13:22:33,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-10-16 13:22:33,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-16 13:22:33,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-10-16 13:22:33,017 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 7 [2020-10-16 13:22:33,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:33,019 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-10-16 13:22:33,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:22:33,019 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-10-16 13:22:33,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 13:22:33,020 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:33,020 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:33,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 13:22:33,020 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:33,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:33,021 INFO L82 PathProgramCache]: Analyzing trace with hash 575294358, now seen corresponding path program 1 times [2020-10-16 13:22:33,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:33,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571155242] [2020-10-16 13:22:33,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:33,183 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-16 13:22:33,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571155242] [2020-10-16 13:22:33,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:33,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 13:22:33,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [358362973] [2020-10-16 13:22:33,184 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:33,185 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:33,187 INFO L258 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-16 13:22:33,188 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:33,188 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:33,189 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:22:33,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:33,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:22:33,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:22:33,190 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-10-16 13:22:33,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:33,210 INFO L93 Difference]: Finished difference Result 440 states and 1320 transitions. [2020-10-16 13:22:33,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:22:33,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 13:22:33,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:33,217 INFO L225 Difference]: With dead ends: 440 [2020-10-16 13:22:33,217 INFO L226 Difference]: Without dead ends: 440 [2020-10-16 13:22:33,218 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-16 13:22:33,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-10-16 13:22:33,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-10-16 13:22:33,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-10-16 13:22:33,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2020-10-16 13:22:33,252 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 9 [2020-10-16 13:22:33,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:33,253 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2020-10-16 13:22:33,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:22:33,253 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2020-10-16 13:22:33,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 13:22:33,254 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:33,255 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:33,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 13:22:33,255 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:33,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:33,255 INFO L82 PathProgramCache]: Analyzing trace with hash 654255379, now seen corresponding path program 1 times [2020-10-16 13:22:33,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:33,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964492438] [2020-10-16 13:22:33,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:33,435 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-16 13:22:33,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964492438] [2020-10-16 13:22:33,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:33,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:22:33,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1258004138] [2020-10-16 13:22:33,437 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:33,438 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:33,442 INFO L258 McrAutomatonBuilder]: Finished intersection with 15 states and 18 transitions. [2020-10-16 13:22:33,444 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:33,481 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-16 13:22:33,482 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:33,482 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-16 13:22:33,483 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:33,488 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:33,490 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:33,497 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:33,525 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:33,540 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:33,555 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:33,560 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:33,566 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:33,590 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:33,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:22:33,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:33,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:22:33,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:22:33,591 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand 4 states. [2020-10-16 13:22:33,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:33,633 INFO L93 Difference]: Finished difference Result 434 states and 1298 transitions. [2020-10-16 13:22:33,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:22:33,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-16 13:22:33,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:33,638 INFO L225 Difference]: With dead ends: 434 [2020-10-16 13:22:33,639 INFO L226 Difference]: Without dead ends: 434 [2020-10-16 13:22:33,639 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:22:33,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-10-16 13:22:33,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-10-16 13:22:33,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-10-16 13:22:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1298 transitions. [2020-10-16 13:22:33,659 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1298 transitions. Word has length 10 [2020-10-16 13:22:33,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:33,659 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1298 transitions. [2020-10-16 13:22:33,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:22:33,659 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1298 transitions. [2020-10-16 13:22:33,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 13:22:33,662 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:33,662 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:33,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 13:22:33,662 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:33,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:33,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1192921599, now seen corresponding path program 1 times [2020-10-16 13:22:33,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:33,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204647984] [2020-10-16 13:22:33,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:33,721 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-16 13:22:33,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204647984] [2020-10-16 13:22:33,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:33,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:22:33,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [985087870] [2020-10-16 13:22:33,723 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:33,724 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:33,727 INFO L258 McrAutomatonBuilder]: Finished intersection with 16 states and 19 transitions. [2020-10-16 13:22:33,727 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:33,738 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:33,746 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:33,751 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:33,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:33,795 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:33,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 13:22:33,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:33,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 13:22:33,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 13:22:33,797 INFO L87 Difference]: Start difference. First operand 434 states and 1298 transitions. Second operand 4 states. [2020-10-16 13:22:33,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:33,845 INFO L93 Difference]: Finished difference Result 438 states and 1309 transitions. [2020-10-16 13:22:33,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:22:33,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-16 13:22:33,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:33,850 INFO L225 Difference]: With dead ends: 438 [2020-10-16 13:22:33,850 INFO L226 Difference]: Without dead ends: 438 [2020-10-16 13:22:33,851 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-16 13:22:33,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2020-10-16 13:22:33,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2020-10-16 13:22:33,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2020-10-16 13:22:33,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1309 transitions. [2020-10-16 13:22:33,867 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1309 transitions. Word has length 11 [2020-10-16 13:22:33,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:33,867 INFO L481 AbstractCegarLoop]: Abstraction has 438 states and 1309 transitions. [2020-10-16 13:22:33,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 13:22:33,867 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1309 transitions. [2020-10-16 13:22:33,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 13:22:33,869 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:33,869 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:33,869 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 13:22:33,869 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:33,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:33,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1192920235, now seen corresponding path program 1 times [2020-10-16 13:22:33,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:33,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312589178] [2020-10-16 13:22:33,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:34,144 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-16 13:22:34,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312589178] [2020-10-16 13:22:34,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:34,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:22:34,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [281911663] [2020-10-16 13:22:34,146 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:34,148 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:34,151 INFO L258 McrAutomatonBuilder]: Finished intersection with 17 states and 21 transitions. [2020-10-16 13:22:34,151 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:34,174 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:34,175 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:34,290 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [6807#(and (or (= (mod ~y$w_buff1_used~0 256) 0) (= (mod ~y$r_buff1_thd0~0 256) 0)) (<= ~y~0 0) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (<= 0 ~y$r_buff0_thd0~0))] [2020-10-16 13:22:34,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 13:22:34,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:34,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 13:22:34,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-16 13:22:34,291 INFO L87 Difference]: Start difference. First operand 438 states and 1309 transitions. Second operand 6 states. [2020-10-16 13:22:34,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:34,394 INFO L93 Difference]: Finished difference Result 426 states and 1265 transitions. [2020-10-16 13:22:34,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:22:34,395 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-16 13:22:34,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:34,398 INFO L225 Difference]: With dead ends: 426 [2020-10-16 13:22:34,399 INFO L226 Difference]: Without dead ends: 426 [2020-10-16 13:22:34,399 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:22:34,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2020-10-16 13:22:34,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2020-10-16 13:22:34,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2020-10-16 13:22:34,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1265 transitions. [2020-10-16 13:22:34,414 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1265 transitions. Word has length 11 [2020-10-16 13:22:34,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:34,415 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 1265 transitions. [2020-10-16 13:22:34,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 13:22:34,415 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1265 transitions. [2020-10-16 13:22:34,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 13:22:34,419 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:34,419 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:34,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 13:22:34,420 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:34,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:34,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1194181749, now seen corresponding path program 2 times [2020-10-16 13:22:34,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:34,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434715221] [2020-10-16 13:22:34,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:34,517 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-16 13:22:34,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434715221] [2020-10-16 13:22:34,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:34,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:22:34,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1749078991] [2020-10-16 13:22:34,519 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:34,520 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:34,523 INFO L258 McrAutomatonBuilder]: Finished intersection with 18 states and 23 transitions. [2020-10-16 13:22:34,523 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:34,539 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:34,540 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 13:22:34,540 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:34,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 13:22:34,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:22:34,541 INFO L87 Difference]: Start difference. First operand 426 states and 1265 transitions. Second operand 5 states. [2020-10-16 13:22:34,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:34,589 INFO L93 Difference]: Finished difference Result 414 states and 1224 transitions. [2020-10-16 13:22:34,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:22:34,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-16 13:22:34,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:34,594 INFO L225 Difference]: With dead ends: 414 [2020-10-16 13:22:34,594 INFO L226 Difference]: Without dead ends: 414 [2020-10-16 13:22:34,595 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 13:22:34,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2020-10-16 13:22:34,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 410. [2020-10-16 13:22:34,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-10-16 13:22:34,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1213 transitions. [2020-10-16 13:22:34,611 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1213 transitions. Word has length 11 [2020-10-16 13:22:34,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:34,611 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 1213 transitions. [2020-10-16 13:22:34,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 13:22:34,611 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1213 transitions. [2020-10-16 13:22:34,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 13:22:34,612 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:34,613 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:34,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 13:22:34,613 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:34,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:34,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1674135591, now seen corresponding path program 1 times [2020-10-16 13:22:34,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:34,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663577999] [2020-10-16 13:22:34,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:34,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:34,776 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-16 13:22:34,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663577999] [2020-10-16 13:22:34,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:34,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 13:22:34,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [212680869] [2020-10-16 13:22:34,777 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:34,779 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:34,782 INFO L258 McrAutomatonBuilder]: Finished intersection with 19 states and 24 transitions. [2020-10-16 13:22:34,782 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:34,794 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:34,795 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:34,801 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:34,807 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:34,810 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:22:34,864 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [9333#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))))] [2020-10-16 13:22:34,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:22:34,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:34,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:22:34,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:22:34,865 INFO L87 Difference]: Start difference. First operand 410 states and 1213 transitions. Second operand 7 states. [2020-10-16 13:22:34,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:34,997 INFO L93 Difference]: Finished difference Result 434 states and 1271 transitions. [2020-10-16 13:22:34,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 13:22:34,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-10-16 13:22:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:35,002 INFO L225 Difference]: With dead ends: 434 [2020-10-16 13:22:35,002 INFO L226 Difference]: Without dead ends: 434 [2020-10-16 13:22:35,004 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-16 13:22:35,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-10-16 13:22:35,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 426. [2020-10-16 13:22:35,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2020-10-16 13:22:35,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 1253 transitions. [2020-10-16 13:22:35,021 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 1253 transitions. Word has length 12 [2020-10-16 13:22:35,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:35,021 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 1253 transitions. [2020-10-16 13:22:35,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:22:35,021 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 1253 transitions. [2020-10-16 13:22:35,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 13:22:35,023 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:35,023 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:35,023 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 13:22:35,023 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:35,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:35,023 INFO L82 PathProgramCache]: Analyzing trace with hash 358553942, now seen corresponding path program 1 times [2020-10-16 13:22:35,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:35,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083144878] [2020-10-16 13:22:35,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:35,340 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-16 13:22:35,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083144878] [2020-10-16 13:22:35,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:35,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 13:22:35,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1175680099] [2020-10-16 13:22:35,342 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:35,344 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:35,349 INFO L258 McrAutomatonBuilder]: Finished intersection with 18 states and 21 transitions. [2020-10-16 13:22:35,349 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:35,361 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:35,362 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:35,363 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:35,372 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:35,375 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-16 13:22:35,386 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:35,388 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:35,392 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:22:35,409 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:35,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 13:22:35,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:35,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 13:22:35,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 13:22:35,411 INFO L87 Difference]: Start difference. First operand 426 states and 1253 transitions. Second operand 7 states. [2020-10-16 13:22:35,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:35,531 INFO L93 Difference]: Finished difference Result 510 states and 1504 transitions. [2020-10-16 13:22:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 13:22:35,533 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-10-16 13:22:35,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:35,537 INFO L225 Difference]: With dead ends: 510 [2020-10-16 13:22:35,537 INFO L226 Difference]: Without dead ends: 510 [2020-10-16 13:22:35,537 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-16 13:22:35,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2020-10-16 13:22:35,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 486. [2020-10-16 13:22:35,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2020-10-16 13:22:35,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1422 transitions. [2020-10-16 13:22:35,552 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1422 transitions. Word has length 13 [2020-10-16 13:22:35,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:35,552 INFO L481 AbstractCegarLoop]: Abstraction has 486 states and 1422 transitions. [2020-10-16 13:22:35,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 13:22:35,553 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1422 transitions. [2020-10-16 13:22:35,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 13:22:35,554 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:35,554 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:35,554 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 13:22:35,554 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:35,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:35,555 INFO L82 PathProgramCache]: Analyzing trace with hash 358593932, now seen corresponding path program 2 times [2020-10-16 13:22:35,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:35,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25199558] [2020-10-16 13:22:35,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:35,803 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-16 13:22:35,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25199558] [2020-10-16 13:22:35,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:35,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 13:22:35,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [208650952] [2020-10-16 13:22:35,805 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:35,806 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:35,809 INFO L258 McrAutomatonBuilder]: Finished intersection with 20 states and 25 transitions. [2020-10-16 13:22:35,810 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:35,823 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:35,824 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-16 13:22:35,839 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-16 13:22:35,843 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-16 13:22:35,845 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-16 13:22:35,901 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [12122#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= ~y$w_buff1~0 0) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (<= ~y$r_buff0_thd2~0 (* 256 (div ~y$r_buff0_thd2~0 256))) (< 0 (+ (div ~y$r_buff0_thd2~0 256) 1)))] [2020-10-16 13:22:35,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 13:22:35,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:35,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 13:22:35,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 13:22:35,902 INFO L87 Difference]: Start difference. First operand 486 states and 1422 transitions. Second operand 8 states. [2020-10-16 13:22:36,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:36,093 INFO L93 Difference]: Finished difference Result 542 states and 1532 transitions. [2020-10-16 13:22:36,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 13:22:36,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2020-10-16 13:22:36,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:36,098 INFO L225 Difference]: With dead ends: 542 [2020-10-16 13:22:36,098 INFO L226 Difference]: Without dead ends: 470 [2020-10-16 13:22:36,098 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-16 13:22:36,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2020-10-16 13:22:36,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 386. [2020-10-16 13:22:36,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-10-16 13:22:36,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1107 transitions. [2020-10-16 13:22:36,111 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1107 transitions. Word has length 13 [2020-10-16 13:22:36,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:36,112 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 1107 transitions. [2020-10-16 13:22:36,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 13:22:36,112 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1107 transitions. [2020-10-16 13:22:36,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 13:22:36,113 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:36,113 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:36,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 13:22:36,114 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:36,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:36,116 INFO L82 PathProgramCache]: Analyzing trace with hash 359870388, now seen corresponding path program 1 times [2020-10-16 13:22:36,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:36,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214765664] [2020-10-16 13:22:36,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:36,203 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-16 13:22:36,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214765664] [2020-10-16 13:22:36,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:36,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 13:22:36,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1799810069] [2020-10-16 13:22:36,204 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:36,206 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:36,212 INFO L258 McrAutomatonBuilder]: Finished intersection with 21 states and 27 transitions. [2020-10-16 13:22:36,212 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:36,235 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-16 13:22:36,252 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [13445#(= (mod ~main$tmp_guard0~0 256) 0), 13446#(not (= 3 ~__unbuffered_cnt~0))] [2020-10-16 13:22:36,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 13:22:36,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:36,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 13:22:36,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 13:22:36,253 INFO L87 Difference]: Start difference. First operand 386 states and 1107 transitions. Second operand 6 states. [2020-10-16 13:22:36,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:36,305 INFO L93 Difference]: Finished difference Result 283 states and 721 transitions. [2020-10-16 13:22:36,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 13:22:36,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-16 13:22:36,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:36,307 INFO L225 Difference]: With dead ends: 283 [2020-10-16 13:22:36,307 INFO L226 Difference]: Without dead ends: 183 [2020-10-16 13:22:36,307 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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-16 13:22:36,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-10-16 13:22:36,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2020-10-16 13:22:36,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-10-16 13:22:36,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 406 transitions. [2020-10-16 13:22:36,313 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 406 transitions. Word has length 13 [2020-10-16 13:22:36,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:36,313 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 406 transitions. [2020-10-16 13:22:36,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 13:22:36,313 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 406 transitions. [2020-10-16 13:22:36,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 13:22:36,314 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:36,314 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:36,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 13:22:36,315 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:36,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:36,315 INFO L82 PathProgramCache]: Analyzing trace with hash 329564957, now seen corresponding path program 1 times [2020-10-16 13:22:36,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:36,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905450060] [2020-10-16 13:22:36,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:36,384 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-16 13:22:36,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905450060] [2020-10-16 13:22:36,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:36,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 13:22:36,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1111857039] [2020-10-16 13:22:36,386 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:36,388 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:36,392 INFO L258 McrAutomatonBuilder]: Finished intersection with 21 states and 24 transitions. [2020-10-16 13:22:36,392 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:36,403 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:36,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 13:22:36,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:36,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 13:22:36,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 13:22:36,404 INFO L87 Difference]: Start difference. First operand 183 states and 406 transitions. Second operand 3 states. [2020-10-16 13:22:36,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:36,421 INFO L93 Difference]: Finished difference Result 258 states and 551 transitions. [2020-10-16 13:22:36,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 13:22:36,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-10-16 13:22:36,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:36,423 INFO L225 Difference]: With dead ends: 258 [2020-10-16 13:22:36,424 INFO L226 Difference]: Without dead ends: 180 [2020-10-16 13:22:36,424 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-16 13:22:36,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-10-16 13:22:36,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2020-10-16 13:22:36,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2020-10-16 13:22:36,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 364 transitions. [2020-10-16 13:22:36,429 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 364 transitions. Word has length 16 [2020-10-16 13:22:36,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:36,430 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 364 transitions. [2020-10-16 13:22:36,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 13:22:36,430 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 364 transitions. [2020-10-16 13:22:36,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 13:22:36,431 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:36,431 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:36,432 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 13:22:36,432 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:36,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:36,432 INFO L82 PathProgramCache]: Analyzing trace with hash -85316920, now seen corresponding path program 1 times [2020-10-16 13:22:36,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:36,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197099398] [2020-10-16 13:22:36,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 13:22:36,509 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-16 13:22:36,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197099398] [2020-10-16 13:22:36,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 13:22:36,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 13:22:36,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1132342559] [2020-10-16 13:22:36,511 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-16 13:22:36,513 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-16 13:22:36,518 INFO L258 McrAutomatonBuilder]: Finished intersection with 29 states and 39 transitions. [2020-10-16 13:22:36,519 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-16 13:22:36,560 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-16 13:22:36,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 13:22:36,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 13:22:36,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 13:22:36,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 13:22:36,561 INFO L87 Difference]: Start difference. First operand 178 states and 364 transitions. Second operand 6 states. [2020-10-16 13:22:36,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 13:22:36,612 INFO L93 Difference]: Finished difference Result 161 states and 330 transitions. [2020-10-16 13:22:36,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 13:22:36,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-16 13:22:36,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 13:22:36,614 INFO L225 Difference]: With dead ends: 161 [2020-10-16 13:22:36,614 INFO L226 Difference]: Without dead ends: 85 [2020-10-16 13:22:36,614 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-16 13:22:36,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-10-16 13:22:36,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-10-16 13:22:36,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-10-16 13:22:36,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 168 transitions. [2020-10-16 13:22:36,617 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 168 transitions. Word has length 17 [2020-10-16 13:22:36,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 13:22:36,618 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 168 transitions. [2020-10-16 13:22:36,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 13:22:36,618 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 168 transitions. [2020-10-16 13:22:36,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 13:22:36,619 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 13:22:36,619 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 13:22:36,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 13:22:36,619 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 13:22:36,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 13:22:36,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1585187057, now seen corresponding path program 1 times [2020-10-16 13:22:36,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 13:22:36,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822374932] [2020-10-16 13:22:36,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 13:22:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:22:36,656 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:22:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 13:22:36,687 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 13:22:36,719 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 13:22:36,720 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 13:22:36,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 13:22:36,721 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 13:22:36,731 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L810-->L818: Formula: (let ((.cse7 (= (mod ~y$r_buff1_thd0~0_In238244464 256) 0)) (.cse6 (= (mod ~y$w_buff1_used~0_In238244464 256) 0)) (.cse8 (= (mod ~y$w_buff0_used~0_In238244464 256) 0)) (.cse9 (= (mod ~y$r_buff0_thd0~0_In238244464 256) 0))) (let ((.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse0 (or .cse8 .cse9)) (.cse5 (or .cse7 .cse6)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (or (and (= ~y$w_buff0_used~0_In238244464 ~y$w_buff0_used~0_Out238244464) .cse0) (and .cse1 (= ~y$w_buff0_used~0_Out238244464 0) .cse2)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_Out238244464| ULTIMATE.start_assume_abort_if_not_~cond_Out238244464) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out238244464 0)) (= ~y$r_buff0_thd0~0_Out238244464 ~y$r_buff0_thd0~0_In238244464) (or (and .cse1 (= ~y$w_buff0~0_In238244464 ~y~0_Out238244464) .cse2) (and .cse0 (or (and .cse3 (= ~y~0_Out238244464 ~y$w_buff1~0_In238244464) .cse4) (and (= ~y~0_Out238244464 ~y~0_In238244464) .cse5)))) (= ~y$r_buff1_thd0~0_Out238244464 ~y$r_buff1_thd0~0_In238244464) (or (and (= ~y$w_buff1_used~0_In238244464 ~y$w_buff1_used~0_Out238244464) .cse5) (and .cse3 (= ~y$w_buff1_used~0_Out238244464 0) .cse4)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_Out238244464| (mod ~main$tmp_guard0~0_In238244464 256))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In238244464, ~y$w_buff1~0=~y$w_buff1~0_In238244464, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In238244464, ~y$w_buff0~0=~y$w_buff0~0_In238244464, ~main$tmp_guard0~0=~main$tmp_guard0~0_In238244464, ~y~0=~y~0_In238244464, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In238244464, ~y$w_buff1_used~0=~y$w_buff1_used~0_In238244464} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out238244464, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out238244464|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out238244464|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out238244464|, ~main$tmp_guard0~0=~main$tmp_guard0~0_In238244464, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out238244464|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out238244464|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out238244464|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_Out238244464|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out238244464, ~y$w_buff1~0=~y$w_buff1~0_In238244464, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out238244464, ~y$w_buff0~0=~y$w_buff0~0_In238244464, ~y~0=~y~0_Out238244464, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out238244464, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out238244464} AuxVars[] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_assume_abort_if_not_~cond, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 13:22:36,736 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-16 13:22:36,736 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:36,738 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-16 13:22:36,738 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:36,739 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-16 13:22:36,739 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:36,739 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-16 13:22:36,739 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:36,739 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-16 13:22:36,739 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:36,740 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-16 13:22:36,740 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:36,740 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-16 13:22:36,740 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:36,741 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-16 13:22:36,741 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:36,741 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-16 13:22:36,741 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:36,741 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-16 13:22:36,742 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:36,742 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-16 13:22:36,742 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:36,742 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-16 13:22:36,743 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:36,743 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-16 13:22:36,743 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:36,743 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-16 13:22:36,743 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:36,743 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-16 13:22:36,744 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:36,744 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-16 13:22:36,744 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:36,744 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-16 13:22:36,744 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:36,744 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-16 13:22:36,745 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:36,745 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-16 13:22:36,745 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:36,745 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-16 13:22:36,745 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:36,745 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-16 13:22:36,746 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:36,746 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-16 13:22:36,746 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:36,746 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-16 13:22:36,746 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:36,747 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-16 13:22:36,747 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:36,747 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-16 13:22:36,747 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:36,747 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-16 13:22:36,747 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 13:22:36,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:22:36 BasicIcfg [2020-10-16 13:22:36,836 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 13:22:36,838 INFO L168 Benchmark]: Toolchain (without parser) took 15397.20 ms. Allocated memory was 147.8 MB in the beginning and 399.5 MB in the end (delta: 251.7 MB). Free memory was 101.4 MB in the beginning and 268.8 MB in the end (delta: -167.4 MB). Peak memory consumption was 84.3 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:36,839 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 147.8 MB. Free memory was 121.1 MB in the beginning and 120.7 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. [2020-10-16 13:22:36,841 INFO L168 Benchmark]: CACSL2BoogieTranslator took 742.84 ms. Allocated memory was 147.8 MB in the beginning and 202.9 MB in the end (delta: 55.1 MB). Free memory was 101.0 MB in the beginning and 157.6 MB in the end (delta: -56.6 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:36,842 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.04 ms. Allocated memory is still 202.9 MB. Free memory was 157.6 MB in the beginning and 154.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:36,843 INFO L168 Benchmark]: Boogie Preprocessor took 37.74 ms. Allocated memory is still 202.9 MB. Free memory was 154.8 MB in the beginning and 152.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:36,844 INFO L168 Benchmark]: RCFGBuilder took 1863.19 ms. Allocated memory was 202.9 MB in the beginning and 246.4 MB in the end (delta: 43.5 MB). Free memory was 152.0 MB in the beginning and 189.4 MB in the end (delta: -37.5 MB). Peak memory consumption was 101.0 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:36,847 INFO L168 Benchmark]: TraceAbstraction took 12683.73 ms. Allocated memory was 246.4 MB in the beginning and 399.5 MB in the end (delta: 153.1 MB). Free memory was 189.4 MB in the beginning and 268.8 MB in the end (delta: -79.4 MB). Peak memory consumption was 73.7 MB. Max. memory is 7.1 GB. [2020-10-16 13:22:36,855 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 147.8 MB. Free memory was 121.1 MB in the beginning and 120.7 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 742.84 ms. Allocated memory was 147.8 MB in the beginning and 202.9 MB in the end (delta: 55.1 MB). Free memory was 101.0 MB in the beginning and 157.6 MB in the end (delta: -56.6 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.04 ms. Allocated memory is still 202.9 MB. Free memory was 157.6 MB in the beginning and 154.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.74 ms. Allocated memory is still 202.9 MB. Free memory was 154.8 MB in the beginning and 152.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1863.19 ms. Allocated memory was 202.9 MB in the beginning and 246.4 MB in the end (delta: 43.5 MB). Free memory was 152.0 MB in the beginning and 189.4 MB in the end (delta: -37.5 MB). Peak memory consumption was 101.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12683.73 ms. Allocated memory was 246.4 MB in the beginning and 399.5 MB in the end (delta: 153.1 MB). Free memory was 189.4 MB in the beginning and 268.8 MB in the end (delta: -79.4 MB). Peak memory consumption was 73.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 801 VarBasedMoverChecksPositive, 33 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 55 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.1s, 99 PlacesBefore, 35 PlacesAfterwards, 91 TransitionsBefore, 25 TransitionsAfterwards, 1536 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 80 TotalNumberOfCompositions, 4174 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L701] 0 _Bool main$tmp_guard0; [L702] 0 _Bool main$tmp_guard1; [L704] 0 int x = 0; [L706] 0 int y = 0; [L707] 0 _Bool y$flush_delayed; [L708] 0 int y$mem_tmp; [L709] 0 _Bool y$r_buff0_thd0; [L710] 0 _Bool y$r_buff0_thd1; [L711] 0 _Bool y$r_buff0_thd2; [L712] 0 _Bool y$r_buff0_thd3; [L713] 0 _Bool y$r_buff1_thd0; [L714] 0 _Bool y$r_buff1_thd1; [L715] 0 _Bool y$r_buff1_thd2; [L716] 0 _Bool y$r_buff1_thd3; [L717] 0 _Bool y$read_delayed; [L718] 0 int *y$read_delayed_var; [L719] 0 int y$w_buff0; [L720] 0 _Bool y$w_buff0_used; [L721] 0 int y$w_buff1; [L722] 0 _Bool y$w_buff1_used; [L724] 0 int z = 0; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1492; [L803] FCALL, FORK 0 pthread_create(&t1492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 0 pthread_t t1493; [L805] FCALL, FORK 0 pthread_create(&t1493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 0 pthread_t t1494; [L807] FCALL, FORK 0 pthread_create(&t1494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] 3 y$w_buff1 = y$w_buff0 [L766] 3 y$w_buff0 = 2 [L767] 3 y$w_buff1_used = y$w_buff0_used [L768] 3 y$w_buff0_used = (_Bool)1 [L7] COND FALSE 3 !(!expression) [L770] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L771] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L772] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L773] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L774] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L730] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L740] 1 return 0; [L745] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L751] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L752] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L752] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L753] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L753] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L754] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L755] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L758] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 2 return 0; [L780] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L780] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L781] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L781] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L782] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L784] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L784] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L787] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 3 return 0; [L809] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L821] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L822] 0 y$flush_delayed = weak$$choice2 [L823] 0 y$mem_tmp = y [L824] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L824] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L824] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0 [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L825] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L825] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L826] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L826] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L827] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L827] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L828] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L829] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L830] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L831] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L832] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L832] 0 y = y$flush_delayed ? y$mem_tmp : y [L833] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 90 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.4s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.2s, HoareTripleCheckerStatistics: 256 SDtfs, 332 SDslu, 339 SDs, 0 SdLazy, 205 SolverSat, 97 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 122 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 131 ConstructedInterpolants, 0 QuantifiedInterpolants, 16241 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...