/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 22:16:29,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 22:16:29,433 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 22:16:29,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 22:16:29,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 22:16:29,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 22:16:29,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 22:16:29,481 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 22:16:29,482 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 22:16:29,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 22:16:29,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 22:16:29,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 22:16:29,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 22:16:29,488 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 22:16:29,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 22:16:29,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 22:16:29,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 22:16:29,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 22:16:29,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 22:16:29,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 22:16:29,499 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 22:16:29,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 22:16:29,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 22:16:29,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 22:16:29,508 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 22:16:29,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 22:16:29,509 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 22:16:29,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 22:16:29,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 22:16:29,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 22:16:29,518 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 22:16:29,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 22:16:29,523 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 22:16:29,524 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 22:16:29,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 22:16:29,525 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 22:16:29,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 22:16:29,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 22:16:29,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 22:16:29,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 22:16:29,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 22:16:29,530 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-10-15 22:16:29,552 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 22:16:29,552 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 22:16:29,553 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 22:16:29,553 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 22:16:29,553 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 22:16:29,554 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 22:16:29,554 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 22:16:29,554 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 22:16:29,554 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 22:16:29,554 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 22:16:29,555 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 22:16:29,555 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 22:16:29,555 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 22:16:29,555 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 22:16:29,555 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 22:16:29,556 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 22:16:29,556 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 22:16:29,556 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 22:16:29,556 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 22:16:29,556 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 22:16:29,556 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 22:16:29,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 22:16:29,557 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 22:16:29,557 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 22:16:29,557 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 22:16:29,557 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 22:16:29,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 22:16:29,558 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 22:16:29,558 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 22:16:29,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 22:16:29,879 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 22:16:29,883 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 22:16:29,884 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 22:16:29,887 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 22:16:29,887 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i [2020-10-15 22:16:29,952 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e8640fb8/9ed61acf20eb40ba80ca82d9828529b6/FLAGa80ea23f1 [2020-10-15 22:16:30,421 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 22:16:30,422 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i [2020-10-15 22:16:30,437 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e8640fb8/9ed61acf20eb40ba80ca82d9828529b6/FLAGa80ea23f1 [2020-10-15 22:16:30,697 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e8640fb8/9ed61acf20eb40ba80ca82d9828529b6 [2020-10-15 22:16:30,705 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 22:16:30,707 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 22:16:30,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 22:16:30,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 22:16:30,713 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 22:16:30,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 10:16:30" (1/1) ... [2020-10-15 22:16:30,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@463b947c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:16:30, skipping insertion in model container [2020-10-15 22:16:30,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 10:16:30" (1/1) ... [2020-10-15 22:16:30,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 22:16:30,772 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 22:16:31,247 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 22:16:31,259 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 22:16:31,325 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 22:16:31,395 INFO L208 MainTranslator]: Completed translation [2020-10-15 22:16:31,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:16:31 WrapperNode [2020-10-15 22:16:31,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 22:16:31,397 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 22:16:31,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 22:16:31,397 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 22:16:31,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:16:31" (1/1) ... [2020-10-15 22:16:31,424 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:16:31" (1/1) ... [2020-10-15 22:16:31,461 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 22:16:31,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 22:16:31,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 22:16:31,462 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 22:16:31,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:16:31" (1/1) ... [2020-10-15 22:16:31,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:16:31" (1/1) ... [2020-10-15 22:16:31,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:16:31" (1/1) ... [2020-10-15 22:16:31,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:16:31" (1/1) ... [2020-10-15 22:16:31,485 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:16:31" (1/1) ... [2020-10-15 22:16:31,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:16:31" (1/1) ... [2020-10-15 22:16:31,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:16:31" (1/1) ... [2020-10-15 22:16:31,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 22:16:31,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 22:16:31,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 22:16:31,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 22:16:31,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:16:31" (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-15 22:16:31,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 22:16:31,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 22:16:31,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 22:16:31,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 22:16:31,585 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 22:16:31,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 22:16:31,586 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 22:16:31,587 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 22:16:31,587 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-15 22:16:31,588 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-15 22:16:31,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 22:16:31,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 22:16:31,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 22:16:31,592 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 22:16:33,383 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 22:16:33,383 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 22:16:33,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 10:16:33 BoogieIcfgContainer [2020-10-15 22:16:33,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 22:16:33,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 22:16:33,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 22:16:33,394 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 22:16:33,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 10:16:30" (1/3) ... [2020-10-15 22:16:33,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3a34f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 10:16:33, skipping insertion in model container [2020-10-15 22:16:33,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 10:16:31" (2/3) ... [2020-10-15 22:16:33,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3a34f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 10:16:33, skipping insertion in model container [2020-10-15 22:16:33,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 10:16:33" (3/3) ... [2020-10-15 22:16:33,399 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_pso.opt.i [2020-10-15 22:16:33,411 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 22:16:33,411 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 22:16:33,422 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 22:16:33,423 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 22:16:33,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,463 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,464 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,465 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,465 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,469 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,469 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,469 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,470 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,480 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,481 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,487 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,487 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,488 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,490 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,491 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 22:16:33,505 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-15 22:16:33,525 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 22:16:33,525 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 22:16:33,525 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 22:16:33,525 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 22:16:33,525 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 22:16:33,526 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 22:16:33,526 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 22:16:33,526 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 22:16:33,544 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 22:16:33,548 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 90 transitions, 195 flow [2020-10-15 22:16:33,551 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 90 transitions, 195 flow [2020-10-15 22:16:33,553 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 195 flow [2020-10-15 22:16:33,614 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2020-10-15 22:16:33,614 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 22:16:33,620 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 62 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-15 22:16:33,626 INFO L117 LiptonReduction]: Number of co-enabled transitions 1536 [2020-10-15 22:16:33,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 22:16:33,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:34,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 22:16:34,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:34,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:16:34,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 22:16:34,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:16:34,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 22:16:34,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:16:34,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 22:16:34,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:16:34,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,200 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 22:16:34,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:16:34,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 22:16:34,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:16:34,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 22:16:34,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:16:34,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 22:16:34,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:16:34,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 22:16:34,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:16:34,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 22:16:34,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:16:34,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 22:16:34,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:34,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:34,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 22:16:34,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 22:16:34,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 22:16:34,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:16:34,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 22:16:34,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:16:34,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 22:16:34,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 22:16:34,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 22:16:34,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:34,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:34,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:16:34,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 22:16:34,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-15 22:16:34,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 22:16:34,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 22:16:34,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:16:34,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 22:16:34,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 22:16:34,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 22:16:34,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 22:16:34,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-10-15 22:16:34,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:34,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 22:16:34,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:36,432 WARN L193 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-10-15 22:16:36,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-15 22:16:36,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:36,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-15 22:16:36,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:37,323 WARN L193 SmtUtils]: Spent 860.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2020-10-15 22:16:37,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:37,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:37,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:37,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:37,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:37,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:37,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:37,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:37,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:37,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:37,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:37,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:37,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:37,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:37,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:37,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:37,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:37,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:37,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:37,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:37,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:37,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:37,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:37,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:37,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:37,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:37,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:37,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:37,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:37,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:37,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:37,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:37,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:37,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:37,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:37,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:37,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:37,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:37,643 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:37,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:37,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:37,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:37,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:37,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:37,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:37,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:37,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:37,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:37,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:37,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:37,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:37,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:37,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:37,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:37,759 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:37,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:37,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:37,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:37,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:37,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:37,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:37,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:37,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:37,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:37,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 22:16:37,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:38,195 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-15 22:16:38,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:38,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:38,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:38,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:38,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:38,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:38,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:38,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:38,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:38,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:38,485 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:38,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:38,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:38,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:38,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:38,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:38,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:38,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:38,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:38,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:38,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:38,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:38,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:38,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:38,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:38,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:38,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:38,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:38,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:38,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:38,548 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:38,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:38,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:38,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:38,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:38,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:38,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:38,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:38,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:38,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:38,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:38,663 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:38,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:38,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:38,667 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:38,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:38,669 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:38,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:38,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:38,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:38,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:38,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:38,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:38,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:38,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:38,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 22:16:38,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:38,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:38,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:38,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 22:16:38,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 22:16:38,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:38,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 22:16:38,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 22:16:39,361 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-15 22:16:39,467 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-15 22:16:39,473 INFO L132 LiptonReduction]: Checked pairs total: 4033 [2020-10-15 22:16:39,473 INFO L134 LiptonReduction]: Total number of compositions: 75 [2020-10-15 22:16:39,480 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2020-10-15 22:16:39,532 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 770 states. [2020-10-15 22:16:39,535 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states. [2020-10-15 22:16:39,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-15 22:16:39,541 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:16:39,542 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:16:39,543 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:16:39,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:16:39,549 INFO L82 PathProgramCache]: Analyzing trace with hash -66047429, now seen corresponding path program 1 times [2020-10-15 22:16:39,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:16:39,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139902567] [2020-10-15 22:16:39,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:16:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:16:39,782 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-15 22:16:39,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139902567] [2020-10-15 22:16:39,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:16:39,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 22:16:39,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328274200] [2020-10-15 22:16:39,789 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 22:16:39,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:16:39,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 22:16:39,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 22:16:39,808 INFO L87 Difference]: Start difference. First operand 770 states. Second operand 3 states. [2020-10-15 22:16:39,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:16:39,895 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2020-10-15 22:16:39,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 22:16:39,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-15 22:16:39,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:16:39,920 INFO L225 Difference]: With dead ends: 650 [2020-10-15 22:16:39,920 INFO L226 Difference]: Without dead ends: 550 [2020-10-15 22:16:39,922 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-15 22:16:39,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-10-15 22:16:39,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2020-10-15 22:16:40,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2020-10-15 22:16:40,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1693 transitions. [2020-10-15 22:16:40,006 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1693 transitions. Word has length 7 [2020-10-15 22:16:40,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:16:40,007 INFO L481 AbstractCegarLoop]: Abstraction has 550 states and 1693 transitions. [2020-10-15 22:16:40,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 22:16:40,007 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1693 transitions. [2020-10-15 22:16:40,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-15 22:16:40,009 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:16:40,009 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:16:40,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 22:16:40,010 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:16:40,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:16:40,010 INFO L82 PathProgramCache]: Analyzing trace with hash -522474688, now seen corresponding path program 1 times [2020-10-15 22:16:40,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:16:40,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309526264] [2020-10-15 22:16:40,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:16:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:16:40,167 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-15 22:16:40,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309526264] [2020-10-15 22:16:40,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:16:40,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 22:16:40,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12307627] [2020-10-15 22:16:40,170 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:16:40,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:16:40,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:16:40,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:16:40,175 INFO L87 Difference]: Start difference. First operand 550 states and 1693 transitions. Second operand 4 states. [2020-10-15 22:16:40,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:16:40,221 INFO L93 Difference]: Finished difference Result 630 states and 1862 transitions. [2020-10-15 22:16:40,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:16:40,222 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-15 22:16:40,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:16:40,228 INFO L225 Difference]: With dead ends: 630 [2020-10-15 22:16:40,228 INFO L226 Difference]: Without dead ends: 530 [2020-10-15 22:16:40,229 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-15 22:16:40,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-10-15 22:16:40,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-10-15 22:16:40,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-10-15 22:16:40,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1617 transitions. [2020-10-15 22:16:40,259 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1617 transitions. Word has length 10 [2020-10-15 22:16:40,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:16:40,259 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 1617 transitions. [2020-10-15 22:16:40,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:16:40,259 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1617 transitions. [2020-10-15 22:16:40,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 22:16:40,267 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:16:40,267 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:16:40,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 22:16:40,267 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:16:40,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:16:40,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1950155091, now seen corresponding path program 1 times [2020-10-15 22:16:40,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:16:40,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303352868] [2020-10-15 22:16:40,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:16:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:16:40,363 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-15 22:16:40,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303352868] [2020-10-15 22:16:40,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:16:40,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 22:16:40,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71825741] [2020-10-15 22:16:40,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:16:40,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:16:40,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:16:40,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:16:40,366 INFO L87 Difference]: Start difference. First operand 530 states and 1617 transitions. Second operand 4 states. [2020-10-15 22:16:40,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:16:40,437 INFO L93 Difference]: Finished difference Result 602 states and 1775 transitions. [2020-10-15 22:16:40,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:16:40,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-15 22:16:40,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:16:40,449 INFO L225 Difference]: With dead ends: 602 [2020-10-15 22:16:40,449 INFO L226 Difference]: Without dead ends: 522 [2020-10-15 22:16:40,450 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-15 22:16:40,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2020-10-15 22:16:40,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2020-10-15 22:16:40,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2020-10-15 22:16:40,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 1587 transitions. [2020-10-15 22:16:40,469 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 1587 transitions. Word has length 11 [2020-10-15 22:16:40,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:16:40,469 INFO L481 AbstractCegarLoop]: Abstraction has 522 states and 1587 transitions. [2020-10-15 22:16:40,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:16:40,469 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 1587 transitions. [2020-10-15 22:16:40,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 22:16:40,471 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:16:40,471 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:16:40,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 22:16:40,471 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:16:40,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:16:40,472 INFO L82 PathProgramCache]: Analyzing trace with hash 306338463, now seen corresponding path program 1 times [2020-10-15 22:16:40,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:16:40,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370541393] [2020-10-15 22:16:40,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:16:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:16:40,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-15 22:16:40,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370541393] [2020-10-15 22:16:40,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:16:40,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 22:16:40,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047298788] [2020-10-15 22:16:40,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:16:40,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:16:40,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:16:40,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:16:40,553 INFO L87 Difference]: Start difference. First operand 522 states and 1587 transitions. Second operand 4 states. [2020-10-15 22:16:40,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:16:40,597 INFO L93 Difference]: Finished difference Result 578 states and 1705 transitions. [2020-10-15 22:16:40,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:16:40,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-15 22:16:40,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:16:40,603 INFO L225 Difference]: With dead ends: 578 [2020-10-15 22:16:40,603 INFO L226 Difference]: Without dead ends: 514 [2020-10-15 22:16:40,603 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-15 22:16:40,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-10-15 22:16:40,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2020-10-15 22:16:40,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2020-10-15 22:16:40,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1557 transitions. [2020-10-15 22:16:40,623 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1557 transitions. Word has length 12 [2020-10-15 22:16:40,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:16:40,623 INFO L481 AbstractCegarLoop]: Abstraction has 514 states and 1557 transitions. [2020-10-15 22:16:40,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:16:40,623 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1557 transitions. [2020-10-15 22:16:40,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 22:16:40,625 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:16:40,625 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:16:40,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 22:16:40,625 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:16:40,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:16:40,626 INFO L82 PathProgramCache]: Analyzing trace with hash 325262475, now seen corresponding path program 1 times [2020-10-15 22:16:40,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:16:40,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069097791] [2020-10-15 22:16:40,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:16:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:16:40,705 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-15 22:16:40,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069097791] [2020-10-15 22:16:40,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:16:40,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:16:40,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551701243] [2020-10-15 22:16:40,707 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 22:16:40,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:16:40,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 22:16:40,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:16:40,708 INFO L87 Difference]: Start difference. First operand 514 states and 1557 transitions. Second operand 5 states. [2020-10-15 22:16:40,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:16:40,778 INFO L93 Difference]: Finished difference Result 574 states and 1682 transitions. [2020-10-15 22:16:40,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:16:40,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-15 22:16:40,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:16:40,784 INFO L225 Difference]: With dead ends: 574 [2020-10-15 22:16:40,784 INFO L226 Difference]: Without dead ends: 504 [2020-10-15 22:16:40,785 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:16:40,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2020-10-15 22:16:40,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2020-10-15 22:16:40,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2020-10-15 22:16:40,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 1521 transitions. [2020-10-15 22:16:40,803 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 1521 transitions. Word has length 12 [2020-10-15 22:16:40,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:16:40,803 INFO L481 AbstractCegarLoop]: Abstraction has 504 states and 1521 transitions. [2020-10-15 22:16:40,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 22:16:40,804 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 1521 transitions. [2020-10-15 22:16:40,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 22:16:40,805 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:16:40,805 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:16:40,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 22:16:40,805 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:16:40,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:16:40,806 INFO L82 PathProgramCache]: Analyzing trace with hash 906516119, now seen corresponding path program 1 times [2020-10-15 22:16:40,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:16:40,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786535270] [2020-10-15 22:16:40,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:16:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:16:40,952 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-15 22:16:40,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786535270] [2020-10-15 22:16:40,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:16:40,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 22:16:40,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415039207] [2020-10-15 22:16:40,953 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 22:16:40,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:16:40,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 22:16:40,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:16:40,954 INFO L87 Difference]: Start difference. First operand 504 states and 1521 transitions. Second operand 7 states. [2020-10-15 22:16:41,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:16:41,154 INFO L93 Difference]: Finished difference Result 573 states and 1681 transitions. [2020-10-15 22:16:41,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 22:16:41,156 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2020-10-15 22:16:41,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:16:41,159 INFO L225 Difference]: With dead ends: 573 [2020-10-15 22:16:41,160 INFO L226 Difference]: Without dead ends: 500 [2020-10-15 22:16:41,161 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-10-15 22:16:41,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2020-10-15 22:16:41,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 482. [2020-10-15 22:16:41,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-10-15 22:16:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1441 transitions. [2020-10-15 22:16:41,175 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1441 transitions. Word has length 13 [2020-10-15 22:16:41,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:16:41,176 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1441 transitions. [2020-10-15 22:16:41,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 22:16:41,176 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1441 transitions. [2020-10-15 22:16:41,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 22:16:41,177 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:16:41,177 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:16:41,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 22:16:41,177 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:16:41,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:16:41,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1491768963, now seen corresponding path program 1 times [2020-10-15 22:16:41,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:16:41,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120603719] [2020-10-15 22:16:41,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:16:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:16:41,241 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-15 22:16:41,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120603719] [2020-10-15 22:16:41,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:16:41,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:16:41,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016806274] [2020-10-15 22:16:41,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 22:16:41,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:16:41,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 22:16:41,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:16:41,243 INFO L87 Difference]: Start difference. First operand 482 states and 1441 transitions. Second operand 5 states. [2020-10-15 22:16:41,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:16:41,328 INFO L93 Difference]: Finished difference Result 531 states and 1551 transitions. [2020-10-15 22:16:41,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 22:16:41,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-15 22:16:41,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:16:41,332 INFO L225 Difference]: With dead ends: 531 [2020-10-15 22:16:41,332 INFO L226 Difference]: Without dead ends: 486 [2020-10-15 22:16:41,333 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:16:41,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2020-10-15 22:16:41,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2020-10-15 22:16:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2020-10-15 22:16:41,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 1452 transitions. [2020-10-15 22:16:41,347 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 1452 transitions. Word has length 13 [2020-10-15 22:16:41,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:16:41,348 INFO L481 AbstractCegarLoop]: Abstraction has 486 states and 1452 transitions. [2020-10-15 22:16:41,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 22:16:41,348 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 1452 transitions. [2020-10-15 22:16:41,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 22:16:41,349 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:16:41,349 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:16:41,349 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 22:16:41,349 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:16:41,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:16:41,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1427420403, now seen corresponding path program 2 times [2020-10-15 22:16:41,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:16:41,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583799218] [2020-10-15 22:16:41,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:16:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:16:41,572 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-15 22:16:41,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583799218] [2020-10-15 22:16:41,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:16:41,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 22:16:41,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166283166] [2020-10-15 22:16:41,574 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 22:16:41,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:16:41,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 22:16:41,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:16:41,574 INFO L87 Difference]: Start difference. First operand 486 states and 1452 transitions. Second operand 6 states. [2020-10-15 22:16:41,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:16:41,809 INFO L93 Difference]: Finished difference Result 546 states and 1607 transitions. [2020-10-15 22:16:41,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-15 22:16:41,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-15 22:16:41,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:16:41,814 INFO L225 Difference]: With dead ends: 546 [2020-10-15 22:16:41,814 INFO L226 Difference]: Without dead ends: 492 [2020-10-15 22:16:41,814 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-10-15 22:16:41,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2020-10-15 22:16:41,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 488. [2020-10-15 22:16:41,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2020-10-15 22:16:41,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 1463 transitions. [2020-10-15 22:16:41,829 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 1463 transitions. Word has length 13 [2020-10-15 22:16:41,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:16:41,829 INFO L481 AbstractCegarLoop]: Abstraction has 488 states and 1463 transitions. [2020-10-15 22:16:41,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 22:16:41,829 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1463 transitions. [2020-10-15 22:16:41,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 22:16:41,830 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:16:41,830 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:16:41,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 22:16:41,831 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:16:41,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:16:41,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1962812064, now seen corresponding path program 1 times [2020-10-15 22:16:41,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:16:41,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672959206] [2020-10-15 22:16:41,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:16:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:16:41,979 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-15 22:16:41,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672959206] [2020-10-15 22:16:41,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:16:41,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 22:16:41,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731366606] [2020-10-15 22:16:41,981 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 22:16:41,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:16:41,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 22:16:41,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:16:41,982 INFO L87 Difference]: Start difference. First operand 488 states and 1463 transitions. Second operand 6 states. [2020-10-15 22:16:42,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:16:42,088 INFO L93 Difference]: Finished difference Result 745 states and 2148 transitions. [2020-10-15 22:16:42,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 22:16:42,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-15 22:16:42,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:16:42,092 INFO L225 Difference]: With dead ends: 745 [2020-10-15 22:16:42,092 INFO L226 Difference]: Without dead ends: 520 [2020-10-15 22:16:42,093 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-15 22:16:42,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2020-10-15 22:16:42,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 466. [2020-10-15 22:16:42,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2020-10-15 22:16:42,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1335 transitions. [2020-10-15 22:16:42,110 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 1335 transitions. Word has length 14 [2020-10-15 22:16:42,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:16:42,110 INFO L481 AbstractCegarLoop]: Abstraction has 466 states and 1335 transitions. [2020-10-15 22:16:42,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 22:16:42,110 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 1335 transitions. [2020-10-15 22:16:42,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 22:16:42,111 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:16:42,111 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:16:42,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 22:16:42,112 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:16:42,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:16:42,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1963012913, now seen corresponding path program 1 times [2020-10-15 22:16:42,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:16:42,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107222167] [2020-10-15 22:16:42,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:16:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:16:42,217 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-15 22:16:42,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107222167] [2020-10-15 22:16:42,218 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:16:42,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 22:16:42,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094614800] [2020-10-15 22:16:42,219 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 22:16:42,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:16:42,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 22:16:42,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:16:42,219 INFO L87 Difference]: Start difference. First operand 466 states and 1335 transitions. Second operand 6 states. [2020-10-15 22:16:42,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:16:42,364 INFO L93 Difference]: Finished difference Result 592 states and 1653 transitions. [2020-10-15 22:16:42,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 22:16:42,364 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-15 22:16:42,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:16:42,368 INFO L225 Difference]: With dead ends: 592 [2020-10-15 22:16:42,368 INFO L226 Difference]: Without dead ends: 490 [2020-10-15 22:16:42,369 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-15 22:16:42,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2020-10-15 22:16:42,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 454. [2020-10-15 22:16:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2020-10-15 22:16:42,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1269 transitions. [2020-10-15 22:16:42,384 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 1269 transitions. Word has length 14 [2020-10-15 22:16:42,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:16:42,384 INFO L481 AbstractCegarLoop]: Abstraction has 454 states and 1269 transitions. [2020-10-15 22:16:42,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 22:16:42,384 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 1269 transitions. [2020-10-15 22:16:42,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 22:16:42,386 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:16:42,386 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:16:42,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 22:16:42,387 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:16:42,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:16:42,387 INFO L82 PathProgramCache]: Analyzing trace with hash -717635042, now seen corresponding path program 1 times [2020-10-15 22:16:42,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:16:42,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110178889] [2020-10-15 22:16:42,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:16:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:16:42,447 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-15 22:16:42,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110178889] [2020-10-15 22:16:42,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:16:42,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:16:42,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520712308] [2020-10-15 22:16:42,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:16:42,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:16:42,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:16:42,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:16:42,449 INFO L87 Difference]: Start difference. First operand 454 states and 1269 transitions. Second operand 4 states. [2020-10-15 22:16:42,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:16:42,488 INFO L93 Difference]: Finished difference Result 438 states and 1075 transitions. [2020-10-15 22:16:42,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:16:42,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-15 22:16:42,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:16:42,492 INFO L225 Difference]: With dead ends: 438 [2020-10-15 22:16:42,492 INFO L226 Difference]: Without dead ends: 326 [2020-10-15 22:16:42,492 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-15 22:16:42,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-10-15 22:16:42,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2020-10-15 22:16:42,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2020-10-15 22:16:42,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 781 transitions. [2020-10-15 22:16:42,502 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 781 transitions. Word has length 15 [2020-10-15 22:16:42,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:16:42,502 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 781 transitions. [2020-10-15 22:16:42,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:16:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 781 transitions. [2020-10-15 22:16:42,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 22:16:42,504 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:16:42,504 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:16:42,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 22:16:42,504 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:16:42,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:16:42,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1081399702, now seen corresponding path program 1 times [2020-10-15 22:16:42,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:16:42,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544905672] [2020-10-15 22:16:42,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:16:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:16:42,562 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-15 22:16:42,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544905672] [2020-10-15 22:16:42,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:16:42,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 22:16:42,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181047382] [2020-10-15 22:16:42,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 22:16:42,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:16:42,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 22:16:42,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:16:42,564 INFO L87 Difference]: Start difference. First operand 326 states and 781 transitions. Second operand 5 states. [2020-10-15 22:16:42,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:16:42,604 INFO L93 Difference]: Finished difference Result 255 states and 549 transitions. [2020-10-15 22:16:42,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 22:16:42,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-15 22:16:42,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:16:42,606 INFO L225 Difference]: With dead ends: 255 [2020-10-15 22:16:42,607 INFO L226 Difference]: Without dead ends: 196 [2020-10-15 22:16:42,607 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:16:42,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-10-15 22:16:42,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2020-10-15 22:16:42,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2020-10-15 22:16:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 409 transitions. [2020-10-15 22:16:42,612 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 409 transitions. Word has length 16 [2020-10-15 22:16:42,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:16:42,612 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 409 transitions. [2020-10-15 22:16:42,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 22:16:42,612 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 409 transitions. [2020-10-15 22:16:42,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 22:16:42,613 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:16:42,613 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:16:42,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 22:16:42,614 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:16:42,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:16:42,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1975064388, now seen corresponding path program 1 times [2020-10-15 22:16:42,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:16:42,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116878786] [2020-10-15 22:16:42,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:16:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:16:42,653 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-15 22:16:42,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116878786] [2020-10-15 22:16:42,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:16:42,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 22:16:42,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695333391] [2020-10-15 22:16:42,655 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 22:16:42,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:16:42,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 22:16:42,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 22:16:42,656 INFO L87 Difference]: Start difference. First operand 196 states and 409 transitions. Second operand 4 states. [2020-10-15 22:16:42,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:16:42,682 INFO L93 Difference]: Finished difference Result 277 states and 549 transitions. [2020-10-15 22:16:42,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 22:16:42,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-15 22:16:42,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:16:42,684 INFO L225 Difference]: With dead ends: 277 [2020-10-15 22:16:42,684 INFO L226 Difference]: Without dead ends: 182 [2020-10-15 22:16:42,684 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 22:16:42,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2020-10-15 22:16:42,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 168. [2020-10-15 22:16:42,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-10-15 22:16:42,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 320 transitions. [2020-10-15 22:16:42,689 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 320 transitions. Word has length 17 [2020-10-15 22:16:42,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:16:42,689 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 320 transitions. [2020-10-15 22:16:42,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 22:16:42,689 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 320 transitions. [2020-10-15 22:16:42,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 22:16:42,690 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:16:42,690 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-15 22:16:42,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 22:16:42,690 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:16:42,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:16:42,691 INFO L82 PathProgramCache]: Analyzing trace with hash 704500665, now seen corresponding path program 1 times [2020-10-15 22:16:42,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:16:42,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366377551] [2020-10-15 22:16:42,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:16:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:16:42,748 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-15 22:16:42,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366377551] [2020-10-15 22:16:42,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:16:42,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 22:16:42,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776582914] [2020-10-15 22:16:42,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 22:16:42,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:16:42,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 22:16:42,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 22:16:42,750 INFO L87 Difference]: Start difference. First operand 168 states and 320 transitions. Second operand 6 states. [2020-10-15 22:16:42,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:16:42,796 INFO L93 Difference]: Finished difference Result 142 states and 268 transitions. [2020-10-15 22:16:42,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 22:16:42,796 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-15 22:16:42,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:16:42,797 INFO L225 Difference]: With dead ends: 142 [2020-10-15 22:16:42,797 INFO L226 Difference]: Without dead ends: 52 [2020-10-15 22:16:42,798 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-15 22:16:42,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-10-15 22:16:42,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2020-10-15 22:16:42,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-15 22:16:42,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2020-10-15 22:16:42,799 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 18 [2020-10-15 22:16:42,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:16:42,800 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 81 transitions. [2020-10-15 22:16:42,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 22:16:42,800 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 81 transitions. [2020-10-15 22:16:42,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-15 22:16:42,800 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:16:42,801 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:16:42,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-15 22:16:42,801 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:16:42,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:16:42,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1659320673, now seen corresponding path program 1 times [2020-10-15 22:16:42,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:16:42,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182103158] [2020-10-15 22:16:42,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:16:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 22:16:43,024 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-15 22:16:43,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182103158] [2020-10-15 22:16:43,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 22:16:43,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 22:16:43,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328514737] [2020-10-15 22:16:43,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 22:16:43,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 22:16:43,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 22:16:43,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-15 22:16:43,026 INFO L87 Difference]: Start difference. First operand 48 states and 81 transitions. Second operand 7 states. [2020-10-15 22:16:43,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 22:16:43,162 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2020-10-15 22:16:43,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 22:16:43,163 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-15 22:16:43,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 22:16:43,164 INFO L225 Difference]: With dead ends: 63 [2020-10-15 22:16:43,164 INFO L226 Difference]: Without dead ends: 36 [2020-10-15 22:16:43,164 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-15 22:16:43,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-10-15 22:16:43,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-10-15 22:16:43,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-15 22:16:43,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2020-10-15 22:16:43,166 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 21 [2020-10-15 22:16:43,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 22:16:43,166 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2020-10-15 22:16:43,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 22:16:43,170 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2020-10-15 22:16:43,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-15 22:16:43,170 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 22:16:43,170 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 22:16:43,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-15 22:16:43,171 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 22:16:43,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 22:16:43,171 INFO L82 PathProgramCache]: Analyzing trace with hash 923826655, now seen corresponding path program 2 times [2020-10-15 22:16:43,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 22:16:43,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559635486] [2020-10-15 22:16:43,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 22:16:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 22:16:43,233 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 22:16:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 22:16:43,280 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 22:16:43,328 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 22:16:43,331 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 22:16:43,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-15 22:16:43,357 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-15 22:16:43,357 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,361 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-15 22:16:43,361 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,362 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-15 22:16:43,362 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,363 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-15 22:16:43,363 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,363 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-15 22:16:43,363 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,364 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-15 22:16:43,364 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,365 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-15 22:16:43,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,366 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-15 22:16:43,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,366 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-15 22:16:43,367 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,367 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-15 22:16:43,367 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,368 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-15 22:16:43,368 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,369 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-15 22:16:43,369 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,369 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-15 22:16:43,370 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,370 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-15 22:16:43,370 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,370 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-15 22:16:43,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,371 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-15 22:16:43,371 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,371 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-15 22:16:43,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,372 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-15 22:16:43,372 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,378 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-15 22:16:43,379 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,379 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-15 22:16:43,379 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,379 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-15 22:16:43,379 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,380 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-15 22:16:43,380 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,380 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-15 22:16:43,380 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,381 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-15 22:16:43,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,381 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-15 22:16:43,381 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,382 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-15 22:16:43,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,382 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-15 22:16:43,382 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,383 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-15 22:16:43,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,383 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-15 22:16:43,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,384 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-15 22:16:43,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,384 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-15 22:16:43,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 22:16:43,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 10:16:43 BasicIcfg [2020-10-15 22:16:43,471 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 22:16:43,473 INFO L168 Benchmark]: Toolchain (without parser) took 12766.63 ms. Allocated memory was 252.2 MB in the beginning and 552.6 MB in the end (delta: 300.4 MB). Free memory was 207.3 MB in the beginning and 445.5 MB in the end (delta: -238.1 MB). Peak memory consumption was 62.3 MB. Max. memory is 14.2 GB. [2020-10-15 22:16:43,473 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 252.2 MB. Free memory is still 228.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 22:16:43,474 INFO L168 Benchmark]: CACSL2BoogieTranslator took 688.81 ms. Allocated memory was 252.2 MB in the beginning and 317.7 MB in the end (delta: 65.5 MB). Free memory was 207.3 MB in the beginning and 267.8 MB in the end (delta: -60.4 MB). Peak memory consumption was 33.1 MB. Max. memory is 14.2 GB. [2020-10-15 22:16:43,474 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.32 ms. Allocated memory is still 317.7 MB. Free memory was 267.8 MB in the beginning and 265.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 22:16:43,475 INFO L168 Benchmark]: Boogie Preprocessor took 35.78 ms. Allocated memory is still 317.7 MB. Free memory was 265.2 MB in the beginning and 262.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 22:16:43,476 INFO L168 Benchmark]: RCFGBuilder took 1889.06 ms. Allocated memory was 317.7 MB in the beginning and 359.7 MB in the end (delta: 41.9 MB). Free memory was 262.7 MB in the beginning and 213.3 MB in the end (delta: 49.4 MB). Peak memory consumption was 99.1 MB. Max. memory is 14.2 GB. [2020-10-15 22:16:43,477 INFO L168 Benchmark]: TraceAbstraction took 10081.89 ms. Allocated memory was 359.7 MB in the beginning and 552.6 MB in the end (delta: 192.9 MB). Free memory was 213.3 MB in the beginning and 445.5 MB in the end (delta: -232.1 MB). There was no memory consumed. Max. memory is 14.2 GB. [2020-10-15 22:16:43,481 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 252.2 MB. Free memory is still 228.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 688.81 ms. Allocated memory was 252.2 MB in the beginning and 317.7 MB in the end (delta: 65.5 MB). Free memory was 207.3 MB in the beginning and 267.8 MB in the end (delta: -60.4 MB). Peak memory consumption was 33.1 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 64.32 ms. Allocated memory is still 317.7 MB. Free memory was 267.8 MB in the beginning and 265.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 35.78 ms. Allocated memory is still 317.7 MB. Free memory was 265.2 MB in the beginning and 262.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1889.06 ms. Allocated memory was 317.7 MB in the beginning and 359.7 MB in the end (delta: 41.9 MB). Free memory was 262.7 MB in the beginning and 213.3 MB in the end (delta: 49.4 MB). Peak memory consumption was 99.1 MB. Max. memory is 14.2 GB. * TraceAbstraction took 10081.89 ms. Allocated memory was 359.7 MB in the beginning and 552.6 MB in the end (delta: 192.9 MB). Free memory was 213.3 MB in the beginning and 445.5 MB in the end (delta: -232.1 MB). There was no memory consumed. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 998 VarBasedMoverChecksPositive, 67 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 44 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 141 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.9s, 98 PlacesBefore, 36 PlacesAfterwards, 90 TransitionsBefore, 27 TransitionsAfterwards, 1536 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 4033 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L699] 0 _Bool main$tmp_guard0; [L700] 0 _Bool main$tmp_guard1; [L702] 0 int x = 0; [L704] 0 int y = 0; [L705] 0 _Bool y$flush_delayed; [L706] 0 int y$mem_tmp; [L707] 0 _Bool y$r_buff0_thd0; [L708] 0 _Bool y$r_buff0_thd1; [L709] 0 _Bool y$r_buff0_thd2; [L710] 0 _Bool y$r_buff0_thd3; [L711] 0 _Bool y$r_buff1_thd0; [L712] 0 _Bool y$r_buff1_thd1; [L713] 0 _Bool y$r_buff1_thd2; [L714] 0 _Bool y$r_buff1_thd3; [L715] 0 _Bool y$read_delayed; [L716] 0 int *y$read_delayed_var; [L717] 0 int y$w_buff0; [L718] 0 _Bool y$w_buff0_used; [L719] 0 int y$w_buff1; [L720] 0 _Bool y$w_buff1_used; [L722] 0 int z = 0; [L723] 0 _Bool weak$$choice0; [L724] 0 _Bool weak$$choice2; [L800] 0 pthread_t t2498; [L801] FCALL, FORK 0 pthread_create(&t2498, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 0 pthread_t t2499; [L803] FCALL, FORK 0 pthread_create(&t2499, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 0 pthread_t t2500; [L805] FCALL, FORK 0 pthread_create(&t2500, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L763] 3 y$w_buff1 = y$w_buff0 [L764] 3 y$w_buff0 = 2 [L765] 3 y$w_buff1_used = y$w_buff0_used [L766] 3 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 3 !expression [L7] 3 __VERIFIER_error() [L768] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L769] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L770] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L771] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L772] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L775] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L728] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L731] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L743] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L778] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L778] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L779] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L780] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L780] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L781] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L781] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L782] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L785] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 3 return 0; [L736] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L738] 1 return 0; [L749] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L749] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L750] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L751] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L752] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L752] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L753] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L753] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L756] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L814] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L815] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L815] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L823] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L823] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L824] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L825] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L825] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L826] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L827] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L827] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L827] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L828] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L828] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L830] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 89 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 415 SDtfs, 447 SDslu, 792 SDs, 0 SdLazy, 414 SolverSat, 96 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=770occurred 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, 15 MinimizatonAttempts, 130 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 20306 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...