/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:11:32,350 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:11:32,353 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:11:32,378 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:11:32,378 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:11:32,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:11:32,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:11:32,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:11:32,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:11:32,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:11:32,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:11:32,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:11:32,388 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:11:32,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:11:32,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:11:32,391 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:11:32,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:11:32,392 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:11:32,394 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:11:32,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:11:32,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:11:32,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:11:32,399 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:11:32,400 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:11:32,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:11:32,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:11:32,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:11:32,404 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:11:32,405 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:11:32,406 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:11:32,407 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:11:32,407 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:11:32,408 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:11:32,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:11:32,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:11:32,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:11:32,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:11:32,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:11:32,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:11:32,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:11:32,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:11:32,414 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-16 12:11:32,440 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:11:32,440 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:11:32,441 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:11:32,442 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:11:32,442 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:11:32,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:11:32,442 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:11:32,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:11:32,443 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:11:32,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:11:32,443 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:11:32,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:11:32,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:11:32,444 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:11:32,444 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:11:32,444 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:11:32,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:11:32,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:11:32,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:11:32,445 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:11:32,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:11:32,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:11:32,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:11:32,446 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:11:32,446 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:11:32,446 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:11:32,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:11:32,446 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:11:32,447 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:11:32,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:11:32,768 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:11:32,772 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:11:32,773 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:11:32,774 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:11:32,775 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i [2020-10-16 12:11:32,846 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e0cdc32a8/49e12af29dbd4a3080b1722d24f2ca93/FLAGb6768faf7 [2020-10-16 12:11:33,359 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:11:33,360 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe031_power.opt.i [2020-10-16 12:11:33,382 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e0cdc32a8/49e12af29dbd4a3080b1722d24f2ca93/FLAGb6768faf7 [2020-10-16 12:11:33,705 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e0cdc32a8/49e12af29dbd4a3080b1722d24f2ca93 [2020-10-16 12:11:33,713 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:11:33,714 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:11:33,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:11:33,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:11:33,719 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:11:33,720 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:11:33" (1/1) ... [2020-10-16 12:11:33,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2441e61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:33, skipping insertion in model container [2020-10-16 12:11:33,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:11:33" (1/1) ... [2020-10-16 12:11:33,730 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:11:33,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:11:34,265 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:11:34,278 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:11:34,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:11:34,435 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:11:34,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:34 WrapperNode [2020-10-16 12:11:34,436 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:11:34,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:11:34,437 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:11:34,437 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:11:34,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:34" (1/1) ... [2020-10-16 12:11:34,468 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:34" (1/1) ... [2020-10-16 12:11:34,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:11:34,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:11:34,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:11:34,519 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:11:34,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:34" (1/1) ... [2020-10-16 12:11:34,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:34" (1/1) ... [2020-10-16 12:11:34,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:34" (1/1) ... [2020-10-16 12:11:34,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:34" (1/1) ... [2020-10-16 12:11:34,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:34" (1/1) ... [2020-10-16 12:11:34,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:34" (1/1) ... [2020-10-16 12:11:34,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:34" (1/1) ... [2020-10-16 12:11:34,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:11:34,602 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:11:34,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:11:34,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:11:34,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:34" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:11:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:11:34,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:11:34,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:11:34,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:11:34,678 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:11:34,679 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:11:34,680 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:11:34,680 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:11:34,681 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:11:34,681 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:11:34,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:11:34,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:11:34,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:11:34,687 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 12:11:36,733 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:11:36,734 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:11:36,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:11:36 BoogieIcfgContainer [2020-10-16 12:11:36,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:11:36,738 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:11:36,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:11:36,742 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:11:36,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:11:33" (1/3) ... [2020-10-16 12:11:36,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e65bcdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:11:36, skipping insertion in model container [2020-10-16 12:11:36,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:11:34" (2/3) ... [2020-10-16 12:11:36,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e65bcdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:11:36, skipping insertion in model container [2020-10-16 12:11:36,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:11:36" (3/3) ... [2020-10-16 12:11:36,746 INFO L111 eAbstractionObserver]: Analyzing ICFG safe031_power.opt.i [2020-10-16 12:11:36,758 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:11:36,759 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:11:36,768 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:11:36,769 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:11:36,800 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,800 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,801 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,801 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,801 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,802 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,802 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,803 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,803 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,806 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,806 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,806 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,807 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,807 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,807 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,814 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,814 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,820 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,821 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,821 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,822 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,822 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,822 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,826 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,827 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:11:36,828 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:11:36,842 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 12:11:36,864 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:11:36,864 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:11:36,864 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:11:36,864 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:11:36,864 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:11:36,865 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:11:36,865 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:11:36,865 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:11:36,880 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:11:36,881 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 91 transitions, 197 flow [2020-10-16 12:11:36,884 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 91 transitions, 197 flow [2020-10-16 12:11:36,886 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 197 flow [2020-10-16 12:11:36,934 INFO L129 PetriNetUnfolder]: 2/88 cut-off events. [2020-10-16 12:11:36,934 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:11:36,939 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-16 12:11:36,942 INFO L117 LiptonReduction]: Number of co-enabled transitions 1536 [2020-10-16 12:11:37,338 WARN L193 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 12:11:37,483 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 12:11:38,799 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-16 12:11:38,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 12:11:38,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:11:38,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 12:11:38,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:11:39,712 WARN L193 SmtUtils]: Spent 825.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-16 12:11:39,946 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-10-16 12:11:41,634 WARN L193 SmtUtils]: Spent 850.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 108 [2020-10-16 12:11:41,904 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-10-16 12:11:42,264 WARN L193 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-16 12:11:42,631 WARN L193 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-16 12:11:43,352 WARN L193 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 124 [2020-10-16 12:11:43,671 WARN L193 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-16 12:11:44,692 WARN L193 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 128 [2020-10-16 12:11:45,013 WARN L193 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-16 12:11:45,271 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-16 12:11:45,382 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-16 12:11:45,389 INFO L132 LiptonReduction]: Checked pairs total: 4144 [2020-10-16 12:11:45,389 INFO L134 LiptonReduction]: Total number of compositions: 79 [2020-10-16 12:11:45,396 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2020-10-16 12:11:45,469 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 650 states. [2020-10-16 12:11:45,472 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states. [2020-10-16 12:11:45,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-16 12:11:45,481 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:45,483 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:45,491 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:45,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:45,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1019465781, now seen corresponding path program 1 times [2020-10-16 12:11:45,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:45,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077341496] [2020-10-16 12:11:45,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:45,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:45,762 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077341496] [2020-10-16 12:11:45,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:45,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:11:45,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143773009] [2020-10-16 12:11:45,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:11:45,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:45,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:11:45,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:45,789 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 3 states. [2020-10-16 12:11:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:45,889 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-10-16 12:11:45,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:11:45,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-16 12:11:45,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:45,915 INFO L225 Difference]: With dead ends: 550 [2020-10-16 12:11:45,915 INFO L226 Difference]: Without dead ends: 450 [2020-10-16 12:11:45,917 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:45,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-10-16 12:11:45,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-10-16 12:11:46,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-16 12:11:46,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-10-16 12:11:46,010 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 7 [2020-10-16 12:11:46,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:46,013 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-10-16 12:11:46,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:11:46,013 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-10-16 12:11:46,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 12:11:46,015 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:46,015 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:46,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:11:46,015 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:46,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:46,018 INFO L82 PathProgramCache]: Analyzing trace with hash 454120523, now seen corresponding path program 1 times [2020-10-16 12:11:46,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:46,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523880048] [2020-10-16 12:11:46,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:46,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:46,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523880048] [2020-10-16 12:11:46,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:46,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:11:46,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327171885] [2020-10-16 12:11:46,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:11:46,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:46,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:11:46,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:46,194 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-10-16 12:11:46,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:46,232 INFO L93 Difference]: Finished difference Result 445 states and 1339 transitions. [2020-10-16 12:11:46,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:11:46,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 12:11:46,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:46,237 INFO L225 Difference]: With dead ends: 445 [2020-10-16 12:11:46,238 INFO L226 Difference]: Without dead ends: 445 [2020-10-16 12:11:46,239 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:46,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2020-10-16 12:11:46,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2020-10-16 12:11:46,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2020-10-16 12:11:46,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1339 transitions. [2020-10-16 12:11:46,262 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1339 transitions. Word has length 9 [2020-10-16 12:11:46,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:46,262 INFO L481 AbstractCegarLoop]: Abstraction has 445 states and 1339 transitions. [2020-10-16 12:11:46,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:11:46,263 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1339 transitions. [2020-10-16 12:11:46,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 12:11:46,264 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:46,264 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:46,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:11:46,265 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:46,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:46,265 INFO L82 PathProgramCache]: Analyzing trace with hash 660752975, now seen corresponding path program 1 times [2020-10-16 12:11:46,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:46,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890653595] [2020-10-16 12:11:46,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:46,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:46,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890653595] [2020-10-16 12:11:46,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:46,404 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:11:46,404 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481938033] [2020-10-16 12:11:46,404 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:11:46,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:46,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:11:46,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:11:46,405 INFO L87 Difference]: Start difference. First operand 445 states and 1339 transitions. Second operand 4 states. [2020-10-16 12:11:46,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:46,452 INFO L93 Difference]: Finished difference Result 439 states and 1317 transitions. [2020-10-16 12:11:46,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:11:46,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-16 12:11:46,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:46,457 INFO L225 Difference]: With dead ends: 439 [2020-10-16 12:11:46,457 INFO L226 Difference]: Without dead ends: 439 [2020-10-16 12:11:46,458 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:11:46,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-10-16 12:11:46,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2020-10-16 12:11:46,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2020-10-16 12:11:46,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 1317 transitions. [2020-10-16 12:11:46,475 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 1317 transitions. Word has length 10 [2020-10-16 12:11:46,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:46,475 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 1317 transitions. [2020-10-16 12:11:46,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:11:46,475 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 1317 transitions. [2020-10-16 12:11:46,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 12:11:46,483 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:46,483 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:46,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:11:46,485 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:46,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:46,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1192834032, now seen corresponding path program 1 times [2020-10-16 12:11:46,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:46,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361537419] [2020-10-16 12:11:46,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:46,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361537419] [2020-10-16 12:11:46,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:46,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:11:46,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287044183] [2020-10-16 12:11:46,540 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:11:46,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:46,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:11:46,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:46,541 INFO L87 Difference]: Start difference. First operand 439 states and 1317 transitions. Second operand 3 states. [2020-10-16 12:11:46,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:46,553 INFO L93 Difference]: Finished difference Result 434 states and 1298 transitions. [2020-10-16 12:11:46,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:11:46,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-16 12:11:46,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:46,558 INFO L225 Difference]: With dead ends: 434 [2020-10-16 12:11:46,558 INFO L226 Difference]: Without dead ends: 434 [2020-10-16 12:11:46,559 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:46,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-10-16 12:11:46,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-10-16 12:11:46,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-10-16 12:11:46,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1298 transitions. [2020-10-16 12:11:46,602 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1298 transitions. Word has length 10 [2020-10-16 12:11:46,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:46,603 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1298 transitions. [2020-10-16 12:11:46,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:11:46,603 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1298 transitions. [2020-10-16 12:11:46,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:11:46,604 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:46,604 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:46,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:11:46,605 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:46,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:46,606 INFO L82 PathProgramCache]: Analyzing trace with hash -991494548, now seen corresponding path program 1 times [2020-10-16 12:11:46,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:46,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690670188] [2020-10-16 12:11:46,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:46,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:46,766 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690670188] [2020-10-16 12:11:46,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:46,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:11:46,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108263928] [2020-10-16 12:11:46,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:11:46,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:46,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:11:46,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:11:46,768 INFO L87 Difference]: Start difference. First operand 434 states and 1298 transitions. Second operand 5 states. [2020-10-16 12:11:46,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:46,831 INFO L93 Difference]: Finished difference Result 420 states and 1246 transitions. [2020-10-16 12:11:46,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:11:46,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-16 12:11:46,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:46,836 INFO L225 Difference]: With dead ends: 420 [2020-10-16 12:11:46,836 INFO L226 Difference]: Without dead ends: 420 [2020-10-16 12:11:46,837 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:11:46,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2020-10-16 12:11:46,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2020-10-16 12:11:46,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2020-10-16 12:11:46,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1246 transitions. [2020-10-16 12:11:46,851 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 1246 transitions. Word has length 11 [2020-10-16 12:11:46,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:46,851 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 1246 transitions. [2020-10-16 12:11:46,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:11:46,852 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 1246 transitions. [2020-10-16 12:11:46,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:11:46,853 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:46,853 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:46,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:11:46,853 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:46,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:46,854 INFO L82 PathProgramCache]: Analyzing trace with hash 350943551, now seen corresponding path program 1 times [2020-10-16 12:11:46,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:46,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595217262] [2020-10-16 12:11:46,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:46,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:46,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595217262] [2020-10-16 12:11:46,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:46,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:11:46,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876668145] [2020-10-16 12:11:46,939 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:11:46,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:46,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:11:46,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:11:46,940 INFO L87 Difference]: Start difference. First operand 420 states and 1246 transitions. Second operand 5 states. [2020-10-16 12:11:46,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:46,992 INFO L93 Difference]: Finished difference Result 415 states and 1227 transitions. [2020-10-16 12:11:46,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:11:46,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-16 12:11:46,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:46,997 INFO L225 Difference]: With dead ends: 415 [2020-10-16 12:11:46,997 INFO L226 Difference]: Without dead ends: 415 [2020-10-16 12:11:46,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:11:47,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2020-10-16 12:11:47,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 411. [2020-10-16 12:11:47,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2020-10-16 12:11:47,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1216 transitions. [2020-10-16 12:11:47,011 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1216 transitions. Word has length 12 [2020-10-16 12:11:47,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:47,012 INFO L481 AbstractCegarLoop]: Abstraction has 411 states and 1216 transitions. [2020-10-16 12:11:47,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:11:47,012 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1216 transitions. [2020-10-16 12:11:47,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:11:47,013 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:47,013 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:47,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:11:47,014 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:47,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:47,014 INFO L82 PathProgramCache]: Analyzing trace with hash -442809329, now seen corresponding path program 1 times [2020-10-16 12:11:47,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:47,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156081961] [2020-10-16 12:11:47,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:47,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:47,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156081961] [2020-10-16 12:11:47,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:47,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:11:47,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287624900] [2020-10-16 12:11:47,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:11:47,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:47,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:11:47,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:47,059 INFO L87 Difference]: Start difference. First operand 411 states and 1216 transitions. Second operand 3 states. [2020-10-16 12:11:47,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:47,079 INFO L93 Difference]: Finished difference Result 560 states and 1604 transitions. [2020-10-16 12:11:47,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:11:47,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-16 12:11:47,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:47,084 INFO L225 Difference]: With dead ends: 560 [2020-10-16 12:11:47,084 INFO L226 Difference]: Without dead ends: 425 [2020-10-16 12:11:47,084 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:11:47,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2020-10-16 12:11:47,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 398. [2020-10-16 12:11:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-10-16 12:11:47,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1127 transitions. [2020-10-16 12:11:47,098 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1127 transitions. Word has length 12 [2020-10-16 12:11:47,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:47,099 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 1127 transitions. [2020-10-16 12:11:47,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:11:47,099 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1127 transitions. [2020-10-16 12:11:47,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:11:47,100 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:47,100 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:47,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:11:47,101 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:47,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:47,101 INFO L82 PathProgramCache]: Analyzing trace with hash -2005652100, now seen corresponding path program 1 times [2020-10-16 12:11:47,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:47,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372326548] [2020-10-16 12:11:47,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:47,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:47,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372326548] [2020-10-16 12:11:47,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:47,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:11:47,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573316403] [2020-10-16 12:11:47,265 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:11:47,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:47,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:11:47,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:11:47,266 INFO L87 Difference]: Start difference. First operand 398 states and 1127 transitions. Second operand 6 states. [2020-10-16 12:11:47,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:47,358 INFO L93 Difference]: Finished difference Result 422 states and 1200 transitions. [2020-10-16 12:11:47,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:11:47,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-16 12:11:47,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:47,366 INFO L225 Difference]: With dead ends: 422 [2020-10-16 12:11:47,367 INFO L226 Difference]: Without dead ends: 422 [2020-10-16 12:11:47,368 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:11:47,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2020-10-16 12:11:47,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2020-10-16 12:11:47,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2020-10-16 12:11:47,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1200 transitions. [2020-10-16 12:11:47,388 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1200 transitions. Word has length 13 [2020-10-16 12:11:47,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:47,388 INFO L481 AbstractCegarLoop]: Abstraction has 422 states and 1200 transitions. [2020-10-16 12:11:47,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:11:47,389 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1200 transitions. [2020-10-16 12:11:47,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:11:47,390 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:47,390 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:47,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:11:47,390 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:47,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:47,391 INFO L82 PathProgramCache]: Analyzing trace with hash -650423966, now seen corresponding path program 2 times [2020-10-16 12:11:47,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:47,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593179421] [2020-10-16 12:11:47,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:47,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593179421] [2020-10-16 12:11:47,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:47,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:11:47,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693084304] [2020-10-16 12:11:47,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:11:47,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:47,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:11:47,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:11:47,588 INFO L87 Difference]: Start difference. First operand 422 states and 1200 transitions. Second operand 6 states. [2020-10-16 12:11:47,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:47,725 INFO L93 Difference]: Finished difference Result 446 states and 1261 transitions. [2020-10-16 12:11:47,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:11:47,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-16 12:11:47,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:47,731 INFO L225 Difference]: With dead ends: 446 [2020-10-16 12:11:47,731 INFO L226 Difference]: Without dead ends: 446 [2020-10-16 12:11:47,732 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:11:47,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2020-10-16 12:11:47,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 416. [2020-10-16 12:11:47,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2020-10-16 12:11:47,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1175 transitions. [2020-10-16 12:11:47,748 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1175 transitions. Word has length 13 [2020-10-16 12:11:47,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:47,748 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 1175 transitions. [2020-10-16 12:11:47,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:11:47,748 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1175 transitions. [2020-10-16 12:11:47,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:11:47,749 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:47,750 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:47,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:11:47,750 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:47,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:47,750 INFO L82 PathProgramCache]: Analyzing trace with hash -842166617, now seen corresponding path program 1 times [2020-10-16 12:11:47,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:47,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179128274] [2020-10-16 12:11:47,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:47,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179128274] [2020-10-16 12:11:47,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:47,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:11:47,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000796483] [2020-10-16 12:11:47,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:11:47,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:47,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:11:47,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:11:47,836 INFO L87 Difference]: Start difference. First operand 416 states and 1175 transitions. Second operand 4 states. [2020-10-16 12:11:47,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:47,872 INFO L93 Difference]: Finished difference Result 410 states and 1024 transitions. [2020-10-16 12:11:47,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:11:47,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-16 12:11:47,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:47,875 INFO L225 Difference]: With dead ends: 410 [2020-10-16 12:11:47,876 INFO L226 Difference]: Without dead ends: 302 [2020-10-16 12:11:47,876 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:11:47,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2020-10-16 12:11:47,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2020-10-16 12:11:47,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2020-10-16 12:11:47,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 735 transitions. [2020-10-16 12:11:47,885 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 735 transitions. Word has length 13 [2020-10-16 12:11:47,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:47,885 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 735 transitions. [2020-10-16 12:11:47,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:11:47,886 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 735 transitions. [2020-10-16 12:11:47,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:11:47,887 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:47,887 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:47,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:11:47,887 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:47,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:47,888 INFO L82 PathProgramCache]: Analyzing trace with hash -711911559, now seen corresponding path program 1 times [2020-10-16 12:11:47,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:47,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008173237] [2020-10-16 12:11:47,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:47,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:47,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008173237] [2020-10-16 12:11:47,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:47,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:11:47,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745681324] [2020-10-16 12:11:47,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:11:47,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:47,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:11:47,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:11:47,975 INFO L87 Difference]: Start difference. First operand 302 states and 735 transitions. Second operand 5 states. [2020-10-16 12:11:48,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:48,022 INFO L93 Difference]: Finished difference Result 251 states and 560 transitions. [2020-10-16 12:11:48,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:11:48,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-16 12:11:48,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:48,025 INFO L225 Difference]: With dead ends: 251 [2020-10-16 12:11:48,025 INFO L226 Difference]: Without dead ends: 194 [2020-10-16 12:11:48,025 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:11:48,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-10-16 12:11:48,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2020-10-16 12:11:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-10-16 12:11:48,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 423 transitions. [2020-10-16 12:11:48,031 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 423 transitions. Word has length 14 [2020-10-16 12:11:48,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:48,032 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 423 transitions. [2020-10-16 12:11:48,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:11:48,032 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 423 transitions. [2020-10-16 12:11:48,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:11:48,033 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:48,033 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:48,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:11:48,033 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:48,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:48,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1312231858, now seen corresponding path program 1 times [2020-10-16 12:11:48,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:48,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127539557] [2020-10-16 12:11:48,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:48,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:48,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127539557] [2020-10-16 12:11:48,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:48,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:11:48,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038104044] [2020-10-16 12:11:48,125 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:11:48,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:48,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:11:48,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:11:48,126 INFO L87 Difference]: Start difference. First operand 194 states and 423 transitions. Second operand 6 states. [2020-10-16 12:11:48,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:48,181 INFO L93 Difference]: Finished difference Result 174 states and 382 transitions. [2020-10-16 12:11:48,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:11:48,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-16 12:11:48,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:48,183 INFO L225 Difference]: With dead ends: 174 [2020-10-16 12:11:48,183 INFO L226 Difference]: Without dead ends: 95 [2020-10-16 12:11:48,184 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:11:48,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-10-16 12:11:48,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2020-10-16 12:11:48,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-16 12:11:48,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 176 transitions. [2020-10-16 12:11:48,187 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 176 transitions. Word has length 16 [2020-10-16 12:11:48,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:48,188 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 176 transitions. [2020-10-16 12:11:48,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:11:48,188 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 176 transitions. [2020-10-16 12:11:48,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 12:11:48,189 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:48,189 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:48,189 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:11:48,190 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:48,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:48,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1503762436, now seen corresponding path program 1 times [2020-10-16 12:11:48,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:48,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406625274] [2020-10-16 12:11:48,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:48,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:48,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406625274] [2020-10-16 12:11:48,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:48,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:11:48,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504600289] [2020-10-16 12:11:48,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:11:48,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:48,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:11:48,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:11:48,300 INFO L87 Difference]: Start difference. First operand 87 states and 176 transitions. Second operand 8 states. [2020-10-16 12:11:48,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:48,439 INFO L93 Difference]: Finished difference Result 141 states and 289 transitions. [2020-10-16 12:11:48,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:11:48,440 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-10-16 12:11:48,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:48,441 INFO L225 Difference]: With dead ends: 141 [2020-10-16 12:11:48,442 INFO L226 Difference]: Without dead ends: 75 [2020-10-16 12:11:48,442 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:11:48,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-10-16 12:11:48,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-10-16 12:11:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-16 12:11:48,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 152 transitions. [2020-10-16 12:11:48,445 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 152 transitions. Word has length 20 [2020-10-16 12:11:48,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:48,445 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 152 transitions. [2020-10-16 12:11:48,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:11:48,446 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 152 transitions. [2020-10-16 12:11:48,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 12:11:48,446 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:48,446 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:48,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:11:48,447 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:48,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:48,447 INFO L82 PathProgramCache]: Analyzing trace with hash -814541864, now seen corresponding path program 2 times [2020-10-16 12:11:48,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:48,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590806350] [2020-10-16 12:11:48,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:48,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:48,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590806350] [2020-10-16 12:11:48,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:48,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:11:48,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748426456] [2020-10-16 12:11:48,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:11:48,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:48,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:11:48,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:11:48,529 INFO L87 Difference]: Start difference. First operand 75 states and 152 transitions. Second operand 6 states. [2020-10-16 12:11:48,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:48,605 INFO L93 Difference]: Finished difference Result 101 states and 200 transitions. [2020-10-16 12:11:48,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:11:48,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-16 12:11:48,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:48,608 INFO L225 Difference]: With dead ends: 101 [2020-10-16 12:11:48,608 INFO L226 Difference]: Without dead ends: 47 [2020-10-16 12:11:48,609 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:11:48,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-16 12:11:48,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-16 12:11:48,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-16 12:11:48,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 80 transitions. [2020-10-16 12:11:48,612 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 80 transitions. Word has length 20 [2020-10-16 12:11:48,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:48,612 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 80 transitions. [2020-10-16 12:11:48,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:11:48,612 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2020-10-16 12:11:48,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 12:11:48,613 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:48,613 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:48,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 12:11:48,614 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:48,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:48,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1669447360, now seen corresponding path program 3 times [2020-10-16 12:11:48,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:48,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981384539] [2020-10-16 12:11:48,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:11:49,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:11:49,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981384539] [2020-10-16 12:11:49,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:11:49,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 12:11:49,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998157144] [2020-10-16 12:11:49,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 12:11:49,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:11:49,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 12:11:49,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:11:49,007 INFO L87 Difference]: Start difference. First operand 47 states and 80 transitions. Second operand 8 states. [2020-10-16 12:11:49,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:11:49,189 INFO L93 Difference]: Finished difference Result 61 states and 102 transitions. [2020-10-16 12:11:49,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:11:49,189 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-10-16 12:11:49,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:11:49,190 INFO L225 Difference]: With dead ends: 61 [2020-10-16 12:11:49,190 INFO L226 Difference]: Without dead ends: 35 [2020-10-16 12:11:49,191 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-16 12:11:49,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-10-16 12:11:49,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-10-16 12:11:49,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-16 12:11:49,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2020-10-16 12:11:49,194 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 20 [2020-10-16 12:11:49,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:11:49,194 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2020-10-16 12:11:49,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 12:11:49,194 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2020-10-16 12:11:49,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 12:11:49,195 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:11:49,195 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:11:49,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 12:11:49,195 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:11:49,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:11:49,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1311498048, now seen corresponding path program 4 times [2020-10-16 12:11:49,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:11:49,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84803892] [2020-10-16 12:11:49,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:11:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:11:49,230 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:11:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:11:49,263 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:11:49,298 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:11:49,298 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:11:49,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 12:11:49,299 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:11:49,311 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L813-->L820: Formula: (let ((.cse9 (= (mod ~y$w_buff1_used~0_In148580819 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In148580819 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd0~0_In148580819 256) 0)) (.cse7 (= (mod ~y$w_buff0_used~0_In148580819 256) 0))) (let ((.cse1 (not .cse7)) (.cse2 (not .cse6)) (.cse3 (not .cse8)) (.cse4 (not .cse9)) (.cse5 (or .cse8 .cse9)) (.cse0 (or .cse6 .cse7))) (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In148580819| ULTIMATE.start_assume_abort_if_not_~cond_Out148580819) (or (and (= ~y$w_buff0_used~0_In148580819 ~y$w_buff0_used~0_Out148580819) .cse0) (and .cse1 (= ~y$w_buff0_used~0_Out148580819 0) .cse2)) (= ~y$r_buff1_thd0~0_Out148580819 ~y$r_buff1_thd0~0_In148580819) (= ~y$r_buff0_thd0~0_Out148580819 ~y$r_buff0_thd0~0_In148580819) (or (and (= ~y$w_buff1_used~0_Out148580819 0) .cse3 .cse4) (and .cse5 (= ~y$w_buff1_used~0_In148580819 ~y$w_buff1_used~0_Out148580819))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out148580819 0)) (or (and .cse1 .cse2 (= ~y$w_buff0~0_In148580819 ~y~0_Out148580819)) (and (or (and (= ~y~0_Out148580819 ~y$w_buff1~0_In148580819) .cse3 .cse4) (and (= ~y~0_Out148580819 ~y~0_In148580819) .cse5)) .cse0))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In148580819|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In148580819, ~y$w_buff1~0=~y$w_buff1~0_In148580819, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In148580819, ~y$w_buff0~0=~y$w_buff0~0_In148580819, ~y~0=~y~0_In148580819, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In148580819, ~y$w_buff1_used~0=~y$w_buff1_used~0_In148580819} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out148580819, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out148580819|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out148580819|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out148580819|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out148580819|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out148580819|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out148580819|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In148580819|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out148580819, ~y$w_buff1~0=~y$w_buff1~0_In148580819, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out148580819, ~y$w_buff0~0=~y$w_buff0~0_In148580819, ~y~0=~y~0_Out148580819, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out148580819, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out148580819} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 12:11:49,316 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:11:49,317 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:49,318 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:11:49,318 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:49,319 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:11:49,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:49,319 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:11:49,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:49,319 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:11:49,319 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:49,320 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:11:49,320 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:49,321 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:11:49,321 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:49,321 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:11:49,321 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:49,321 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:11:49,322 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:49,322 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:11:49,322 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:49,322 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:11:49,322 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:49,323 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:11:49,323 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:49,323 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:11:49,324 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:49,324 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:11:49,324 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:49,324 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:11:49,324 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:49,324 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:11:49,325 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:49,325 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:11:49,325 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:49,325 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:11:49,325 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:49,326 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:11:49,326 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:49,326 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:11:49,326 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:49,326 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:11:49,326 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:49,327 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:11:49,327 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:49,327 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:11:49,327 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:11:49,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:11:49 BasicIcfg [2020-10-16 12:11:49,380 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:11:49,384 INFO L168 Benchmark]: Toolchain (without parser) took 15670.03 ms. Allocated memory was 144.7 MB in the beginning and 368.6 MB in the end (delta: 223.9 MB). Free memory was 99.3 MB in the beginning and 191.8 MB in the end (delta: -92.5 MB). Peak memory consumption was 131.4 MB. Max. memory is 7.1 GB. [2020-10-16 12:11:49,385 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 144.7 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-16 12:11:49,386 INFO L168 Benchmark]: CACSL2BoogieTranslator took 720.70 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 99.1 MB in the beginning and 154.9 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2020-10-16 12:11:49,389 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.70 ms. Allocated memory is still 201.3 MB. Free memory was 154.9 MB in the beginning and 152.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-16 12:11:49,389 INFO L168 Benchmark]: Boogie Preprocessor took 83.52 ms. Allocated memory is still 201.3 MB. Free memory was 152.2 MB in the beginning and 149.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-16 12:11:49,390 INFO L168 Benchmark]: RCFGBuilder took 2134.38 ms. Allocated memory was 201.3 MB in the beginning and 252.7 MB in the end (delta: 51.4 MB). Free memory was 149.4 MB in the beginning and 198.1 MB in the end (delta: -48.7 MB). Peak memory consumption was 104.6 MB. Max. memory is 7.1 GB. [2020-10-16 12:11:49,390 INFO L168 Benchmark]: TraceAbstraction took 12642.56 ms. Allocated memory was 252.7 MB in the beginning and 368.6 MB in the end (delta: 115.9 MB). Free memory was 198.1 MB in the beginning and 191.8 MB in the end (delta: 6.2 MB). Peak memory consumption was 122.1 MB. Max. memory is 7.1 GB. [2020-10-16 12:11:49,399 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 144.7 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 720.70 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 99.1 MB in the beginning and 154.9 MB in the end (delta: -55.8 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 81.70 ms. Allocated memory is still 201.3 MB. Free memory was 154.9 MB in the beginning and 152.2 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 83.52 ms. Allocated memory is still 201.3 MB. Free memory was 152.2 MB in the beginning and 149.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2134.38 ms. Allocated memory was 201.3 MB in the beginning and 252.7 MB in the end (delta: 51.4 MB). Free memory was 149.4 MB in the beginning and 198.1 MB in the end (delta: -48.7 MB). Peak memory consumption was 104.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12642.56 ms. Allocated memory was 252.7 MB in the beginning and 368.6 MB in the end (delta: 115.9 MB). Free memory was 198.1 MB in the beginning and 191.8 MB in the end (delta: 6.2 MB). Peak memory consumption was 122.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 798 VarBasedMoverChecksPositive, 32 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 70 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.5s, 99 PlacesBefore, 35 PlacesAfterwards, 91 TransitionsBefore, 25 TransitionsAfterwards, 1536 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 79 TotalNumberOfCompositions, 4144 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p0_EAX = 0; [L701] 0 _Bool main$tmp_guard0; [L702] 0 _Bool main$tmp_guard1; [L704] 0 int x = 0; [L706] 0 int y = 0; [L707] 0 _Bool y$flush_delayed; [L708] 0 int y$mem_tmp; [L709] 0 _Bool y$r_buff0_thd0; [L710] 0 _Bool y$r_buff0_thd1; [L711] 0 _Bool y$r_buff0_thd2; [L712] 0 _Bool y$r_buff0_thd3; [L713] 0 _Bool y$r_buff1_thd0; [L714] 0 _Bool y$r_buff1_thd1; [L715] 0 _Bool y$r_buff1_thd2; [L716] 0 _Bool y$r_buff1_thd3; [L717] 0 _Bool y$read_delayed; [L718] 0 int *y$read_delayed_var; [L719] 0 int y$w_buff0; [L720] 0 _Bool y$w_buff0_used; [L721] 0 int y$w_buff1; [L722] 0 _Bool y$w_buff1_used; [L724] 0 int z = 0; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L804] 0 pthread_t t2516; [L805] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 0 pthread_t t2517; [L807] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L808] 0 pthread_t t2518; [L809] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 3 y$w_buff1 = y$w_buff0 [L768] 3 y$w_buff0 = 2 [L769] 3 y$w_buff1_used = y$w_buff0_used [L770] 3 y$w_buff0_used = (_Bool)1 [L7] COND FALSE 3 !(!expression) [L772] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L773] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L774] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L775] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L776] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L730] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L735] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L747] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L750] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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] [L753] 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) [L753] 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) [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L754] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L755] 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 [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L756] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L757] 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 [L740] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L742] 1 return 0; [L760] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 2 return 0; [L782] 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) [L782] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L782] 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) [L782] 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) [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L783] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L784] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L784] 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 [L785] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L786] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L786] 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 [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L811] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 y$flush_delayed = weak$$choice2 [L825] 0 y$mem_tmp = y [L826] 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) [L826] 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) [L827] 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)) [L827] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L827] 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)) [L827] 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)) [L828] 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)) [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L828] 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)) [L828] 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)) [L829] 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)) [L829] 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)) [L830] 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)) [L830] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L830] 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)) [L830] 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)) [L831] 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)) [L831] 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)) [L832] 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)) [L832] 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)) [L833] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L834] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L834] 0 y = y$flush_delayed ? y$mem_tmp : y [L835] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, 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, 90 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.4s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.6s, HoareTripleCheckerStatistics: 333 SDtfs, 347 SDslu, 526 SDs, 0 SdLazy, 321 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 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, 15 MinimizatonAttempts, 69 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 185 ConstructedInterpolants, 0 QuantifiedInterpolants, 22326 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...