/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:30:05,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:30:05,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:30:05,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:30:05,419 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:30:05,427 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:30:05,430 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:30:05,434 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:30:05,436 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:30:05,439 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:30:05,440 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:30:05,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:30:05,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:30:05,444 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:30:05,446 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:30:05,447 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:30:05,449 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:30:05,450 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:30:05,451 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:30:05,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:30:05,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:30:05,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:30:05,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:30:05,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:30:05,475 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:30:05,475 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:30:05,475 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:30:05,481 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:30:05,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:30:05,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:30:05,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:30:05,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:30:05,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:30:05,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:30:05,489 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:30:05,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:30:05,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:30:05,492 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:30:05,492 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:30:05,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:30:05,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:30:05,494 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-05 23:30:05,535 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:30:05,536 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:30:05,538 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:30:05,539 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:30:05,539 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:30:05,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:30:05,539 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:30:05,539 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:30:05,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:30:05,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:30:05,540 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:30:05,540 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:30:05,540 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:30:05,541 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:30:05,541 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:30:05,541 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:30:05,542 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:30:05,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:30:05,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:30:05,543 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:30:05,543 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:30:05,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:30:05,544 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:30:05,544 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:30:05,544 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:30:05,544 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:30:05,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:30:05,545 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:30:05,545 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:30:05,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:30:05,862 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:30:05,866 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:30:05,867 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:30:05,868 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:30:05,868 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i [2020-10-05 23:30:05,941 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/103376e6f/876e4aacc53042fa8261c1a7928fee8f/FLAG5965e810f [2020-10-05 23:30:06,573 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:30:06,575 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix018_tso.oepc.i [2020-10-05 23:30:06,597 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/103376e6f/876e4aacc53042fa8261c1a7928fee8f/FLAG5965e810f [2020-10-05 23:30:06,799 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/103376e6f/876e4aacc53042fa8261c1a7928fee8f [2020-10-05 23:30:06,808 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:30:06,810 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:30:06,811 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:30:06,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:30:06,815 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:30:06,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:30:06" (1/1) ... [2020-10-05 23:30:06,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43397cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:06, skipping insertion in model container [2020-10-05 23:30:06,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:30:06" (1/1) ... [2020-10-05 23:30:06,829 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:30:06,875 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:30:07,365 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:30:07,460 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:30:07,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:30:07,599 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:30:07,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:07 WrapperNode [2020-10-05 23:30:07,600 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:30:07,601 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:30:07,601 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:30:07,601 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:30:07,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:07" (1/1) ... [2020-10-05 23:30:07,632 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:07" (1/1) ... [2020-10-05 23:30:07,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:30:07,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:30:07,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:30:07,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:30:07,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:07" (1/1) ... [2020-10-05 23:30:07,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:07" (1/1) ... [2020-10-05 23:30:07,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:07" (1/1) ... [2020-10-05 23:30:07,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:07" (1/1) ... [2020-10-05 23:30:07,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:07" (1/1) ... [2020-10-05 23:30:07,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:07" (1/1) ... [2020-10-05 23:30:07,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:07" (1/1) ... [2020-10-05 23:30:07,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:30:07,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:30:07,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:30:07,727 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:30:07,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:07" (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-05 23:30:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:30:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:30:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:30:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:30:07,800 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:30:07,801 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:30:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:30:07,801 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:30:07,801 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 23:30:07,801 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 23:30:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-05 23:30:07,802 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-05 23:30:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:30:07,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:30:07,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:30:07,804 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:30:10,276 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:30:10,277 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:30:10,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:30:10 BoogieIcfgContainer [2020-10-05 23:30:10,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:30:10,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:30:10,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:30:10,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:30:10,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:30:06" (1/3) ... [2020-10-05 23:30:10,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603f3a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:30:10, skipping insertion in model container [2020-10-05 23:30:10,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:30:07" (2/3) ... [2020-10-05 23:30:10,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603f3a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:30:10, skipping insertion in model container [2020-10-05 23:30:10,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:30:10" (3/3) ... [2020-10-05 23:30:10,288 INFO L109 eAbstractionObserver]: Analyzing ICFG mix018_tso.oepc.i [2020-10-05 23:30:10,299 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:30:10,300 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:30:10,308 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:30:10,309 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:30:10,342 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,343 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,343 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,343 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,345 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,347 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,347 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,347 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,348 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,351 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,351 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,352 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,354 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,354 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,354 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,355 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,356 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,363 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,363 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,366 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,366 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,366 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,370 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,370 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,378 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,379 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,379 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,379 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,379 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,380 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,380 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,380 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,380 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,380 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:30:10,396 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-05 23:30:10,417 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:30:10,418 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:30:10,418 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:30:10,418 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:30:10,418 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:30:10,418 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:30:10,419 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:30:10,419 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:30:10,435 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 246 flow [2020-10-05 23:30:10,437 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 246 flow [2020-10-05 23:30:10,490 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2020-10-05 23:30:10,491 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:30:10,496 INFO L80 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2020-10-05 23:30:10,501 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 246 flow [2020-10-05 23:30:10,527 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2020-10-05 23:30:10,528 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:30:10,529 INFO L80 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2020-10-05 23:30:10,532 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2706 [2020-10-05 23:30:10,533 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:30:10,987 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-05 23:30:12,233 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-05 23:30:12,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-10-05 23:30:12,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:30:12,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-05 23:30:12,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:30:13,555 WARN L193 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 148 DAG size of output: 128 [2020-10-05 23:30:13,963 WARN L193 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-05 23:30:14,118 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-05 23:30:14,400 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-05 23:30:14,528 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-05 23:30:16,107 WARN L193 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 113 [2020-10-05 23:30:16,435 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-10-05 23:30:16,766 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-10-05 23:30:18,073 WARN L193 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 143 DAG size of output: 133 [2020-10-05 23:30:18,502 WARN L193 SmtUtils]: Spent 425.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-10-05 23:30:18,776 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2020-10-05 23:30:18,933 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-05 23:30:19,309 WARN L193 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-10-05 23:30:19,670 WARN L193 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2020-10-05 23:30:19,679 INFO L206 etLargeBlockEncoding]: Checked pairs total: 7447 [2020-10-05 23:30:19,679 INFO L214 etLargeBlockEncoding]: Total number of compositions: 86 [2020-10-05 23:30:19,682 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 34 transitions, 88 flow [2020-10-05 23:30:19,994 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4872 states. [2020-10-05 23:30:19,997 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states. [2020-10-05 23:30:20,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-05 23:30:20,021 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:20,022 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-05 23:30:20,022 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:20,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:20,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1148088599, now seen corresponding path program 1 times [2020-10-05 23:30:20,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:20,040 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577494610] [2020-10-05 23:30:20,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:20,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 23:30:20,341 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577494610] [2020-10-05 23:30:20,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:20,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:30:20,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770515874] [2020-10-05 23:30:20,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:30:20,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:20,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:30:20,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:30:20,366 INFO L87 Difference]: Start difference. First operand 4872 states. Second operand 3 states. [2020-10-05 23:30:20,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:20,523 INFO L93 Difference]: Finished difference Result 4062 states and 16125 transitions. [2020-10-05 23:30:20,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:30:20,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-05 23:30:20,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:20,578 INFO L225 Difference]: With dead ends: 4062 [2020-10-05 23:30:20,579 INFO L226 Difference]: Without dead ends: 3312 [2020-10-05 23:30:20,580 INFO L675 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-05 23:30:20,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2020-10-05 23:30:20,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3312. [2020-10-05 23:30:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3312 states. [2020-10-05 23:30:20,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 12950 transitions. [2020-10-05 23:30:20,933 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 12950 transitions. Word has length 5 [2020-10-05 23:30:20,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:20,933 INFO L479 AbstractCegarLoop]: Abstraction has 3312 states and 12950 transitions. [2020-10-05 23:30:20,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:30:20,933 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 12950 transitions. [2020-10-05 23:30:20,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:30:20,937 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:20,937 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:20,937 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:30:20,938 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:20,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:20,938 INFO L82 PathProgramCache]: Analyzing trace with hash 941677787, now seen corresponding path program 1 times [2020-10-05 23:30:20,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:20,939 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233103938] [2020-10-05 23:30:20,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:21,132 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-05 23:30:21,132 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233103938] [2020-10-05 23:30:21,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:21,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:30:21,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33379626] [2020-10-05 23:30:21,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:30:21,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:21,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:30:21,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:30:21,136 INFO L87 Difference]: Start difference. First operand 3312 states and 12950 transitions. Second operand 3 states. [2020-10-05 23:30:21,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:21,212 INFO L93 Difference]: Finished difference Result 3252 states and 12672 transitions. [2020-10-05 23:30:21,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:30:21,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-05 23:30:21,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:21,243 INFO L225 Difference]: With dead ends: 3252 [2020-10-05 23:30:21,243 INFO L226 Difference]: Without dead ends: 3252 [2020-10-05 23:30:21,244 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:30:21,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3252 states. [2020-10-05 23:30:21,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3252 to 3252. [2020-10-05 23:30:21,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3252 states. [2020-10-05 23:30:21,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3252 states to 3252 states and 12672 transitions. [2020-10-05 23:30:21,395 INFO L78 Accepts]: Start accepts. Automaton has 3252 states and 12672 transitions. Word has length 11 [2020-10-05 23:30:21,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:21,396 INFO L479 AbstractCegarLoop]: Abstraction has 3252 states and 12672 transitions. [2020-10-05 23:30:21,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:30:21,396 INFO L276 IsEmpty]: Start isEmpty. Operand 3252 states and 12672 transitions. [2020-10-05 23:30:21,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:30:21,399 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:21,400 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:21,400 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:30:21,400 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:21,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:21,400 INFO L82 PathProgramCache]: Analyzing trace with hash 766714957, now seen corresponding path program 1 times [2020-10-05 23:30:21,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:21,401 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976886394] [2020-10-05 23:30:21,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:21,469 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-05 23:30:21,469 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976886394] [2020-10-05 23:30:21,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:21,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:30:21,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766142151] [2020-10-05 23:30:21,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:30:21,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:21,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:30:21,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:30:21,472 INFO L87 Difference]: Start difference. First operand 3252 states and 12672 transitions. Second operand 3 states. [2020-10-05 23:30:21,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:21,507 INFO L93 Difference]: Finished difference Result 3022 states and 11668 transitions. [2020-10-05 23:30:21,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:30:21,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-05 23:30:21,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:21,535 INFO L225 Difference]: With dead ends: 3022 [2020-10-05 23:30:21,535 INFO L226 Difference]: Without dead ends: 3022 [2020-10-05 23:30:21,536 INFO L675 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-05 23:30:21,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2020-10-05 23:30:21,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 3022. [2020-10-05 23:30:21,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3022 states. [2020-10-05 23:30:21,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 11668 transitions. [2020-10-05 23:30:21,668 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 11668 transitions. Word has length 12 [2020-10-05 23:30:21,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:21,668 INFO L479 AbstractCegarLoop]: Abstraction has 3022 states and 11668 transitions. [2020-10-05 23:30:21,668 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:30:21,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 11668 transitions. [2020-10-05 23:30:21,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:30:21,672 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:21,673 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:21,673 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:30:21,673 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:21,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:21,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1939697789, now seen corresponding path program 1 times [2020-10-05 23:30:21,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:21,674 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034007718] [2020-10-05 23:30:21,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:21,871 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-05 23:30:21,871 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034007718] [2020-10-05 23:30:21,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:21,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:30:21,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260888973] [2020-10-05 23:30:21,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:30:21,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:21,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:30:21,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:30:21,874 INFO L87 Difference]: Start difference. First operand 3022 states and 11668 transitions. Second operand 5 states. [2020-10-05 23:30:22,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:22,014 INFO L93 Difference]: Finished difference Result 3230 states and 12480 transitions. [2020-10-05 23:30:22,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:30:22,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-05 23:30:22,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:22,045 INFO L225 Difference]: With dead ends: 3230 [2020-10-05 23:30:22,046 INFO L226 Difference]: Without dead ends: 3230 [2020-10-05 23:30:22,046 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:30:22,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2020-10-05 23:30:22,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 3230. [2020-10-05 23:30:22,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3230 states. [2020-10-05 23:30:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3230 states to 3230 states and 12480 transitions. [2020-10-05 23:30:22,177 INFO L78 Accepts]: Start accepts. Automaton has 3230 states and 12480 transitions. Word has length 14 [2020-10-05 23:30:22,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:22,178 INFO L479 AbstractCegarLoop]: Abstraction has 3230 states and 12480 transitions. [2020-10-05 23:30:22,178 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:30:22,178 INFO L276 IsEmpty]: Start isEmpty. Operand 3230 states and 12480 transitions. [2020-10-05 23:30:22,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:30:22,181 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:22,182 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:22,182 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:30:22,182 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:22,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:22,183 INFO L82 PathProgramCache]: Analyzing trace with hash 303076573, now seen corresponding path program 1 times [2020-10-05 23:30:22,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:22,183 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133245907] [2020-10-05 23:30:22,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:22,371 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2020-10-05 23:30:22,373 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-05 23:30:22,373 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133245907] [2020-10-05 23:30:22,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:22,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:30:22,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774980267] [2020-10-05 23:30:22,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:30:22,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:22,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:30:22,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:30:22,375 INFO L87 Difference]: Start difference. First operand 3230 states and 12480 transitions. Second operand 5 states. [2020-10-05 23:30:22,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:22,526 INFO L93 Difference]: Finished difference Result 3240 states and 12508 transitions. [2020-10-05 23:30:22,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:30:22,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-05 23:30:22,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:22,544 INFO L225 Difference]: With dead ends: 3240 [2020-10-05 23:30:22,544 INFO L226 Difference]: Without dead ends: 3240 [2020-10-05 23:30:22,545 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:30:22,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3240 states. [2020-10-05 23:30:22,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3240 to 3170. [2020-10-05 23:30:22,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3170 states. [2020-10-05 23:30:22,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 12227 transitions. [2020-10-05 23:30:22,660 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 12227 transitions. Word has length 15 [2020-10-05 23:30:22,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:22,661 INFO L479 AbstractCegarLoop]: Abstraction has 3170 states and 12227 transitions. [2020-10-05 23:30:22,661 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:30:22,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 12227 transitions. [2020-10-05 23:30:22,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:30:22,666 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:22,666 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:22,666 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:30:22,666 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:22,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:22,667 INFO L82 PathProgramCache]: Analyzing trace with hash 639459511, now seen corresponding path program 1 times [2020-10-05 23:30:22,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:22,667 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868831830] [2020-10-05 23:30:22,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:22,779 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-05 23:30:22,779 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868831830] [2020-10-05 23:30:22,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:22,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:30:22,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834646578] [2020-10-05 23:30:22,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:30:22,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:22,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:30:22,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:30:22,782 INFO L87 Difference]: Start difference. First operand 3170 states and 12227 transitions. Second operand 6 states. [2020-10-05 23:30:22,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:22,993 INFO L93 Difference]: Finished difference Result 3444 states and 13370 transitions. [2020-10-05 23:30:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:30:22,995 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-05 23:30:22,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:23,011 INFO L225 Difference]: With dead ends: 3444 [2020-10-05 23:30:23,011 INFO L226 Difference]: Without dead ends: 3444 [2020-10-05 23:30:23,012 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:30:23,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3444 states. [2020-10-05 23:30:23,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3444 to 3444. [2020-10-05 23:30:23,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3444 states. [2020-10-05 23:30:23,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3444 states to 3444 states and 13370 transitions. [2020-10-05 23:30:23,128 INFO L78 Accepts]: Start accepts. Automaton has 3444 states and 13370 transitions. Word has length 16 [2020-10-05 23:30:23,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:23,128 INFO L479 AbstractCegarLoop]: Abstraction has 3444 states and 13370 transitions. [2020-10-05 23:30:23,128 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:30:23,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3444 states and 13370 transitions. [2020-10-05 23:30:23,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:30:23,134 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:23,134 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:23,134 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:30:23,134 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:23,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:23,135 INFO L82 PathProgramCache]: Analyzing trace with hash 805438699, now seen corresponding path program 2 times [2020-10-05 23:30:23,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:23,135 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112606049] [2020-10-05 23:30:23,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:23,229 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-05 23:30:23,230 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112606049] [2020-10-05 23:30:23,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:23,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:30:23,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834406485] [2020-10-05 23:30:23,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:30:23,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:23,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:30:23,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:30:23,232 INFO L87 Difference]: Start difference. First operand 3444 states and 13370 transitions. Second operand 6 states. [2020-10-05 23:30:23,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:23,422 INFO L93 Difference]: Finished difference Result 3974 states and 15357 transitions. [2020-10-05 23:30:23,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:30:23,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-05 23:30:23,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:23,442 INFO L225 Difference]: With dead ends: 3974 [2020-10-05 23:30:23,443 INFO L226 Difference]: Without dead ends: 3974 [2020-10-05 23:30:23,443 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:30:23,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3974 states. [2020-10-05 23:30:23,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3974 to 3682. [2020-10-05 23:30:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3682 states. [2020-10-05 23:30:23,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 14153 transitions. [2020-10-05 23:30:23,579 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 14153 transitions. Word has length 16 [2020-10-05 23:30:23,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:23,580 INFO L479 AbstractCegarLoop]: Abstraction has 3682 states and 14153 transitions. [2020-10-05 23:30:23,580 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:30:23,580 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 14153 transitions. [2020-10-05 23:30:23,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:30:23,586 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:23,586 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:23,586 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:30:23,587 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:23,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:23,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1281781406, now seen corresponding path program 1 times [2020-10-05 23:30:23,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:23,588 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560268091] [2020-10-05 23:30:23,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:23,665 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-05 23:30:23,666 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560268091] [2020-10-05 23:30:23,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:23,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:30:23,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729177381] [2020-10-05 23:30:23,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:30:23,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:23,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:30:23,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:30:23,668 INFO L87 Difference]: Start difference. First operand 3682 states and 14153 transitions. Second operand 4 states. [2020-10-05 23:30:23,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:23,736 INFO L93 Difference]: Finished difference Result 3736 states and 13108 transitions. [2020-10-05 23:30:23,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:30:23,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-05 23:30:23,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:23,836 INFO L225 Difference]: With dead ends: 3736 [2020-10-05 23:30:23,837 INFO L226 Difference]: Without dead ends: 2758 [2020-10-05 23:30:23,838 INFO L675 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-05 23:30:23,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2020-10-05 23:30:23,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 2758. [2020-10-05 23:30:23,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2758 states. [2020-10-05 23:30:23,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2758 states to 2758 states and 9533 transitions. [2020-10-05 23:30:23,910 INFO L78 Accepts]: Start accepts. Automaton has 2758 states and 9533 transitions. Word has length 16 [2020-10-05 23:30:23,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:23,911 INFO L479 AbstractCegarLoop]: Abstraction has 2758 states and 9533 transitions. [2020-10-05 23:30:23,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:30:23,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2758 states and 9533 transitions. [2020-10-05 23:30:23,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-05 23:30:23,915 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:23,915 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:23,916 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:30:23,916 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:23,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:23,916 INFO L82 PathProgramCache]: Analyzing trace with hash 268950830, now seen corresponding path program 1 times [2020-10-05 23:30:23,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:23,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467782211] [2020-10-05 23:30:23,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:23,997 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-05 23:30:23,997 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467782211] [2020-10-05 23:30:23,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:23,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:30:23,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856441402] [2020-10-05 23:30:23,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:30:23,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:23,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:30:23,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:30:23,999 INFO L87 Difference]: Start difference. First operand 2758 states and 9533 transitions. Second operand 5 states. [2020-10-05 23:30:24,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:24,086 INFO L93 Difference]: Finished difference Result 2328 states and 7484 transitions. [2020-10-05 23:30:24,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:30:24,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-05 23:30:24,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:24,096 INFO L225 Difference]: With dead ends: 2328 [2020-10-05 23:30:24,096 INFO L226 Difference]: Without dead ends: 1758 [2020-10-05 23:30:24,097 INFO L675 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-05 23:30:24,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2020-10-05 23:30:24,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1570. [2020-10-05 23:30:24,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2020-10-05 23:30:24,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 4883 transitions. [2020-10-05 23:30:24,143 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 4883 transitions. Word has length 17 [2020-10-05 23:30:24,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:24,144 INFO L479 AbstractCegarLoop]: Abstraction has 1570 states and 4883 transitions. [2020-10-05 23:30:24,144 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:30:24,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 4883 transitions. [2020-10-05 23:30:24,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-05 23:30:24,148 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:24,148 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:24,148 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:30:24,149 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:24,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:24,150 INFO L82 PathProgramCache]: Analyzing trace with hash 114419764, now seen corresponding path program 1 times [2020-10-05 23:30:24,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:24,150 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769399238] [2020-10-05 23:30:24,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:24,303 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-05 23:30:24,304 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769399238] [2020-10-05 23:30:24,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:24,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:30:24,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061879047] [2020-10-05 23:30:24,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:30:24,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:24,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:30:24,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:30:24,306 INFO L87 Difference]: Start difference. First operand 1570 states and 4883 transitions. Second operand 6 states. [2020-10-05 23:30:24,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:24,382 INFO L93 Difference]: Finished difference Result 1383 states and 4281 transitions. [2020-10-05 23:30:24,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:30:24,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-05 23:30:24,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:24,390 INFO L225 Difference]: With dead ends: 1383 [2020-10-05 23:30:24,391 INFO L226 Difference]: Without dead ends: 1229 [2020-10-05 23:30:24,391 INFO L675 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-05 23:30:24,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-10-05 23:30:24,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1133. [2020-10-05 23:30:24,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2020-10-05 23:30:24,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 3572 transitions. [2020-10-05 23:30:24,425 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 3572 transitions. Word has length 20 [2020-10-05 23:30:24,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:24,425 INFO L479 AbstractCegarLoop]: Abstraction has 1133 states and 3572 transitions. [2020-10-05 23:30:24,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:30:24,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 3572 transitions. [2020-10-05 23:30:24,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 23:30:24,429 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:24,430 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:24,430 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:30:24,430 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:24,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:24,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1712340089, now seen corresponding path program 1 times [2020-10-05 23:30:24,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:24,431 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912422687] [2020-10-05 23:30:24,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:24,539 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-05 23:30:24,540 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912422687] [2020-10-05 23:30:24,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:24,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:30:24,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208234138] [2020-10-05 23:30:24,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:30:24,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:24,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:30:24,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:30:24,542 INFO L87 Difference]: Start difference. First operand 1133 states and 3572 transitions. Second operand 4 states. [2020-10-05 23:30:24,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:24,569 INFO L93 Difference]: Finished difference Result 1484 states and 4581 transitions. [2020-10-05 23:30:24,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:30:24,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-05 23:30:24,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:24,575 INFO L225 Difference]: With dead ends: 1484 [2020-10-05 23:30:24,576 INFO L226 Difference]: Without dead ends: 1136 [2020-10-05 23:30:24,576 INFO L675 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-05 23:30:24,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2020-10-05 23:30:24,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1133. [2020-10-05 23:30:24,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2020-10-05 23:30:24,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 3470 transitions. [2020-10-05 23:30:24,605 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 3470 transitions. Word has length 24 [2020-10-05 23:30:24,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:24,606 INFO L479 AbstractCegarLoop]: Abstraction has 1133 states and 3470 transitions. [2020-10-05 23:30:24,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:30:24,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 3470 transitions. [2020-10-05 23:30:24,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 23:30:24,610 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:24,610 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:24,610 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:30:24,610 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:24,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:24,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1064753958, now seen corresponding path program 1 times [2020-10-05 23:30:24,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:24,612 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445358983] [2020-10-05 23:30:24,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:24,711 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-05 23:30:24,711 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445358983] [2020-10-05 23:30:24,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:24,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:30:24,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591585758] [2020-10-05 23:30:24,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:30:24,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:24,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:30:24,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:30:24,713 INFO L87 Difference]: Start difference. First operand 1133 states and 3470 transitions. Second operand 9 states. [2020-10-05 23:30:24,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:24,893 INFO L93 Difference]: Finished difference Result 1590 states and 4717 transitions. [2020-10-05 23:30:24,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-05 23:30:24,894 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-10-05 23:30:24,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:24,898 INFO L225 Difference]: With dead ends: 1590 [2020-10-05 23:30:24,898 INFO L226 Difference]: Without dead ends: 1085 [2020-10-05 23:30:24,899 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-10-05 23:30:24,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2020-10-05 23:30:24,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1057. [2020-10-05 23:30:24,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1057 states. [2020-10-05 23:30:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 3090 transitions. [2020-10-05 23:30:24,924 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 3090 transitions. Word has length 24 [2020-10-05 23:30:24,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:24,925 INFO L479 AbstractCegarLoop]: Abstraction has 1057 states and 3090 transitions. [2020-10-05 23:30:24,925 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:30:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 3090 transitions. [2020-10-05 23:30:24,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-05 23:30:24,928 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:24,928 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:24,929 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:30:24,929 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:24,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:24,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1374941136, now seen corresponding path program 2 times [2020-10-05 23:30:24,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:24,930 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655509800] [2020-10-05 23:30:24,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:25,034 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-05 23:30:25,034 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655509800] [2020-10-05 23:30:25,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:25,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:30:25,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595996962] [2020-10-05 23:30:25,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:30:25,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:25,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:30:25,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:30:25,037 INFO L87 Difference]: Start difference. First operand 1057 states and 3090 transitions. Second operand 7 states. [2020-10-05 23:30:25,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:25,120 INFO L93 Difference]: Finished difference Result 1025 states and 3025 transitions. [2020-10-05 23:30:25,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 23:30:25,121 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-05 23:30:25,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:25,123 INFO L225 Difference]: With dead ends: 1025 [2020-10-05 23:30:25,123 INFO L226 Difference]: Without dead ends: 533 [2020-10-05 23:30:25,124 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:30:25,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-10-05 23:30:25,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 517. [2020-10-05 23:30:25,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2020-10-05 23:30:25,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1416 transitions. [2020-10-05 23:30:25,135 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1416 transitions. Word has length 24 [2020-10-05 23:30:25,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:25,135 INFO L479 AbstractCegarLoop]: Abstraction has 517 states and 1416 transitions. [2020-10-05 23:30:25,135 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:30:25,135 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1416 transitions. [2020-10-05 23:30:25,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-05 23:30:25,137 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:25,137 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:25,137 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:30:25,138 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:25,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:25,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1247530391, now seen corresponding path program 1 times [2020-10-05 23:30:25,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:25,138 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542444458] [2020-10-05 23:30:25,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:25,202 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-05 23:30:25,203 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542444458] [2020-10-05 23:30:25,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:25,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:30:25,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22988622] [2020-10-05 23:30:25,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:30:25,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:25,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:30:25,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:30:25,205 INFO L87 Difference]: Start difference. First operand 517 states and 1416 transitions. Second operand 4 states. [2020-10-05 23:30:25,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:25,224 INFO L93 Difference]: Finished difference Result 522 states and 1420 transitions. [2020-10-05 23:30:25,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:30:25,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-10-05 23:30:25,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:25,226 INFO L225 Difference]: With dead ends: 522 [2020-10-05 23:30:25,226 INFO L226 Difference]: Without dead ends: 347 [2020-10-05 23:30:25,227 INFO L675 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-05 23:30:25,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2020-10-05 23:30:25,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2020-10-05 23:30:25,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2020-10-05 23:30:25,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 944 transitions. [2020-10-05 23:30:25,234 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 944 transitions. Word has length 28 [2020-10-05 23:30:25,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:25,235 INFO L479 AbstractCegarLoop]: Abstraction has 347 states and 944 transitions. [2020-10-05 23:30:25,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:30:25,235 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 944 transitions. [2020-10-05 23:30:25,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-05 23:30:25,236 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:25,236 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:25,237 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:30:25,237 INFO L427 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:25,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:25,237 INFO L82 PathProgramCache]: Analyzing trace with hash -648793259, now seen corresponding path program 2 times [2020-10-05 23:30:25,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:25,238 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604556847] [2020-10-05 23:30:25,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:25,561 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-05 23:30:25,561 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604556847] [2020-10-05 23:30:25,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:25,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:30:25,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833840258] [2020-10-05 23:30:25,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:30:25,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:25,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:30:25,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:30:25,563 INFO L87 Difference]: Start difference. First operand 347 states and 944 transitions. Second operand 7 states. [2020-10-05 23:30:25,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:25,780 INFO L93 Difference]: Finished difference Result 527 states and 1453 transitions. [2020-10-05 23:30:25,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:30:25,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-10-05 23:30:25,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:25,782 INFO L225 Difference]: With dead ends: 527 [2020-10-05 23:30:25,782 INFO L226 Difference]: Without dead ends: 485 [2020-10-05 23:30:25,783 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:30:25,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2020-10-05 23:30:25,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 331. [2020-10-05 23:30:25,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2020-10-05 23:30:25,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 880 transitions. [2020-10-05 23:30:25,792 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 880 transitions. Word has length 28 [2020-10-05 23:30:25,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:25,792 INFO L479 AbstractCegarLoop]: Abstraction has 331 states and 880 transitions. [2020-10-05 23:30:25,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:30:25,792 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 880 transitions. [2020-10-05 23:30:25,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-05 23:30:25,794 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:25,794 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:25,794 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 23:30:25,795 INFO L427 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:25,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:25,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1438094207, now seen corresponding path program 3 times [2020-10-05 23:30:25,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:25,795 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360103257] [2020-10-05 23:30:25,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:26,250 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-05 23:30:26,251 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360103257] [2020-10-05 23:30:26,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:26,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:30:26,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527619812] [2020-10-05 23:30:26,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 23:30:26,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:26,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 23:30:26,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:30:26,252 INFO L87 Difference]: Start difference. First operand 331 states and 880 transitions. Second operand 8 states. [2020-10-05 23:30:26,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:26,513 INFO L93 Difference]: Finished difference Result 475 states and 1277 transitions. [2020-10-05 23:30:26,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:30:26,514 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-10-05 23:30:26,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:26,515 INFO L225 Difference]: With dead ends: 475 [2020-10-05 23:30:26,515 INFO L226 Difference]: Without dead ends: 429 [2020-10-05 23:30:26,516 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-05 23:30:26,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2020-10-05 23:30:26,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 323. [2020-10-05 23:30:26,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-10-05 23:30:26,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 856 transitions. [2020-10-05 23:30:26,523 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 856 transitions. Word has length 28 [2020-10-05 23:30:26,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:26,523 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 856 transitions. [2020-10-05 23:30:26,523 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 23:30:26,523 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 856 transitions. [2020-10-05 23:30:26,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-05 23:30:26,524 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:26,525 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:26,525 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-05 23:30:26,525 INFO L427 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:26,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:26,525 INFO L82 PathProgramCache]: Analyzing trace with hash -765407833, now seen corresponding path program 4 times [2020-10-05 23:30:26,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:26,526 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050174466] [2020-10-05 23:30:26,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:26,780 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-05 23:30:26,783 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050174466] [2020-10-05 23:30:26,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:26,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:30:26,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678226723] [2020-10-05 23:30:26,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:30:26,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:26,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:30:26,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:30:26,786 INFO L87 Difference]: Start difference. First operand 323 states and 856 transitions. Second operand 7 states. [2020-10-05 23:30:27,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:27,021 INFO L93 Difference]: Finished difference Result 483 states and 1291 transitions. [2020-10-05 23:30:27,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:30:27,022 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-10-05 23:30:27,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:27,023 INFO L225 Difference]: With dead ends: 483 [2020-10-05 23:30:27,023 INFO L226 Difference]: Without dead ends: 417 [2020-10-05 23:30:27,023 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:30:27,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2020-10-05 23:30:27,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 295. [2020-10-05 23:30:27,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2020-10-05 23:30:27,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 772 transitions. [2020-10-05 23:30:27,030 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 772 transitions. Word has length 28 [2020-10-05 23:30:27,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:27,031 INFO L479 AbstractCegarLoop]: Abstraction has 295 states and 772 transitions. [2020-10-05 23:30:27,031 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:30:27,031 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 772 transitions. [2020-10-05 23:30:27,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-05 23:30:27,032 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:27,032 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:27,032 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-05 23:30:27,032 INFO L427 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:27,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:27,033 INFO L82 PathProgramCache]: Analyzing trace with hash 821735187, now seen corresponding path program 5 times [2020-10-05 23:30:27,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:27,033 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822365166] [2020-10-05 23:30:27,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:30:27,658 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-05 23:30:27,659 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822365166] [2020-10-05 23:30:27,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:30:27,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-05 23:30:27,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869062992] [2020-10-05 23:30:27,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-05 23:30:27,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:30:27,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-05 23:30:27,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-05 23:30:27,661 INFO L87 Difference]: Start difference. First operand 295 states and 772 transitions. Second operand 9 states. [2020-10-05 23:30:28,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:30:28,052 INFO L93 Difference]: Finished difference Result 458 states and 1188 transitions. [2020-10-05 23:30:28,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 23:30:28,053 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2020-10-05 23:30:28,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:30:28,054 INFO L225 Difference]: With dead ends: 458 [2020-10-05 23:30:28,054 INFO L226 Difference]: Without dead ends: 372 [2020-10-05 23:30:28,055 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-10-05 23:30:28,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2020-10-05 23:30:28,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 265. [2020-10-05 23:30:28,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2020-10-05 23:30:28,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 704 transitions. [2020-10-05 23:30:28,063 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 704 transitions. Word has length 28 [2020-10-05 23:30:28,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:30:28,064 INFO L479 AbstractCegarLoop]: Abstraction has 265 states and 704 transitions. [2020-10-05 23:30:28,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-05 23:30:28,064 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 704 transitions. [2020-10-05 23:30:28,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-05 23:30:28,065 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:30:28,065 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:30:28,066 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-05 23:30:28,066 INFO L427 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:30:28,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:30:28,066 INFO L82 PathProgramCache]: Analyzing trace with hash -196915649, now seen corresponding path program 6 times [2020-10-05 23:30:28,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:30:28,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617474186] [2020-10-05 23:30:28,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:30:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:30:28,198 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:30:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:30:28,241 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:30:28,280 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:30:28,280 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:30:28,281 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-05 23:30:28,282 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:30:28,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1167] [1167] L853-->L860: Formula: (let ((.cse9 (= 0 (mod ~x$r_buff1_thd0~0_In-593268436 256))) (.cse8 (= (mod ~x$w_buff1_used~0_In-593268436 256) 0)) (.cse6 (= (mod ~x$w_buff0_used~0_In-593268436 256) 0)) (.cse7 (= (mod ~x$r_buff0_thd0~0_In-593268436 256) 0))) (let ((.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse3 (or .cse6 .cse7))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-593268436 0)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-593268436 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-593268436|) (or (and .cse0 .cse1 (= ~x$w_buff1_used~0_Out-593268436 0)) (and .cse2 (= ~x$w_buff1_used~0_In-593268436 ~x$w_buff1_used~0_Out-593268436))) (= ~x$r_buff1_thd0~0_Out-593268436 ~x$r_buff1_thd0~0_In-593268436) (or (and (= ~x$w_buff0_used~0_Out-593268436 ~x$w_buff0_used~0_In-593268436) .cse3) (and .cse4 .cse5 (= ~x$w_buff0_used~0_Out-593268436 0))) (= ~x$r_buff0_thd0~0_In-593268436 ~x$r_buff0_thd0~0_Out-593268436) (or (and .cse4 .cse5 (= ~x$w_buff0~0_In-593268436 ~x~0_Out-593268436)) (and (or (and (= ~x$w_buff1~0_In-593268436 ~x~0_Out-593268436) .cse0 .cse1) (and (= ~x~0_In-593268436 ~x~0_Out-593268436) .cse2)) .cse3))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-593268436, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-593268436, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-593268436|, ~x$w_buff1~0=~x$w_buff1~0_In-593268436, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-593268436, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-593268436, ~x~0=~x~0_In-593268436, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-593268436} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-593268436, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-593268436, ~x$w_buff1~0=~x$w_buff1~0_In-593268436, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-593268436|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-593268436, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-593268436, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-593268436|, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-593268436|, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-593268436|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-593268436, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-593268436|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-593268436|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-593268436|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-593268436, ~x~0=~x~0_Out-593268436} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32, ~x~0, ULTIMATE.start_main_#t~ite33, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2020-10-05 23:30:28,305 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-05 23:30:28,305 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,309 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-05 23:30:28,309 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,309 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-05 23:30:28,309 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,309 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-05 23:30:28,309 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,310 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-05 23:30:28,310 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,310 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-05 23:30:28,310 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,310 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-05 23:30:28,310 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,311 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-05 23:30:28,311 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,311 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-05 23:30:28,311 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,312 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-05 23:30:28,312 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,312 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-05 23:30:28,312 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,312 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-05 23:30:28,313 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,313 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-05 23:30:28,313 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,313 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-05 23:30:28,314 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,314 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-05 23:30:28,314 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,314 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-05 23:30:28,314 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,314 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-05 23:30:28,315 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,315 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-05 23:30:28,315 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,315 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-05 23:30:28,316 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,316 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-05 23:30:28,316 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,316 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-05 23:30:28,316 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,316 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-05 23:30:28,316 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,317 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-05 23:30:28,317 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,317 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-05 23:30:28,318 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,318 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-05 23:30:28,318 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,318 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-05 23:30:28,318 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,318 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-05 23:30:28,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,319 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-05 23:30:28,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,323 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-05 23:30:28,326 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,326 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-05 23:30:28,326 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,327 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-05 23:30:28,327 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,327 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-05 23:30:28,327 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,327 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-05 23:30:28,327 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,327 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-05 23:30:28,327 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,327 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-05 23:30:28,327 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,327 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-05 23:30:28,328 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:30:28,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:30:28 BasicIcfg [2020-10-05 23:30:28,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:30:28,442 INFO L168 Benchmark]: Toolchain (without parser) took 21632.09 ms. Allocated memory was 140.5 MB in the beginning and 524.8 MB in the end (delta: 384.3 MB). Free memory was 102.2 MB in the beginning and 378.7 MB in the end (delta: -276.4 MB). Peak memory consumption was 107.9 MB. Max. memory is 7.1 GB. [2020-10-05 23:30:28,442 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-05 23:30:28,443 INFO L168 Benchmark]: CACSL2BoogieTranslator took 789.34 ms. Allocated memory was 140.5 MB in the beginning and 230.2 MB in the end (delta: 89.7 MB). Free memory was 102.0 MB in the beginning and 192.2 MB in the end (delta: -90.2 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:30:28,444 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.02 ms. Allocated memory is still 230.2 MB. Free memory was 192.2 MB in the beginning and 189.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-05 23:30:28,444 INFO L168 Benchmark]: Boogie Preprocessor took 46.44 ms. Allocated memory is still 230.2 MB. Free memory was 189.5 MB in the beginning and 186.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-05 23:30:28,445 INFO L168 Benchmark]: RCFGBuilder took 2552.78 ms. Allocated memory was 230.2 MB in the beginning and 244.3 MB in the end (delta: 14.2 MB). Free memory was 186.8 MB in the beginning and 187.9 MB in the end (delta: -1.1 MB). Peak memory consumption was 108.7 MB. Max. memory is 7.1 GB. [2020-10-05 23:30:28,445 INFO L168 Benchmark]: TraceAbstraction took 18159.07 ms. Allocated memory was 244.3 MB in the beginning and 524.8 MB in the end (delta: 280.5 MB). Free memory was 187.9 MB in the beginning and 378.7 MB in the end (delta: -190.7 MB). Peak memory consumption was 89.8 MB. Max. memory is 7.1 GB. [2020-10-05 23:30:28,449 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.24 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 789.34 ms. Allocated memory was 140.5 MB in the beginning and 230.2 MB in the end (delta: 89.7 MB). Free memory was 102.0 MB in the beginning and 192.2 MB in the end (delta: -90.2 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.02 ms. Allocated memory is still 230.2 MB. Free memory was 192.2 MB in the beginning and 189.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.44 ms. Allocated memory is still 230.2 MB. Free memory was 189.5 MB in the beginning and 186.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2552.78 ms. Allocated memory was 230.2 MB in the beginning and 244.3 MB in the end (delta: 14.2 MB). Free memory was 186.8 MB in the beginning and 187.9 MB in the end (delta: -1.1 MB). Peak memory consumption was 108.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18159.07 ms. Allocated memory was 244.3 MB in the beginning and 524.8 MB in the end (delta: 280.5 MB). Free memory was 187.9 MB in the beginning and 378.7 MB in the end (delta: -190.7 MB). Peak memory consumption was 89.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 9.2s, 124 ProgramPointsBefore, 47 ProgramPointsAfterwards, 113 TransitionsBefore, 34 TransitionsAfterwards, 2706 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 1313 VarBasedMoverChecksPositive, 43 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 7447 CheckedPairsTotal, 86 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p1_EAX = 0; [L703] 0 int __unbuffered_p2_EAX = 0; [L705] 0 int __unbuffered_p3_EAX = 0; [L707] 0 int __unbuffered_p3_EBX = 0; [L709] 0 int a = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L714] 0 _Bool x$flush_delayed; [L715] 0 int x$mem_tmp; [L716] 0 _Bool x$r_buff0_thd0; [L717] 0 _Bool x$r_buff0_thd1; [L718] 0 _Bool x$r_buff0_thd2; [L719] 0 _Bool x$r_buff0_thd3; [L720] 0 _Bool x$r_buff0_thd4; [L721] 0 _Bool x$r_buff1_thd0; [L722] 0 _Bool x$r_buff1_thd1; [L723] 0 _Bool x$r_buff1_thd2; [L724] 0 _Bool x$r_buff1_thd3; [L725] 0 _Bool x$r_buff1_thd4; [L726] 0 _Bool x$read_delayed; [L727] 0 int *x$read_delayed_var; [L728] 0 int x$w_buff0; [L729] 0 _Bool x$w_buff0_used; [L730] 0 int x$w_buff1; [L731] 0 _Bool x$w_buff1_used; [L733] 0 int y = 0; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L842] 0 pthread_t t489; [L843] FCALL, FORK 0 pthread_create(&t489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L844] 0 pthread_t t490; [L845] FCALL, FORK 0 pthread_create(&t490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L771] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L846] 0 pthread_t t491; [L847] FCALL, FORK 0 pthread_create(&t491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t492; [L849] FCALL, FORK 0 pthread_create(&t492, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L791] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L811] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L814] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0: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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L817] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0: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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L820] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L820] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L820] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L820] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L821] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L821] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L822] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L822] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L823] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L823] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L824] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L824] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L827] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L829] 4 return 0; [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L801] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L804] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 3 return 0; [L744] 1 x = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L781] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 2 return 0; [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L862] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L863] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L864] 0 x$flush_delayed = weak$$choice2 [L865] 0 x$mem_tmp = x [L866] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L866] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L866] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L866] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L867] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L867] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L867] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L867] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L868] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L868] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L868] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L868] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L869] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L869] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L869] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L869] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L870] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L870] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L871] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L872] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L872] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L874] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L874] 0 x = x$flush_delayed ? x$mem_tmp : x [L875] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 112 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.8s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.5s, HoareTripleCheckerStatistics: 613 SDtfs, 1162 SDslu, 1278 SDs, 0 SdLazy, 642 SolverSat, 309 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4872occurred 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: 1.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 1182 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 382 NumberOfCodeBlocks, 382 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 336 ConstructedInterpolants, 0 QuantifiedInterpolants, 103654 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...