/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/mix038_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 00:15:39,192 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 00:15:39,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 00:15:39,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 00:15:39,219 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 00:15:39,220 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 00:15:39,221 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 00:15:39,223 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 00:15:39,225 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 00:15:39,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 00:15:39,226 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 00:15:39,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 00:15:39,228 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 00:15:39,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 00:15:39,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 00:15:39,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 00:15:39,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 00:15:39,232 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 00:15:39,234 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 00:15:39,236 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 00:15:39,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 00:15:39,238 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 00:15:39,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 00:15:39,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 00:15:39,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 00:15:39,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 00:15:39,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 00:15:39,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 00:15:39,244 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 00:15:39,245 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 00:15:39,245 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 00:15:39,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 00:15:39,246 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 00:15:39,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 00:15:39,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 00:15:39,248 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 00:15:39,248 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 00:15:39,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 00:15:39,249 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 00:15:39,249 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 00:15:39,255 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 00:15:39,256 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-22 00:15:39,295 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 00:15:39,295 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 00:15:39,297 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 00:15:39,297 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 00:15:39,297 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 00:15:39,298 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 00:15:39,298 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 00:15:39,298 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 00:15:39,299 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 00:15:39,299 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 00:15:39,300 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 00:15:39,300 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 00:15:39,300 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 00:15:39,300 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 00:15:39,301 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 00:15:39,301 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 00:15:39,301 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 00:15:39,301 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 00:15:39,302 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 00:15:39,302 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 00:15:39,302 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 00:15:39,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 00:15:39,302 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 00:15:39,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 00:15:39,303 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 00:15:39,303 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 00:15:39,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 00:15:39,303 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 00:15:39,304 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 00:15:39,304 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 00:15:39,304 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 00:15:39,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 00:15:39,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 00:15:39,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 00:15:39,628 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 00:15:39,628 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 00:15:39,629 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2020-10-22 00:15:39,692 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd62baba/c99422f5aea44b4aa3fffdfdba6b39c9/FLAGdb453d1b7 [2020-10-22 00:15:40,211 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 00:15:40,212 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2020-10-22 00:15:40,234 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd62baba/c99422f5aea44b4aa3fffdfdba6b39c9/FLAGdb453d1b7 [2020-10-22 00:15:40,507 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd62baba/c99422f5aea44b4aa3fffdfdba6b39c9 [2020-10-22 00:15:40,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 00:15:40,525 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 00:15:40,526 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 00:15:40,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 00:15:40,530 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 00:15:40,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:15:40" (1/1) ... [2020-10-22 00:15:40,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e26948c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:15:40, skipping insertion in model container [2020-10-22 00:15:40,534 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:15:40" (1/1) ... [2020-10-22 00:15:40,541 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 00:15:40,584 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 00:15:41,062 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:15:41,081 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 00:15:41,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:15:41,227 INFO L208 MainTranslator]: Completed translation [2020-10-22 00:15:41,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:15:41 WrapperNode [2020-10-22 00:15:41,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 00:15:41,228 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 00:15:41,229 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 00:15:41,229 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 00:15:41,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:15:41" (1/1) ... [2020-10-22 00:15:41,257 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:15:41" (1/1) ... [2020-10-22 00:15:41,294 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 00:15:41,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 00:15:41,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 00:15:41,295 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 00:15:41,311 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:15:41" (1/1) ... [2020-10-22 00:15:41,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:15:41" (1/1) ... [2020-10-22 00:15:41,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:15:41" (1/1) ... [2020-10-22 00:15:41,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:15:41" (1/1) ... [2020-10-22 00:15:41,348 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:15:41" (1/1) ... [2020-10-22 00:15:41,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:15:41" (1/1) ... [2020-10-22 00:15:41,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:15:41" (1/1) ... [2020-10-22 00:15:41,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 00:15:41,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 00:15:41,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 00:15:41,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 00:15:41,376 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:15:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 00:15:41,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 00:15:41,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 00:15:41,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 00:15:41,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 00:15:41,442 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 00:15:41,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 00:15:41,442 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 00:15:41,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 00:15:41,442 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 00:15:41,443 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 00:15:41,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 00:15:41,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 00:15:41,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 00:15:41,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 00:15:41,445 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 00:15:43,437 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 00:15:43,437 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 00:15:43,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:15:43 BoogieIcfgContainer [2020-10-22 00:15:43,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 00:15:43,441 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 00:15:43,441 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 00:15:43,445 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 00:15:43,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 12:15:40" (1/3) ... [2020-10-22 00:15:43,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6305260f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:15:43, skipping insertion in model container [2020-10-22 00:15:43,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:15:41" (2/3) ... [2020-10-22 00:15:43,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6305260f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:15:43, skipping insertion in model container [2020-10-22 00:15:43,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:15:43" (3/3) ... [2020-10-22 00:15:43,448 INFO L111 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2020-10-22 00:15:43,460 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 00:15:43,460 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 00:15:43,467 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 00:15:43,468 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 00:15:43,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,497 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,498 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,498 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,500 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,500 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,501 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,501 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,501 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,503 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,506 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,506 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,512 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,514 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,518 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,518 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,520 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,520 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,521 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,522 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,522 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,522 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,523 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:15:43,524 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 00:15:43,537 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-22 00:15:43,557 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 00:15:43,558 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 00:15:43,558 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 00:15:43,558 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 00:15:43,558 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 00:15:43,558 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 00:15:43,558 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 00:15:43,559 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 00:15:43,572 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 00:15:43,573 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 106 transitions, 227 flow [2020-10-22 00:15:43,575 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 106 transitions, 227 flow [2020-10-22 00:15:43,577 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 113 places, 106 transitions, 227 flow [2020-10-22 00:15:43,625 INFO L129 PetriNetUnfolder]: 3/103 cut-off events. [2020-10-22 00:15:43,625 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 00:15:43,633 INFO L80 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 3/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2020-10-22 00:15:43,640 INFO L116 LiptonReduction]: Number of co-enabled transitions 2046 [2020-10-22 00:15:44,975 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-22 00:15:45,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-22 00:15:45,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:15:45,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-22 00:15:45,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 00:15:45,790 WARN L193 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-22 00:15:46,171 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-22 00:15:46,827 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-22 00:15:48,221 WARN L193 SmtUtils]: Spent 633.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 111 [2020-10-22 00:15:48,536 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-22 00:15:49,408 WARN L193 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 111 [2020-10-22 00:15:49,694 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-22 00:15:51,044 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 142 DAG size of output: 133 [2020-10-22 00:15:51,420 WARN L193 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-10-22 00:15:51,558 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-10-22 00:15:51,709 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-10-22 00:15:52,126 WARN L193 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 118 [2020-10-22 00:15:52,309 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-10-22 00:15:52,339 INFO L131 LiptonReduction]: Checked pairs total: 6054 [2020-10-22 00:15:52,339 INFO L133 LiptonReduction]: Total number of compositions: 98 [2020-10-22 00:15:52,346 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 27 transitions, 69 flow [2020-10-22 00:15:52,404 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 972 states. [2020-10-22 00:15:52,406 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states. [2020-10-22 00:15:52,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-22 00:15:52,412 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:15:52,413 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-22 00:15:52,414 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:15:52,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:15:52,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1067740349, now seen corresponding path program 1 times [2020-10-22 00:15:52,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:15:52,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569816651] [2020-10-22 00:15:52,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:15:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:15:52,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:15:52,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569816651] [2020-10-22 00:15:52,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:15:52,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:15:52,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [459143680] [2020-10-22 00:15:52,694 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:15:52,697 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:15:52,709 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-10-22 00:15:52,709 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:15:52,713 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:15:52,714 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:15:52,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:15:52,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:15:52,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:15:52,728 INFO L87 Difference]: Start difference. First operand 972 states. Second operand 3 states. [2020-10-22 00:15:52,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:15:52,828 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2020-10-22 00:15:52,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:15:52,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-22 00:15:52,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:15:52,855 INFO L225 Difference]: With dead ends: 812 [2020-10-22 00:15:52,855 INFO L226 Difference]: Without dead ends: 662 [2020-10-22 00:15:52,857 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:15:52,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2020-10-22 00:15:52,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2020-10-22 00:15:52,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2020-10-22 00:15:52,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 2060 transitions. [2020-10-22 00:15:52,967 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 2060 transitions. Word has length 5 [2020-10-22 00:15:52,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:15:52,968 INFO L481 AbstractCegarLoop]: Abstraction has 662 states and 2060 transitions. [2020-10-22 00:15:52,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:15:52,968 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 2060 transitions. [2020-10-22 00:15:52,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 00:15:52,969 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:15:52,969 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:15:52,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 00:15:52,970 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:15:52,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:15:52,971 INFO L82 PathProgramCache]: Analyzing trace with hash -863148055, now seen corresponding path program 1 times [2020-10-22 00:15:52,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:15:52,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605318887] [2020-10-22 00:15:52,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:15:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:15:53,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:15:53,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605318887] [2020-10-22 00:15:53,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:15:53,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:15:53,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [620758264] [2020-10-22 00:15:53,121 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:15:53,123 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:15:53,125 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 00:15:53,125 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:15:53,125 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:15:53,127 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:15:53,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:15:53,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:15:53,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:15:53,128 INFO L87 Difference]: Start difference. First operand 662 states and 2060 transitions. Second operand 3 states. [2020-10-22 00:15:53,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:15:53,166 INFO L93 Difference]: Finished difference Result 652 states and 2022 transitions. [2020-10-22 00:15:53,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:15:53,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-22 00:15:53,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:15:53,174 INFO L225 Difference]: With dead ends: 652 [2020-10-22 00:15:53,174 INFO L226 Difference]: Without dead ends: 652 [2020-10-22 00:15:53,175 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:15:53,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2020-10-22 00:15:53,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2020-10-22 00:15:53,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2020-10-22 00:15:53,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 2022 transitions. [2020-10-22 00:15:53,209 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 2022 transitions. Word has length 9 [2020-10-22 00:15:53,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:15:53,210 INFO L481 AbstractCegarLoop]: Abstraction has 652 states and 2022 transitions. [2020-10-22 00:15:53,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:15:53,210 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 2022 transitions. [2020-10-22 00:15:53,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 00:15:53,212 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:15:53,213 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:15:53,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 00:15:53,213 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:15:53,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:15:53,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1317300433, now seen corresponding path program 1 times [2020-10-22 00:15:53,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:15:53,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726863834] [2020-10-22 00:15:53,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:15:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:15:53,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:15:53,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726863834] [2020-10-22 00:15:53,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:15:53,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:15:53,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [845477723] [2020-10-22 00:15:53,303 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:15:53,305 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:15:53,309 INFO L252 McrAutomatonBuilder]: Finished intersection with 14 states and 16 transitions. [2020-10-22 00:15:53,311 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:15:53,389 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:15:53,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:15:53,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:15:53,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:15:53,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:15:53,391 INFO L87 Difference]: Start difference. First operand 652 states and 2022 transitions. Second operand 3 states. [2020-10-22 00:15:53,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:15:53,405 INFO L93 Difference]: Finished difference Result 612 states and 1880 transitions. [2020-10-22 00:15:53,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:15:53,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-22 00:15:53,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:15:53,411 INFO L225 Difference]: With dead ends: 612 [2020-10-22 00:15:53,411 INFO L226 Difference]: Without dead ends: 612 [2020-10-22 00:15:53,412 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:15:53,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2020-10-22 00:15:53,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2020-10-22 00:15:53,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2020-10-22 00:15:53,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1880 transitions. [2020-10-22 00:15:53,477 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1880 transitions. Word has length 10 [2020-10-22 00:15:53,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:15:53,477 INFO L481 AbstractCegarLoop]: Abstraction has 612 states and 1880 transitions. [2020-10-22 00:15:53,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:15:53,478 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1880 transitions. [2020-10-22 00:15:53,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 00:15:53,480 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:15:53,480 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:15:53,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 00:15:53,480 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:15:53,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:15:53,481 INFO L82 PathProgramCache]: Analyzing trace with hash -556602806, now seen corresponding path program 1 times [2020-10-22 00:15:53,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:15:53,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969491779] [2020-10-22 00:15:53,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:15:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:15:53,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:15:53,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969491779] [2020-10-22 00:15:53,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:15:53,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 00:15:53,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1347925976] [2020-10-22 00:15:53,577 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:15:53,579 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:15:53,581 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 19 transitions. [2020-10-22 00:15:53,581 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:15:53,610 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-22 00:15:53,610 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:15:53,611 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-22 00:15:53,612 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:15:53,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:15:53,614 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:15:53,628 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:15:53,640 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:15:53,641 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:15:53,651 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:15:53,772 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:15:53,772 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:15:53,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:15:53,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:15:53,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:15:53,773 INFO L87 Difference]: Start difference. First operand 612 states and 1880 transitions. Second operand 4 states. [2020-10-22 00:15:53,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:15:53,820 INFO L93 Difference]: Finished difference Result 604 states and 1850 transitions. [2020-10-22 00:15:53,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:15:53,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-22 00:15:53,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:15:53,825 INFO L225 Difference]: With dead ends: 604 [2020-10-22 00:15:53,826 INFO L226 Difference]: Without dead ends: 604 [2020-10-22 00:15:53,826 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-22 00:15:53,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2020-10-22 00:15:53,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2020-10-22 00:15:53,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2020-10-22 00:15:53,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1850 transitions. [2020-10-22 00:15:53,847 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1850 transitions. Word has length 11 [2020-10-22 00:15:53,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:15:53,848 INFO L481 AbstractCegarLoop]: Abstraction has 604 states and 1850 transitions. [2020-10-22 00:15:53,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:15:53,848 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1850 transitions. [2020-10-22 00:15:53,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 00:15:53,850 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:15:53,850 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:15:53,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 00:15:53,850 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:15:53,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:15:53,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1089626128, now seen corresponding path program 1 times [2020-10-22 00:15:53,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:15:53,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133780798] [2020-10-22 00:15:53,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:15:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:15:53,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:15:53,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133780798] [2020-10-22 00:15:53,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:15:53,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:15:53,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [406606874] [2020-10-22 00:15:53,945 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:15:53,947 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:15:53,951 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 36 transitions. [2020-10-22 00:15:53,951 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:15:53,974 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-22 00:15:53,974 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:15:53,975 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 00:15:53,975 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:15:53,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:15:53,982 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:15:53,982 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:15:53,991 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:15:53,998 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:15:54,002 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:15:54,007 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:15:54,299 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:15:54,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:15:54,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:15:54,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:15:54,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:15:54,300 INFO L87 Difference]: Start difference. First operand 604 states and 1850 transitions. Second operand 5 states. [2020-10-22 00:15:54,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:15:54,383 INFO L93 Difference]: Finished difference Result 620 states and 1894 transitions. [2020-10-22 00:15:54,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:15:54,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-22 00:15:54,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:15:54,388 INFO L225 Difference]: With dead ends: 620 [2020-10-22 00:15:54,388 INFO L226 Difference]: Without dead ends: 620 [2020-10-22 00:15:54,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:15:54,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2020-10-22 00:15:54,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2020-10-22 00:15:54,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2020-10-22 00:15:54,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1894 transitions. [2020-10-22 00:15:54,409 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 1894 transitions. Word has length 12 [2020-10-22 00:15:54,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:15:54,410 INFO L481 AbstractCegarLoop]: Abstraction has 620 states and 1894 transitions. [2020-10-22 00:15:54,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:15:54,410 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 1894 transitions. [2020-10-22 00:15:54,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 00:15:54,411 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:15:54,412 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:15:54,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 00:15:54,412 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:15:54,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:15:54,412 INFO L82 PathProgramCache]: Analyzing trace with hash 926109962, now seen corresponding path program 1 times [2020-10-22 00:15:54,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:15:54,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033519593] [2020-10-22 00:15:54,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:15:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:15:54,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:15:54,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033519593] [2020-10-22 00:15:54,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:15:54,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:15:54,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [988283455] [2020-10-22 00:15:54,551 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:15:54,553 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:15:54,558 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 61 transitions. [2020-10-22 00:15:54,559 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:15:54,575 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-22 00:15:54,575 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:15:54,576 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 00:15:54,576 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:15:54,577 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:15:54,588 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:15:54,590 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:15:54,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:15:54,598 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:15:54,605 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:15:54,609 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:15:54,612 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:15:54,616 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:15:54,620 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:15:54,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:15:54,627 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:15:54,628 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:15:54,635 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:15:55,284 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [11685#(and (= ~x$w_buff1~0 ~x$w_buff0~0) (= 0 ~x$w_buff1~0))] [2020-10-22 00:15:55,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 00:15:55,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:15:55,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 00:15:55,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:15:55,286 INFO L87 Difference]: Start difference. First operand 620 states and 1894 transitions. Second operand 6 states. [2020-10-22 00:15:55,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:15:55,406 INFO L93 Difference]: Finished difference Result 618 states and 1884 transitions. [2020-10-22 00:15:55,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:15:55,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-22 00:15:55,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:15:55,411 INFO L225 Difference]: With dead ends: 618 [2020-10-22 00:15:55,411 INFO L226 Difference]: Without dead ends: 618 [2020-10-22 00:15:55,412 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:15:55,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2020-10-22 00:15:55,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 608. [2020-10-22 00:15:55,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2020-10-22 00:15:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 1853 transitions. [2020-10-22 00:15:55,431 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 1853 transitions. Word has length 13 [2020-10-22 00:15:55,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:15:55,431 INFO L481 AbstractCegarLoop]: Abstraction has 608 states and 1853 transitions. [2020-10-22 00:15:55,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 00:15:55,431 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 1853 transitions. [2020-10-22 00:15:55,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 00:15:55,433 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:15:55,433 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:15:55,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 00:15:55,433 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:15:55,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:15:55,433 INFO L82 PathProgramCache]: Analyzing trace with hash -190918320, now seen corresponding path program 1 times [2020-10-22 00:15:55,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:15:55,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648872400] [2020-10-22 00:15:55,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:15:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:15:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:15:55,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648872400] [2020-10-22 00:15:55,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:15:55,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:15:55,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1269877563] [2020-10-22 00:15:55,550 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:15:55,553 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:15:55,564 INFO L252 McrAutomatonBuilder]: Finished intersection with 60 states and 128 transitions. [2020-10-22 00:15:55,564 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:15:55,581 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:15:55,583 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:15:55,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:15:55,586 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 00:15:55,586 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:15:55,588 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:15:55,593 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:15:55,600 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:15:55,605 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:15:56,597 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [13528#(and (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), 13529#(and (= 0 ~x$r_buff0_thd0~0) (= (* 256 (div ~x$w_buff1_used~0 256)) ~x$w_buff1_used~0) (= ~x$r_buff1_thd0~0 0))] [2020-10-22 00:15:56,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 00:15:56,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:15:56,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 00:15:56,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:15:56,599 INFO L87 Difference]: Start difference. First operand 608 states and 1853 transitions. Second operand 8 states. [2020-10-22 00:15:56,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:15:56,685 INFO L93 Difference]: Finished difference Result 674 states and 2040 transitions. [2020-10-22 00:15:56,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:15:56,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-10-22 00:15:56,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:15:56,691 INFO L225 Difference]: With dead ends: 674 [2020-10-22 00:15:56,691 INFO L226 Difference]: Without dead ends: 674 [2020-10-22 00:15:56,692 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:15:56,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2020-10-22 00:15:56,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 662. [2020-10-22 00:15:56,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2020-10-22 00:15:56,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 2012 transitions. [2020-10-22 00:15:56,711 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 2012 transitions. Word has length 14 [2020-10-22 00:15:56,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:15:56,712 INFO L481 AbstractCegarLoop]: Abstraction has 662 states and 2012 transitions. [2020-10-22 00:15:56,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 00:15:56,712 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 2012 transitions. [2020-10-22 00:15:56,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 00:15:56,713 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:15:56,714 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:15:56,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 00:15:56,714 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:15:56,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:15:56,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1553761681, now seen corresponding path program 1 times [2020-10-22 00:15:56,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:15:56,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104212033] [2020-10-22 00:15:56,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:15:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:15:56,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:15:56,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104212033] [2020-10-22 00:15:56,828 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:15:56,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:15:56,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [464371457] [2020-10-22 00:15:56,828 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:15:56,832 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:15:56,838 INFO L252 McrAutomatonBuilder]: Finished intersection with 32 states and 50 transitions. [2020-10-22 00:15:56,839 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:15:56,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:15:57,018 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:15:57,047 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:15:57,189 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:15:57,216 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [15532#(not (= 3 ~__unbuffered_cnt~0))] [2020-10-22 00:15:57,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:15:57,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:15:57,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:15:57,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:15:57,217 INFO L87 Difference]: Start difference. First operand 662 states and 2012 transitions. Second operand 5 states. [2020-10-22 00:15:57,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:15:57,294 INFO L93 Difference]: Finished difference Result 459 states and 1256 transitions. [2020-10-22 00:15:57,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:15:57,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-22 00:15:57,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:15:57,298 INFO L225 Difference]: With dead ends: 459 [2020-10-22 00:15:57,298 INFO L226 Difference]: Without dead ends: 283 [2020-10-22 00:15:57,298 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:15:57,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2020-10-22 00:15:57,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 257. [2020-10-22 00:15:57,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2020-10-22 00:15:57,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 602 transitions. [2020-10-22 00:15:57,307 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 602 transitions. Word has length 14 [2020-10-22 00:15:57,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:15:57,307 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 602 transitions. [2020-10-22 00:15:57,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:15:57,308 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 602 transitions. [2020-10-22 00:15:57,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-22 00:15:57,309 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:15:57,309 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:15:57,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 00:15:57,309 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:15:57,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:15:57,310 INFO L82 PathProgramCache]: Analyzing trace with hash -640826467, now seen corresponding path program 1 times [2020-10-22 00:15:57,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:15:57,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893672451] [2020-10-22 00:15:57,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:15:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:15:57,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:15:57,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893672451] [2020-10-22 00:15:57,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:15:57,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:15:57,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1020491295] [2020-10-22 00:15:57,513 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:15:57,517 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:15:57,525 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 48 transitions. [2020-10-22 00:15:57,525 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:15:57,740 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:15:57,740 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 00:15:57,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:15:57,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 00:15:57,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:15:57,741 INFO L87 Difference]: Start difference. First operand 257 states and 602 transitions. Second operand 6 states. [2020-10-22 00:15:57,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:15:57,806 INFO L93 Difference]: Finished difference Result 234 states and 554 transitions. [2020-10-22 00:15:57,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:15:57,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-22 00:15:57,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:15:57,809 INFO L225 Difference]: With dead ends: 234 [2020-10-22 00:15:57,810 INFO L226 Difference]: Without dead ends: 219 [2020-10-22 00:15:57,810 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:15:57,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-10-22 00:15:57,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 215. [2020-10-22 00:15:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2020-10-22 00:15:57,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 518 transitions. [2020-10-22 00:15:57,816 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 518 transitions. Word has length 18 [2020-10-22 00:15:57,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:15:57,816 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 518 transitions. [2020-10-22 00:15:57,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 00:15:57,817 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 518 transitions. [2020-10-22 00:15:57,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:15:57,818 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:15:57,818 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:15:57,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 00:15:57,818 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:15:57,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:15:57,818 INFO L82 PathProgramCache]: Analyzing trace with hash 555522264, now seen corresponding path program 1 times [2020-10-22 00:15:57,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:15:57,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523078743] [2020-10-22 00:15:57,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:15:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:15:57,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:15:57,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523078743] [2020-10-22 00:15:57,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:15:57,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 00:15:57,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1963516118] [2020-10-22 00:15:57,957 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:15:57,964 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:15:57,987 INFO L252 McrAutomatonBuilder]: Finished intersection with 70 states and 125 transitions. [2020-10-22 00:15:57,988 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:15:59,201 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [17191#(and (= ~__unbuffered_p2_EBX~0 1) (<= 1 ~__unbuffered_cnt~0) (<= ~__unbuffered_cnt~0 1)), 17192#(and (= ~__unbuffered_p2_EBX~0 1) (<= ~__unbuffered_cnt~0 0) (<= 0 ~__unbuffered_cnt~0))] [2020-10-22 00:15:59,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-22 00:15:59,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:15:59,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-22 00:15:59,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-10-22 00:15:59,203 INFO L87 Difference]: Start difference. First operand 215 states and 518 transitions. Second operand 11 states. [2020-10-22 00:15:59,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:15:59,399 INFO L93 Difference]: Finished difference Result 324 states and 733 transitions. [2020-10-22 00:15:59,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-22 00:15:59,400 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2020-10-22 00:15:59,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:15:59,402 INFO L225 Difference]: With dead ends: 324 [2020-10-22 00:15:59,402 INFO L226 Difference]: Without dead ends: 154 [2020-10-22 00:15:59,402 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2020-10-22 00:15:59,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-10-22 00:15:59,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 127. [2020-10-22 00:15:59,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2020-10-22 00:15:59,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 262 transitions. [2020-10-22 00:15:59,406 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 262 transitions. Word has length 22 [2020-10-22 00:15:59,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:15:59,406 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 262 transitions. [2020-10-22 00:15:59,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-22 00:15:59,406 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 262 transitions. [2020-10-22 00:15:59,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:15:59,407 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:15:59,407 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:15:59,407 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 00:15:59,408 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:15:59,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:15:59,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1118043544, now seen corresponding path program 2 times [2020-10-22 00:15:59,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:15:59,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198034005] [2020-10-22 00:15:59,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:15:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:15:59,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:15:59,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198034005] [2020-10-22 00:15:59,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:15:59,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:15:59,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [264154571] [2020-10-22 00:15:59,471 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:15:59,521 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:15:59,545 INFO L252 McrAutomatonBuilder]: Finished intersection with 88 states and 174 transitions. [2020-10-22 00:15:59,546 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:16:00,418 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:16:00,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:16:00,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:16:00,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:16:00,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:16:00,420 INFO L87 Difference]: Start difference. First operand 127 states and 262 transitions. Second operand 4 states. [2020-10-22 00:16:00,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:16:00,436 INFO L93 Difference]: Finished difference Result 141 states and 281 transitions. [2020-10-22 00:16:00,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 00:16:00,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-10-22 00:16:00,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:16:00,438 INFO L225 Difference]: With dead ends: 141 [2020-10-22 00:16:00,439 INFO L226 Difference]: Without dead ends: 107 [2020-10-22 00:16:00,439 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:16:00,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-22 00:16:00,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-10-22 00:16:00,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-22 00:16:00,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 222 transitions. [2020-10-22 00:16:00,442 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 222 transitions. Word has length 22 [2020-10-22 00:16:00,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:16:00,442 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 222 transitions. [2020-10-22 00:16:00,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:16:00,443 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 222 transitions. [2020-10-22 00:16:00,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:16:00,443 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:16:00,444 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:16:00,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 00:16:00,444 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:16:00,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:16:00,444 INFO L82 PathProgramCache]: Analyzing trace with hash -756344638, now seen corresponding path program 3 times [2020-10-22 00:16:00,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:16:00,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049618256] [2020-10-22 00:16:00,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:16:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:16:00,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:16:00,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049618256] [2020-10-22 00:16:00,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:16:00,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 00:16:00,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1323525349] [2020-10-22 00:16:00,692 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:16:00,698 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:16:00,715 INFO L252 McrAutomatonBuilder]: Finished intersection with 43 states and 62 transitions. [2020-10-22 00:16:00,716 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:16:00,907 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 97 [2020-10-22 00:16:00,915 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-22 00:16:00,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:00,917 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 00:16:00,917 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:00,919 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 00:16:00,919 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:00,921 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:16:00,922 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:00,923 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:00,924 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:16:00,935 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:00,936 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:00,937 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:16:00,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:16:00,944 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:00,948 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:00,952 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:16:00,954 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:00,963 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:00,974 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:00,977 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:00,980 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:00,985 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:16:00,995 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:00,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:01,002 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:01,006 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:16:01,010 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:16:01,014 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:01,017 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:01,020 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:16:01,027 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-22 00:16:01,027 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:01,173 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 101 [2020-10-22 00:16:01,191 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-22 00:16:01,191 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:01,192 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-22 00:16:01,192 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:01,193 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 00:16:01,194 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:01,195 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:16:01,195 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:01,197 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:16:01,197 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:01,198 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:01,199 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:01,202 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:01,203 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:01,204 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:16:01,205 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:01,212 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:16:01,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:01,223 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:01,227 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:16:01,228 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:01,229 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:16:01,232 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:01,236 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:16:01,242 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:01,244 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:01,245 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:01,250 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:01,252 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:01,252 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:01,253 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:01,254 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:01,257 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:01,264 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:01,266 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:01,268 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:16:01,269 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:01,269 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:16:01,272 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:16:01,280 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:01,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:01,285 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:01,296 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:01,297 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:16:01,304 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:01,306 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:16:01,307 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:16:01,308 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:16:01,310 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:16:01,317 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:16:01,318 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:16:01,318 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:16:01,328 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:16:01,436 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 00:16:01,437 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:01,438 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:16:01,438 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:01,439 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:01,440 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:16:01,441 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:16:01,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:16:01,445 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:01,445 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:16:01,464 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:01,465 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:16:01,473 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:01,474 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:16:01,476 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:01,480 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:16:01,484 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:01,487 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:01,490 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-22 00:16:01,490 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:16:01,913 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 00:16:01,913 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:01,914 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:01,915 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:16:01,917 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:01,917 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:01,929 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:01,930 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 00:16:01,954 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:01,987 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:16:02,000 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:16:02,016 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:02,094 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:16:02,125 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:16:02,139 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:02,199 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:16:02,217 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:02,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:02,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:02,223 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:02,229 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:02,230 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:02,232 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:02,233 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:16:02,241 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:02,242 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:02,246 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:02,249 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:02,253 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-22 00:16:02,253 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:16:02,556 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 00:16:02,557 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:02,558 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:16:02,559 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:02,560 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:16:02,561 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:16:02,567 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:02,568 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:16:02,569 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:16:02,573 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:02,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:16:02,594 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:02,595 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:02,600 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:16:02,601 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:02,608 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:16:02,615 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:02,616 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:16:02,623 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:02,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:02,629 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:16:02,633 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:16:02,644 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-10-22 00:16:02,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:16:02,858 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [18146#(and (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (or (and (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0))) (and (<= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (< 0 (+ (div ~x$w_buff0_used~0 256) 1)))) (= 0 ~x$w_buff1~0)), 18147#(or (and (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$w_buff0~0)) (not (= (mod ~x$w_buff0_used~0 256) 0)))] [2020-10-22 00:16:02,859 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-22 00:16:02,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:16:02,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-22 00:16:02,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-22 00:16:02,862 INFO L87 Difference]: Start difference. First operand 107 states and 222 transitions. Second operand 10 states. [2020-10-22 00:16:03,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:16:03,222 INFO L93 Difference]: Finished difference Result 145 states and 296 transitions. [2020-10-22 00:16:03,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-22 00:16:03,223 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-10-22 00:16:03,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:16:03,224 INFO L225 Difference]: With dead ends: 145 [2020-10-22 00:16:03,225 INFO L226 Difference]: Without dead ends: 99 [2020-10-22 00:16:03,226 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-10-22 00:16:03,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-10-22 00:16:03,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 85. [2020-10-22 00:16:03,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-10-22 00:16:03,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 170 transitions. [2020-10-22 00:16:03,231 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 170 transitions. Word has length 22 [2020-10-22 00:16:03,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:16:03,232 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 170 transitions. [2020-10-22 00:16:03,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-22 00:16:03,232 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 170 transitions. [2020-10-22 00:16:03,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:16:03,233 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:16:03,234 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:16:03,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 00:16:03,234 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:16:03,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:16:03,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1359969700, now seen corresponding path program 4 times [2020-10-22 00:16:03,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:16:03,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245371557] [2020-10-22 00:16:03,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:16:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:16:03,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:16:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:16:03,442 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:16:03,501 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 00:16:03,502 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 00:16:03,502 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-22 00:16:03,503 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 00:16:03,519 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1074] [1074] L2-->L846: Formula: (let ((.cse7 (= (mod ~x$w_buff1_used~0_In968693324 256) 0)) (.cse6 (= (mod ~x$r_buff1_thd0~0_In968693324 256) 0)) (.cse8 (= (mod ~x$r_buff0_thd0~0_In968693324 256) 0)) (.cse9 (= (mod ~x$w_buff0_used~0_In968693324 256) 0))) (let ((.cse3 (or .cse8 .cse9)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse1 (not .cse6)) (.cse2 (not .cse7)) (.cse0 (or .cse6 .cse7))) (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In968693324| ULTIMATE.start_assume_abort_if_not_~cond_Out968693324) (or (and (or (and (= ~x~0_Out968693324 ~x~0_In968693324) .cse0) (and .cse1 (= ~x~0_Out968693324 ~x$w_buff1~0_In968693324) .cse2)) .cse3) (and .cse4 (= ~x~0_Out968693324 ~x$w_buff0~0_In968693324) .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out968693324 0)) (= ~x$r_buff1_thd0~0_In968693324 ~x$r_buff1_thd0~0_Out968693324) (or (and (= ~x$w_buff0_used~0_In968693324 ~x$w_buff0_used~0_Out968693324) .cse3) (and .cse4 (= 0 ~x$w_buff0_used~0_Out968693324) .cse5)) (= ~x$r_buff0_thd0~0_In968693324 ~x$r_buff0_thd0~0_Out968693324) (or (and (= ~x$w_buff1_used~0_Out968693324 0) .cse1 .cse2) (and (= ~x$w_buff1_used~0_Out968693324 ~x$w_buff1_used~0_In968693324) .cse0))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In968693324, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In968693324, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In968693324|, ~x$w_buff1~0=~x$w_buff1~0_In968693324, ~x$w_buff1_used~0=~x$w_buff1_used~0_In968693324, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In968693324, ~x~0=~x~0_In968693324, ~x$w_buff0_used~0=~x$w_buff0_used~0_In968693324} OutVars{~x$w_buff0~0=~x$w_buff0~0_In968693324, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out968693324, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out968693324|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out968693324|, ~x$w_buff1~0=~x$w_buff1~0_In968693324, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out968693324, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out968693324|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out968693324|, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out968693324|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out968693324, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out968693324, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In968693324|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out968693324|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out968693324, ~x~0=~x~0_Out968693324} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite31, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] because there is no mapped edge [2020-10-22 00:16:03,528 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,528 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,529 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,529 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [766] [2020-10-22 00:16:03,533 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,533 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,533 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,533 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,533 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,534 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,534 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,534 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,535 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,535 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,535 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,535 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,536 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,536 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,536 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,537 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,537 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,538 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,538 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,538 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,539 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,539 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,539 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,539 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,539 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,539 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,539 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,544 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,544 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,544 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,545 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,545 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,545 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,545 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,545 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,545 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,545 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,546 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,546 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,546 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,546 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,546 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,547 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,547 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,547 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,547 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,548 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,548 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,548 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,548 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,548 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,549 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:16:03,549 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:16:03,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 12:16:03 BasicIcfg [2020-10-22 00:16:03,640 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 00:16:03,641 INFO L168 Benchmark]: Toolchain (without parser) took 23120.27 ms. Allocated memory was 146.8 MB in the beginning and 433.6 MB in the end (delta: 286.8 MB). Free memory was 100.1 MB in the beginning and 137.2 MB in the end (delta: -37.1 MB). Peak memory consumption was 249.6 MB. Max. memory is 7.1 GB. [2020-10-22 00:16:03,642 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 146.8 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-22 00:16:03,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 701.54 ms. Allocated memory was 146.8 MB in the beginning and 203.4 MB in the end (delta: 56.6 MB). Free memory was 99.0 MB in the beginning and 155.2 MB in the end (delta: -56.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2020-10-22 00:16:03,643 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.72 ms. Allocated memory is still 203.4 MB. Free memory was 155.2 MB in the beginning and 152.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-22 00:16:03,644 INFO L168 Benchmark]: Boogie Preprocessor took 79.79 ms. Allocated memory is still 203.4 MB. Free memory was 152.5 MB in the beginning and 149.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-22 00:16:03,644 INFO L168 Benchmark]: RCFGBuilder took 2065.60 ms. Allocated memory was 203.4 MB in the beginning and 248.0 MB in the end (delta: 44.6 MB). Free memory was 149.9 MB in the beginning and 162.2 MB in the end (delta: -12.3 MB). Peak memory consumption was 103.1 MB. Max. memory is 7.1 GB. [2020-10-22 00:16:03,645 INFO L168 Benchmark]: TraceAbstraction took 20198.33 ms. Allocated memory was 248.0 MB in the beginning and 433.6 MB in the end (delta: 185.6 MB). Free memory was 162.2 MB in the beginning and 137.2 MB in the end (delta: 25.0 MB). Peak memory consumption was 210.6 MB. Max. memory is 7.1 GB. [2020-10-22 00:16:03,649 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 146.8 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 701.54 ms. Allocated memory was 146.8 MB in the beginning and 203.4 MB in the end (delta: 56.6 MB). Free memory was 99.0 MB in the beginning and 155.2 MB in the end (delta: -56.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.72 ms. Allocated memory is still 203.4 MB. Free memory was 155.2 MB in the beginning and 152.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 79.79 ms. Allocated memory is still 203.4 MB. Free memory was 152.5 MB in the beginning and 149.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2065.60 ms. Allocated memory was 203.4 MB in the beginning and 248.0 MB in the end (delta: 44.6 MB). Free memory was 149.9 MB in the beginning and 162.2 MB in the end (delta: -12.3 MB). Peak memory consumption was 103.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20198.33 ms. Allocated memory was 248.0 MB in the beginning and 433.6 MB in the end (delta: 185.6 MB). Free memory was 162.2 MB in the beginning and 137.2 MB in the end (delta: 25.0 MB). Peak memory consumption was 210.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1159 VarBasedMoverChecksPositive, 42 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 89 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.7s, 113 PlacesBefore, 37 PlacesAfterwards, 106 TransitionsBefore, 27 TransitionsAfterwards, 2046 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 98 TotalNumberOfCompositions, 6054 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff0_thd3; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$read_delayed; [L733] 0 int *x$read_delayed_var; [L734] 0 int x$w_buff0; [L735] 0 _Bool x$w_buff0_used; [L736] 0 int x$w_buff1; [L737] 0 _Bool x$w_buff1_used; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L830] 0 pthread_t t1019; [L831] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L832] 0 pthread_t t1020; [L833] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 2 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L18] COND TRUE 2 !expression [L17] COND FALSE 2 !(0) [L17] 2 __assert_fail ("0", "mix038_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L776] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L834] 0 pthread_t t1021; [L835] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L799] 3 z = 1 [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L782] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L783] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L784] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L785] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L785] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L786] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L753] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L753] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L754] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L754] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L755] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L756] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L757] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L837] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L848] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L849] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L850] 0 x$flush_delayed = weak$$choice2 [L851] 0 x$mem_tmp = x [L852] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L852] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L853] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L853] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L853] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L853] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L854] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L854] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L855] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L855] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L855] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L855] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L855] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L855] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L856] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L856] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L856] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L856] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L857] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L857] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L857] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L857] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L858] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L858] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L860] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L860] 0 x = x$flush_delayed ? x$mem_tmp : x [L861] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix038_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 104 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 19.9s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.8s, HoareTripleCheckerStatistics: 329 SDtfs, 371 SDslu, 718 SDs, 0 SdLazy, 359 SolverSat, 135 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 235 SyntacticMatches, 10 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=972occurred 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, 93 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 23013 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...