/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 17:12:33,297 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 17:12:33,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 17:12:33,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 17:12:33,340 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 17:12:33,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 17:12:33,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 17:12:33,346 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 17:12:33,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 17:12:33,351 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 17:12:33,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 17:12:33,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 17:12:33,355 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 17:12:33,356 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 17:12:33,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 17:12:33,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 17:12:33,361 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 17:12:33,362 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 17:12:33,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 17:12:33,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 17:12:33,377 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 17:12:33,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 17:12:33,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 17:12:33,382 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 17:12:33,389 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 17:12:33,389 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 17:12:33,389 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 17:12:33,391 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 17:12:33,392 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 17:12:33,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 17:12:33,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 17:12:33,397 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 17:12:33,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 17:12:33,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 17:12:33,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 17:12:33,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 17:12:33,405 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 17:12:33,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 17:12:33,405 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 17:12:33,407 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 17:12:33,408 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 17:12:33,409 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-SP.epf [2020-11-09 17:12:33,472 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 17:12:33,472 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 17:12:33,479 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 17:12:33,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 17:12:33,479 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 17:12:33,479 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 17:12:33,480 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 17:12:33,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 17:12:33,480 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 17:12:33,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 17:12:33,482 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 17:12:33,482 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 17:12:33,482 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 17:12:33,482 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 17:12:33,483 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 17:12:33,483 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 17:12:33,483 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 17:12:33,483 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 17:12:33,483 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 17:12:33,484 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 17:12:33,484 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 17:12:33,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 17:12:33,484 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 17:12:33,484 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 17:12:33,485 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 17:12:33,485 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 17:12:33,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 17:12:33,485 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 17:12:33,485 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 17:12:33,486 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 17:12:33,486 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-09 17:12:33,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 17:12:33,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 17:12:33,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 17:12:33,980 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 17:12:33,981 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 17:12:33,982 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i [2020-11-09 17:12:34,079 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a891cceeb/036b5a93834a47d6ac93db7de355af20/FLAG5e7b3662f [2020-11-09 17:12:35,048 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 17:12:35,049 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_power.opt.i [2020-11-09 17:12:35,080 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a891cceeb/036b5a93834a47d6ac93db7de355af20/FLAG5e7b3662f [2020-11-09 17:12:35,227 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a891cceeb/036b5a93834a47d6ac93db7de355af20 [2020-11-09 17:12:35,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 17:12:35,239 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 17:12:35,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 17:12:35,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 17:12:35,246 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 17:12:35,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:12:35" (1/1) ... [2020-11-09 17:12:35,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b609cf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:12:35, skipping insertion in model container [2020-11-09 17:12:35,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:12:35" (1/1) ... [2020-11-09 17:12:35,261 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 17:12:35,313 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 17:12:35,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 17:12:35,807 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 17:12:35,933 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 17:12:36,099 INFO L208 MainTranslator]: Completed translation [2020-11-09 17:12:36,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:12:36 WrapperNode [2020-11-09 17:12:36,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 17:12:36,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 17:12:36,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 17:12:36,105 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 17:12:36,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:12:36" (1/1) ... [2020-11-09 17:12:36,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:12:36" (1/1) ... [2020-11-09 17:12:36,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 17:12:36,221 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 17:12:36,221 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 17:12:36,221 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 17:12:36,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:12:36" (1/1) ... [2020-11-09 17:12:36,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:12:36" (1/1) ... [2020-11-09 17:12:36,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:12:36" (1/1) ... [2020-11-09 17:12:36,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:12:36" (1/1) ... [2020-11-09 17:12:36,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:12:36" (1/1) ... [2020-11-09 17:12:36,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:12:36" (1/1) ... [2020-11-09 17:12:36,259 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:12:36" (1/1) ... [2020-11-09 17:12:36,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 17:12:36,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 17:12:36,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 17:12:36,266 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 17:12:36,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:12:36" (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-11-09 17:12:36,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 17:12:36,358 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 17:12:36,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 17:12:36,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 17:12:36,359 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 17:12:36,359 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 17:12:36,359 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 17:12:36,359 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 17:12:36,359 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 17:12:36,360 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 17:12:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 17:12:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 17:12:36,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 17:12:36,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 17:12:36,363 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 17:12:38,794 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 17:12:38,794 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 17:12:38,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:12:38 BoogieIcfgContainer [2020-11-09 17:12:38,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 17:12:38,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 17:12:38,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 17:12:38,803 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 17:12:38,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:12:35" (1/3) ... [2020-11-09 17:12:38,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e184f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:12:38, skipping insertion in model container [2020-11-09 17:12:38,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:12:36" (2/3) ... [2020-11-09 17:12:38,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e184f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:12:38, skipping insertion in model container [2020-11-09 17:12:38,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:12:38" (3/3) ... [2020-11-09 17:12:38,806 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_power.opt.i [2020-11-09 17:12:38,826 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 17:12:38,826 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 17:12:38,832 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 17:12:38,833 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 17:12:38,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,896 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,896 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,897 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,897 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,899 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,899 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,900 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,900 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,903 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,904 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,904 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,904 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,904 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,906 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,906 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,906 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,906 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,907 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,907 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,908 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,909 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,910 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,912 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,912 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,912 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,912 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,913 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,913 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,913 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,913 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,915 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,917 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,918 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,918 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,918 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,918 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,918 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,919 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,919 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,919 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,919 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,919 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,919 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,920 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,920 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,923 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,923 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,923 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,925 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,925 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,926 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,927 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 17:12:38,928 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 17:12:38,951 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-09 17:12:38,978 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 17:12:38,978 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 17:12:38,978 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 17:12:38,978 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 17:12:38,978 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 17:12:38,979 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 17:12:38,979 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 17:12:38,979 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 17:12:38,994 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 17:12:38,995 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 99 transitions, 213 flow [2020-11-09 17:12:38,998 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 99 transitions, 213 flow [2020-11-09 17:12:39,001 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 99 transitions, 213 flow [2020-11-09 17:12:39,056 INFO L129 PetriNetUnfolder]: 3/96 cut-off events. [2020-11-09 17:12:39,056 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 17:12:39,061 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 3/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-11-09 17:12:39,065 INFO L116 LiptonReduction]: Number of co-enabled transitions 1746 [2020-11-09 17:12:40,847 WARN L194 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-11-09 17:12:40,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-11-09 17:12:40,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:40,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-11-09 17:12:40,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:42,297 WARN L194 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-11-09 17:12:45,044 WARN L194 SmtUtils]: Spent 2.74 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2020-11-09 17:12:45,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 17:12:45,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:45,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 17:12:45,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:45,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 17:12:45,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:45,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:12:45,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:45,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:45,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:45,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:45,105 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 17:12:45,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:45,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 17:12:45,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 17:12:45,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:45,135 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-09 17:12:45,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:45,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:12:45,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:45,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:12:45,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:45,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 17:12:45,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:45,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:12:45,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:45,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:12:45,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:45,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 17:12:45,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:45,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 17:12:45,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:45,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 17:12:45,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:45,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:12:45,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:45,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 17:12:45,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 17:12:45,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 17:12:45,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:48,891 WARN L194 SmtUtils]: Spent 3.65 s on a formula simplification. DAG size of input: 349 DAG size of output: 258 [2020-11-09 17:12:49,360 WARN L194 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2020-11-09 17:12:49,522 WARN L194 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-09 17:12:50,186 WARN L194 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-09 17:12:50,806 WARN L194 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2020-11-09 17:12:50,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 17:12:50,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 17:12:51,283 WARN L194 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2020-11-09 17:12:51,866 WARN L194 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 17:12:51,968 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 17:12:52,193 WARN L194 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-11-09 17:12:52,429 WARN L194 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-11-09 17:12:55,067 WARN L194 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 133 DAG size of output: 124 [2020-11-09 17:12:55,426 WARN L194 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-11-09 17:12:57,344 WARN L194 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 255 DAG size of output: 240 [2020-11-09 17:12:58,233 WARN L194 SmtUtils]: Spent 876.00 ms on a formula simplification that was a NOOP. DAG size: 239 [2020-11-09 17:12:59,323 WARN L194 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2020-11-09 17:12:59,705 WARN L194 SmtUtils]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-11-09 17:13:01,686 WARN L194 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 247 DAG size of output: 219 [2020-11-09 17:13:02,636 WARN L194 SmtUtils]: Spent 946.00 ms on a formula simplification that was a NOOP. DAG size: 218 [2020-11-09 17:13:03,465 WARN L194 SmtUtils]: Spent 826.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 107 [2020-11-09 17:13:03,864 WARN L194 SmtUtils]: Spent 394.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-11-09 17:13:05,865 WARN L194 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 247 DAG size of output: 218 [2020-11-09 17:13:06,868 WARN L194 SmtUtils]: Spent 998.00 ms on a formula simplification that was a NOOP. DAG size: 217 [2020-11-09 17:13:07,771 WARN L194 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-11-09 17:13:07,936 WARN L194 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-11-09 17:13:08,127 WARN L194 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-11-09 17:13:08,296 WARN L194 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-11-09 17:13:08,883 WARN L194 SmtUtils]: Spent 585.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2020-11-09 17:13:09,412 WARN L194 SmtUtils]: Spent 525.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-11-09 17:13:12,423 WARN L194 SmtUtils]: Spent 3.01 s on a formula simplification. DAG size of input: 259 DAG size of output: 257 [2020-11-09 17:13:14,013 WARN L194 SmtUtils]: Spent 1.58 s on a formula simplification that was a NOOP. DAG size: 254 [2020-11-09 17:13:14,615 WARN L194 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2020-11-09 17:13:14,854 WARN L194 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-11-09 17:13:15,359 WARN L194 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2020-11-09 17:13:15,576 WARN L194 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-11-09 17:13:15,582 INFO L131 LiptonReduction]: Checked pairs total: 4589 [2020-11-09 17:13:15,582 INFO L133 LiptonReduction]: Total number of compositions: 92 [2020-11-09 17:13:15,590 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-11-09 17:13:15,647 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 650 states. [2020-11-09 17:13:15,650 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states. [2020-11-09 17:13:15,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-09 17:13:15,656 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:15,657 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:13:15,658 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:15,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:15,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1733301844, now seen corresponding path program 1 times [2020-11-09 17:13:15,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:15,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736761374] [2020-11-09 17:13:15,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:13:16,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:13:16,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736761374] [2020-11-09 17:13:16,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:13:16,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 17:13:16,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2026522510] [2020-11-09 17:13:16,117 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:13:16,127 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:13:16,146 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-11-09 17:13:16,146 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:13:16,152 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:13:16,153 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 17:13:16,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:13:16,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 17:13:16,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:13:16,177 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 3 states. [2020-11-09 17:13:16,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:13:16,329 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-11-09 17:13:16,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 17:13:16,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-09 17:13:16,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:13:16,360 INFO L225 Difference]: With dead ends: 550 [2020-11-09 17:13:16,360 INFO L226 Difference]: Without dead ends: 450 [2020-11-09 17:13:16,362 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:13:16,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-11-09 17:13:16,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-11-09 17:13:16,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-11-09 17:13:16,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-11-09 17:13:16,453 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 7 [2020-11-09 17:13:16,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:13:16,454 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-11-09 17:13:16,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 17:13:16,455 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-11-09 17:13:16,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 17:13:16,456 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:16,456 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:13:16,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 17:13:16,457 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:16,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:16,457 INFO L82 PathProgramCache]: Analyzing trace with hash 744298320, now seen corresponding path program 1 times [2020-11-09 17:13:16,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:16,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792867775] [2020-11-09 17:13:16,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:16,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:13:16,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:13:16,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792867775] [2020-11-09 17:13:16,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:13:16,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 17:13:16,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [311221308] [2020-11-09 17:13:16,631 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:13:16,632 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:13:16,635 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-11-09 17:13:16,636 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:13:16,637 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:13:16,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 17:13:16,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:13:16,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 17:13:16,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:13:16,643 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-11-09 17:13:16,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:13:16,680 INFO L93 Difference]: Finished difference Result 440 states and 1320 transitions. [2020-11-09 17:13:16,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 17:13:16,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-09 17:13:16,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:13:16,695 INFO L225 Difference]: With dead ends: 440 [2020-11-09 17:13:16,695 INFO L226 Difference]: Without dead ends: 440 [2020-11-09 17:13:16,696 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:13:16,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-11-09 17:13:16,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-11-09 17:13:16,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-11-09 17:13:16,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2020-11-09 17:13:16,750 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 9 [2020-11-09 17:13:16,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:13:16,751 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2020-11-09 17:13:16,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 17:13:16,751 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2020-11-09 17:13:16,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-09 17:13:16,752 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:16,753 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:13:16,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 17:13:16,754 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:16,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:16,755 INFO L82 PathProgramCache]: Analyzing trace with hash -116742298, now seen corresponding path program 1 times [2020-11-09 17:13:16,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:16,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114094827] [2020-11-09 17:13:16,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:13:16,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:13:16,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114094827] [2020-11-09 17:13:16,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:13:16,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 17:13:16,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [210214842] [2020-11-09 17:13:16,846 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:13:16,847 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:13:16,849 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-11-09 17:13:16,849 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:13:16,978 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:13:16,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 17:13:16,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:13:16,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 17:13:16,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:13:16,980 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand 3 states. [2020-11-09 17:13:17,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:13:17,019 INFO L93 Difference]: Finished difference Result 439 states and 1316 transitions. [2020-11-09 17:13:17,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 17:13:17,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-11-09 17:13:17,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:13:17,025 INFO L225 Difference]: With dead ends: 439 [2020-11-09 17:13:17,026 INFO L226 Difference]: Without dead ends: 439 [2020-11-09 17:13:17,026 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-11-09 17:13:17,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-11-09 17:13:17,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2020-11-09 17:13:17,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2020-11-09 17:13:17,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1316 transitions. [2020-11-09 17:13:17,043 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1316 transitions. Word has length 10 [2020-11-09 17:13:17,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:13:17,044 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 1316 transitions. [2020-11-09 17:13:17,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 17:13:17,044 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1316 transitions. [2020-11-09 17:13:17,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 17:13:17,046 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:17,046 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:13:17,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 17:13:17,047 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:17,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:17,047 INFO L82 PathProgramCache]: Analyzing trace with hash 675955009, now seen corresponding path program 1 times [2020-11-09 17:13:17,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:17,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620317530] [2020-11-09 17:13:17,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:13:17,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:13:17,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620317530] [2020-11-09 17:13:17,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:13:17,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 17:13:17,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1777054512] [2020-11-09 17:13:17,144 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:13:17,146 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:13:17,149 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 25 transitions. [2020-11-09 17:13:17,150 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:13:17,268 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:13:17,268 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 17:13:17,268 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:13:17,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 17:13:17,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 17:13:17,270 INFO L87 Difference]: Start difference. First operand 439 states and 1316 transitions. Second operand 4 states. [2020-11-09 17:13:17,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:13:17,361 INFO L93 Difference]: Finished difference Result 432 states and 1290 transitions. [2020-11-09 17:13:17,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 17:13:17,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-11-09 17:13:17,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:13:17,367 INFO L225 Difference]: With dead ends: 432 [2020-11-09 17:13:17,367 INFO L226 Difference]: Without dead ends: 432 [2020-11-09 17:13:17,368 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:13:17,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-11-09 17:13:17,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2020-11-09 17:13:17,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2020-11-09 17:13:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1290 transitions. [2020-11-09 17:13:17,384 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 1290 transitions. Word has length 11 [2020-11-09 17:13:17,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:13:17,384 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 1290 transitions. [2020-11-09 17:13:17,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 17:13:17,385 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1290 transitions. [2020-11-09 17:13:17,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 17:13:17,386 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:17,386 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:13:17,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 17:13:17,387 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:17,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:17,387 INFO L82 PathProgramCache]: Analyzing trace with hash 675955071, now seen corresponding path program 1 times [2020-11-09 17:13:17,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:17,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460138180] [2020-11-09 17:13:17,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:13:17,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:13:17,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460138180] [2020-11-09 17:13:17,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:13:17,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 17:13:17,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1234081338] [2020-11-09 17:13:17,484 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:13:17,486 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:13:17,492 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 45 transitions. [2020-11-09 17:13:17,492 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:13:17,516 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 17:13:17,517 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:17,517 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:13:17,517 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:17,581 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 17:13:17,582 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:17,582 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:13:17,583 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:17,641 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 17:13:17,641 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:17,642 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:13:17,642 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:17,768 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:13:17,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 17:13:17,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:13:17,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 17:13:17,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:13:17,770 INFO L87 Difference]: Start difference. First operand 432 states and 1290 transitions. Second operand 3 states. [2020-11-09 17:13:17,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:13:17,806 INFO L93 Difference]: Finished difference Result 427 states and 1272 transitions. [2020-11-09 17:13:17,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 17:13:17,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-09 17:13:17,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:13:17,812 INFO L225 Difference]: With dead ends: 427 [2020-11-09 17:13:17,812 INFO L226 Difference]: Without dead ends: 427 [2020-11-09 17:13:17,813 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-11-09 17:13:17,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2020-11-09 17:13:17,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2020-11-09 17:13:17,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2020-11-09 17:13:17,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1272 transitions. [2020-11-09 17:13:17,831 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1272 transitions. Word has length 11 [2020-11-09 17:13:17,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:13:17,831 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 1272 transitions. [2020-11-09 17:13:17,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 17:13:17,832 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1272 transitions. [2020-11-09 17:13:17,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 17:13:17,835 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:17,836 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:13:17,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 17:13:17,836 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:17,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:17,837 INFO L82 PathProgramCache]: Analyzing trace with hash -520232188, now seen corresponding path program 1 times [2020-11-09 17:13:17,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:17,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49362448] [2020-11-09 17:13:17,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:13:18,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:13:18,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49362448] [2020-11-09 17:13:18,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:13:18,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 17:13:18,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1526292706] [2020-11-09 17:13:18,021 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:13:18,023 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:13:18,029 INFO L252 McrAutomatonBuilder]: Finished intersection with 31 states and 53 transitions. [2020-11-09 17:13:18,029 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:13:18,084 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 17:13:18,084 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:18,085 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:13:18,085 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:18,244 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 17 [2020-11-09 17:13:18,347 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 17:13:18,347 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:18,348 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:13:18,348 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:18,374 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 17:13:18,375 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:18,375 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:13:18,376 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:18,495 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [8096#(and (= ~y~0 ~y$w_buff0~0) (not (= 2 ~y$w_buff0~0)) (= ~y$r_buff0_thd0~0 0)), 8097#(and (= ~y~0 ~y$w_buff0~0) (not (= 2 ~y$w_buff0~0)) (or (= (mod ~y$w_buff1_used~0 256) 0) (= ~y$w_buff1~0 ~y$w_buff0~0)) (= ~y$r_buff0_thd0~0 0))] [2020-11-09 17:13:18,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 17:13:18,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:13:18,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 17:13:18,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-09 17:13:18,497 INFO L87 Difference]: Start difference. First operand 427 states and 1272 transitions. Second operand 7 states. [2020-11-09 17:13:18,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:13:18,605 INFO L93 Difference]: Finished difference Result 416 states and 1232 transitions. [2020-11-09 17:13:18,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 17:13:18,608 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-11-09 17:13:18,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:13:18,611 INFO L225 Difference]: With dead ends: 416 [2020-11-09 17:13:18,611 INFO L226 Difference]: Without dead ends: 416 [2020-11-09 17:13:18,612 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-11-09 17:13:18,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2020-11-09 17:13:18,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2020-11-09 17:13:18,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2020-11-09 17:13:18,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1232 transitions. [2020-11-09 17:13:18,626 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1232 transitions. Word has length 12 [2020-11-09 17:13:18,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:13:18,627 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 1232 transitions. [2020-11-09 17:13:18,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 17:13:18,627 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1232 transitions. [2020-11-09 17:13:18,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 17:13:18,628 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:18,628 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:13:18,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 17:13:18,628 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:18,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:18,629 INFO L82 PathProgramCache]: Analyzing trace with hash -520231351, now seen corresponding path program 1 times [2020-11-09 17:13:18,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:18,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84765110] [2020-11-09 17:13:18,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:13:18,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:13:18,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84765110] [2020-11-09 17:13:18,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:13:18,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 17:13:18,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [738187905] [2020-11-09 17:13:18,696 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:13:18,698 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:13:18,702 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 48 transitions. [2020-11-09 17:13:18,703 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:13:18,897 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:13:18,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 17:13:18,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:13:18,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 17:13:18,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 17:13:18,899 INFO L87 Difference]: Start difference. First operand 416 states and 1232 transitions. Second operand 4 states. [2020-11-09 17:13:18,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:13:18,963 INFO L93 Difference]: Finished difference Result 420 states and 1243 transitions. [2020-11-09 17:13:18,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 17:13:18,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-09 17:13:18,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:13:18,969 INFO L225 Difference]: With dead ends: 420 [2020-11-09 17:13:18,969 INFO L226 Difference]: Without dead ends: 420 [2020-11-09 17:13:18,969 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 17:13:18,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2020-11-09 17:13:18,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2020-11-09 17:13:18,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2020-11-09 17:13:18,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1243 transitions. [2020-11-09 17:13:18,984 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1243 transitions. Word has length 12 [2020-11-09 17:13:18,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:13:18,984 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 1243 transitions. [2020-11-09 17:13:18,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 17:13:18,985 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1243 transitions. [2020-11-09 17:13:18,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 17:13:18,986 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:18,986 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:13:18,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 17:13:18,986 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:18,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:18,987 INFO L82 PathProgramCache]: Analyzing trace with hash -521960221, now seen corresponding path program 2 times [2020-11-09 17:13:18,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:18,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957857589] [2020-11-09 17:13:18,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:13:19,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:13:19,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957857589] [2020-11-09 17:13:19,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:13:19,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 17:13:19,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2075110569] [2020-11-09 17:13:19,089 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:13:19,091 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:13:19,096 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 58 transitions. [2020-11-09 17:13:19,097 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:13:19,115 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 17:13:19,116 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:19,116 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:13:19,117 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:19,261 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:13:19,262 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 17:13:19,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:13:19,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 17:13:19,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:13:19,263 INFO L87 Difference]: Start difference. First operand 420 states and 1243 transitions. Second operand 5 states. [2020-11-09 17:13:19,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:13:19,331 INFO L93 Difference]: Finished difference Result 411 states and 1213 transitions. [2020-11-09 17:13:19,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 17:13:19,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-09 17:13:19,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:13:19,336 INFO L225 Difference]: With dead ends: 411 [2020-11-09 17:13:19,337 INFO L226 Difference]: Without dead ends: 411 [2020-11-09 17:13:19,337 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:13:19,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2020-11-09 17:13:19,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 407. [2020-11-09 17:13:19,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-11-09 17:13:19,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1202 transitions. [2020-11-09 17:13:19,351 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1202 transitions. Word has length 12 [2020-11-09 17:13:19,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:13:19,351 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 1202 transitions. [2020-11-09 17:13:19,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 17:13:19,352 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1202 transitions. [2020-11-09 17:13:19,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 17:13:19,353 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:19,353 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:13:19,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 17:13:19,353 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:19,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:19,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1052669284, now seen corresponding path program 1 times [2020-11-09 17:13:19,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:19,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191277441] [2020-11-09 17:13:19,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:13:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:13:19,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191277441] [2020-11-09 17:13:19,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:13:19,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 17:13:19,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [68378807] [2020-11-09 17:13:19,440 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:13:19,442 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:13:19,448 INFO L252 McrAutomatonBuilder]: Finished intersection with 35 states and 61 transitions. [2020-11-09 17:13:19,449 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:13:19,733 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [11847#(and (= ~y~0 1) (= ~y$r_buff0_thd0~0 0))] [2020-11-09 17:13:19,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 17:13:19,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:13:19,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 17:13:19,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-09 17:13:19,734 INFO L87 Difference]: Start difference. First operand 407 states and 1202 transitions. Second operand 6 states. [2020-11-09 17:13:19,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:13:19,864 INFO L93 Difference]: Finished difference Result 432 states and 1264 transitions. [2020-11-09 17:13:19,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 17:13:19,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-11-09 17:13:19,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:13:19,871 INFO L225 Difference]: With dead ends: 432 [2020-11-09 17:13:19,871 INFO L226 Difference]: Without dead ends: 432 [2020-11-09 17:13:19,871 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-09 17:13:19,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-11-09 17:13:19,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 424. [2020-11-09 17:13:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2020-11-09 17:13:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1246 transitions. [2020-11-09 17:13:19,886 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 1246 transitions. Word has length 13 [2020-11-09 17:13:19,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:13:19,886 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 1246 transitions. [2020-11-09 17:13:19,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 17:13:19,886 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 1246 transitions. [2020-11-09 17:13:19,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 17:13:19,887 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:19,887 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:13:19,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 17:13:19,888 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:19,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:19,888 INFO L82 PathProgramCache]: Analyzing trace with hash -59459315, now seen corresponding path program 1 times [2020-11-09 17:13:19,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:19,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580804675] [2020-11-09 17:13:19,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:13:19,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:13:19,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580804675] [2020-11-09 17:13:19,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:13:19,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 17:13:19,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1389751842] [2020-11-09 17:13:19,976 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:13:19,978 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:13:19,984 INFO L252 McrAutomatonBuilder]: Finished intersection with 21 states and 27 transitions. [2020-11-09 17:13:19,985 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:13:20,058 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:13:20,058 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:20,060 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:13:20,060 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:20,062 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:13:20,062 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:20,090 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:13:20,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 17:13:20,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:13:20,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 17:13:20,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:13:20,092 INFO L87 Difference]: Start difference. First operand 424 states and 1246 transitions. Second operand 5 states. [2020-11-09 17:13:20,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:13:20,189 INFO L93 Difference]: Finished difference Result 585 states and 1675 transitions. [2020-11-09 17:13:20,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 17:13:20,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-09 17:13:20,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:13:20,194 INFO L225 Difference]: With dead ends: 585 [2020-11-09 17:13:20,195 INFO L226 Difference]: Without dead ends: 432 [2020-11-09 17:13:20,195 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 17:13:20,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2020-11-09 17:13:20,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 414. [2020-11-09 17:13:20,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2020-11-09 17:13:20,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 1168 transitions. [2020-11-09 17:13:20,209 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 1168 transitions. Word has length 13 [2020-11-09 17:13:20,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:13:20,210 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 1168 transitions. [2020-11-09 17:13:20,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 17:13:20,210 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 1168 transitions. [2020-11-09 17:13:20,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 17:13:20,211 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:20,211 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:13:20,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 17:13:20,211 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:20,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:20,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1726992605, now seen corresponding path program 1 times [2020-11-09 17:13:20,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:20,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481327475] [2020-11-09 17:13:20,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:13:20,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:13:20,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481327475] [2020-11-09 17:13:20,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:13:20,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 17:13:20,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1339127710] [2020-11-09 17:13:20,345 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:13:20,347 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:13:20,355 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 64 transitions. [2020-11-09 17:13:20,355 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:13:20,473 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 17:13:20,473 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:20,474 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:13:20,474 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:20,478 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:13:20,479 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:20,480 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:13:20,480 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:20,481 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:13:20,481 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:20,726 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [14554#(and (= ~y~0 1) (= ~y$w_buff0~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0))] [2020-11-09 17:13:20,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 17:13:20,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:13:20,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 17:13:20,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-09 17:13:20,727 INFO L87 Difference]: Start difference. First operand 414 states and 1168 transitions. Second operand 7 states. [2020-11-09 17:13:20,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:13:20,945 INFO L93 Difference]: Finished difference Result 468 states and 1279 transitions. [2020-11-09 17:13:20,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 17:13:20,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-11-09 17:13:20,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:13:20,948 INFO L225 Difference]: With dead ends: 468 [2020-11-09 17:13:20,948 INFO L226 Difference]: Without dead ends: 270 [2020-11-09 17:13:20,949 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-11-09 17:13:20,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2020-11-09 17:13:20,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 252. [2020-11-09 17:13:20,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2020-11-09 17:13:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 673 transitions. [2020-11-09 17:13:20,960 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 673 transitions. Word has length 14 [2020-11-09 17:13:20,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:13:20,961 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 673 transitions. [2020-11-09 17:13:20,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 17:13:20,961 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 673 transitions. [2020-11-09 17:13:20,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 17:13:20,962 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:20,962 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:13:20,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 17:13:20,962 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:20,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:20,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1843206923, now seen corresponding path program 1 times [2020-11-09 17:13:20,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:20,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913380521] [2020-11-09 17:13:20,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:21,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:13:21,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:13:21,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913380521] [2020-11-09 17:13:21,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:13:21,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 17:13:21,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [554426863] [2020-11-09 17:13:21,098 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:13:21,100 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:13:21,109 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 67 transitions. [2020-11-09 17:13:21,110 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:13:21,130 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:13:21,130 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:21,133 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:13:21,133 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:21,134 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:13:21,135 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:21,151 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:13:21,152 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:21,153 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:13:21,153 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:21,154 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:13:21,154 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:21,217 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 17:13:21,247 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [15535#(not (= 3 ~__unbuffered_cnt~0))] [2020-11-09 17:13:21,247 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 17:13:21,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:13:21,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 17:13:21,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 17:13:21,248 INFO L87 Difference]: Start difference. First operand 252 states and 673 transitions. Second operand 5 states. [2020-11-09 17:13:21,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:13:21,358 INFO L93 Difference]: Finished difference Result 182 states and 419 transitions. [2020-11-09 17:13:21,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 17:13:21,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-09 17:13:21,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:13:21,361 INFO L225 Difference]: With dead ends: 182 [2020-11-09 17:13:21,361 INFO L226 Difference]: Without dead ends: 112 [2020-11-09 17:13:21,362 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-09 17:13:21,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-09 17:13:21,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-11-09 17:13:21,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-11-09 17:13:21,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 216 transitions. [2020-11-09 17:13:21,365 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 216 transitions. Word has length 14 [2020-11-09 17:13:21,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:13:21,366 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 216 transitions. [2020-11-09 17:13:21,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 17:13:21,366 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 216 transitions. [2020-11-09 17:13:21,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 17:13:21,367 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:21,367 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:13:21,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 17:13:21,367 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:21,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:21,368 INFO L82 PathProgramCache]: Analyzing trace with hash -890637055, now seen corresponding path program 1 times [2020-11-09 17:13:21,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:21,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111203853] [2020-11-09 17:13:21,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:13:21,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:13:21,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111203853] [2020-11-09 17:13:21,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:13:21,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 17:13:21,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1769389678] [2020-11-09 17:13:21,458 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:13:21,461 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:13:21,467 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 46 transitions. [2020-11-09 17:13:21,468 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:13:21,478 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:13:21,479 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:21,480 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:13:21,480 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:21,481 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:13:21,481 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:21,509 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 17:13:21,509 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 17:13:21,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:13:21,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 17:13:21,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:13:21,510 INFO L87 Difference]: Start difference. First operand 112 states and 216 transitions. Second operand 3 states. [2020-11-09 17:13:21,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:13:21,523 INFO L93 Difference]: Finished difference Result 151 states and 281 transitions. [2020-11-09 17:13:21,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 17:13:21,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-11-09 17:13:21,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:13:21,526 INFO L225 Difference]: With dead ends: 151 [2020-11-09 17:13:21,526 INFO L226 Difference]: Without dead ends: 109 [2020-11-09 17:13:21,526 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 17:13:21,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-11-09 17:13:21,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2020-11-09 17:13:21,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-11-09 17:13:21,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 190 transitions. [2020-11-09 17:13:21,530 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 190 transitions. Word has length 16 [2020-11-09 17:13:21,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:13:21,530 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 190 transitions. [2020-11-09 17:13:21,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 17:13:21,530 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 190 transitions. [2020-11-09 17:13:21,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 17:13:21,531 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:21,531 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 17:13:21,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 17:13:21,531 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:21,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:21,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1839945916, now seen corresponding path program 1 times [2020-11-09 17:13:21,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:21,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379853885] [2020-11-09 17:13:21,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 17:13:21,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 17:13:21,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379853885] [2020-11-09 17:13:21,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 17:13:21,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 17:13:21,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1611014151] [2020-11-09 17:13:21,622 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 17:13:21,625 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 17:13:21,637 INFO L252 McrAutomatonBuilder]: Finished intersection with 57 states and 96 transitions. [2020-11-09 17:13:21,638 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 17:13:21,681 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 17:13:21,755 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 17:13:21,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:21,756 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:13:21,756 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:21,757 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:13:21,757 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:21,799 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 17:13:21,800 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:21,800 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 17:13:21,801 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:21,801 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 17:13:21,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 17:13:21,834 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [16320#(not (= 3 ~__unbuffered_cnt~0)), 16321#(not (= ~__unbuffered_cnt~0 2)), 16322#(not (= ~__unbuffered_cnt~0 1)), 16323#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 17:13:21,834 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 17:13:21,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 17:13:21,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 17:13:21,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-11-09 17:13:21,835 INFO L87 Difference]: Start difference. First operand 107 states and 190 transitions. Second operand 10 states. [2020-11-09 17:13:21,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 17:13:21,933 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2020-11-09 17:13:21,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 17:13:21,935 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2020-11-09 17:13:21,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 17:13:21,936 INFO L225 Difference]: With dead ends: 93 [2020-11-09 17:13:21,936 INFO L226 Difference]: Without dead ends: 35 [2020-11-09 17:13:21,936 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2020-11-09 17:13:21,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-11-09 17:13:21,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-11-09 17:13:21,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-11-09 17:13:21,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2020-11-09 17:13:21,938 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 17 [2020-11-09 17:13:21,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 17:13:21,938 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2020-11-09 17:13:21,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 17:13:21,939 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2020-11-09 17:13:21,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-09 17:13:21,939 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 17:13:21,939 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-11-09 17:13:21,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 17:13:21,939 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 17:13:21,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 17:13:21,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1539901826, now seen corresponding path program 1 times [2020-11-09 17:13:21,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 17:13:21,942 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260574030] [2020-11-09 17:13:21,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 17:13:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 17:13:21,999 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 17:13:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 17:13:22,047 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 17:13:22,117 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 17:13:22,117 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 17:13:22,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-09 17:13:22,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 05:13:22 BasicIcfg [2020-11-09 17:13:22,246 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 17:13:22,247 INFO L168 Benchmark]: Toolchain (without parser) took 47013.56 ms. Allocated memory was 151.0 MB in the beginning and 413.1 MB in the end (delta: 262.1 MB). Free memory was 125.7 MB in the beginning and 357.5 MB in the end (delta: -231.9 MB). Peak memory consumption was 31.0 MB. Max. memory is 8.0 GB. [2020-11-09 17:13:22,248 INFO L168 Benchmark]: CDTParser took 0.93 ms. Allocated memory is still 151.0 MB. Free memory was 123.7 MB in the beginning and 123.6 MB in the end (delta: 120.1 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 17:13:22,248 INFO L168 Benchmark]: CACSL2BoogieTranslator took 861.60 ms. Allocated memory is still 151.0 MB. Free memory was 125.1 MB in the beginning and 127.0 MB in the end (delta: -1.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 8.0 GB. [2020-11-09 17:13:22,249 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.98 ms. Allocated memory is still 151.0 MB. Free memory was 127.0 MB in the beginning and 124.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 17:13:22,250 INFO L168 Benchmark]: Boogie Preprocessor took 44.53 ms. Allocated memory is still 151.0 MB. Free memory was 124.3 MB in the beginning and 122.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 17:13:22,250 INFO L168 Benchmark]: RCFGBuilder took 2531.37 ms. Allocated memory was 151.0 MB in the beginning and 184.5 MB in the end (delta: 33.6 MB). Free memory was 121.7 MB in the beginning and 133.0 MB in the end (delta: -11.3 MB). Peak memory consumption was 95.7 MB. Max. memory is 8.0 GB. [2020-11-09 17:13:22,251 INFO L168 Benchmark]: TraceAbstraction took 43446.51 ms. Allocated memory was 184.5 MB in the beginning and 413.1 MB in the end (delta: 228.6 MB). Free memory was 132.5 MB in the beginning and 357.5 MB in the end (delta: -225.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 8.0 GB. [2020-11-09 17:13:22,255 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.93 ms. Allocated memory is still 151.0 MB. Free memory was 123.7 MB in the beginning and 123.6 MB in the end (delta: 120.1 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 861.60 ms. Allocated memory is still 151.0 MB. Free memory was 125.1 MB in the beginning and 127.0 MB in the end (delta: -1.9 MB). Peak memory consumption was 32.9 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 114.98 ms. Allocated memory is still 151.0 MB. Free memory was 127.0 MB in the beginning and 124.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 44.53 ms. Allocated memory is still 151.0 MB. Free memory was 124.3 MB in the beginning and 122.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2531.37 ms. Allocated memory was 151.0 MB in the beginning and 184.5 MB in the end (delta: 33.6 MB). Free memory was 121.7 MB in the beginning and 133.0 MB in the end (delta: -11.3 MB). Peak memory consumption was 95.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 43446.51 ms. Allocated memory was 184.5 MB in the beginning and 413.1 MB in the end (delta: 228.6 MB). Free memory was 132.5 MB in the beginning and 357.5 MB in the end (delta: -225.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 932 VarBasedMoverChecksPositive, 39 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 66 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 36.5s, 106 PlacesBefore, 35 PlacesAfterwards, 99 TransitionsBefore, 25 TransitionsAfterwards, 1746 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 92 TotalNumberOfCompositions, 4589 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2492; [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t2493; [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2494; [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L754] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 3 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe030_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 43.1s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 36.6s, HoareTripleCheckerStatistics: 290 SDtfs, 327 SDslu, 343 SDs, 0 SdLazy, 233 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 136 SyntacticMatches, 16 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 50 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 191 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 10856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...