/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 22:53:54,814 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 22:53:54,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 22:53:54,855 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 22:53:54,856 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 22:53:54,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 22:53:54,867 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 22:53:54,871 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 22:53:54,873 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 22:53:54,876 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 22:53:54,877 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 22:53:54,878 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 22:53:54,878 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 22:53:54,881 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 22:53:54,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 22:53:54,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 22:53:54,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 22:53:54,887 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 22:53:54,889 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 22:53:54,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 22:53:54,899 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 22:53:54,900 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 22:53:54,901 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 22:53:54,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 22:53:54,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 22:53:54,919 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 22:53:54,919 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 22:53:54,920 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 22:53:54,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 22:53:54,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 22:53:54,922 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 22:53:54,926 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 22:53:54,927 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 22:53:54,927 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 22:53:54,931 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 22:53:54,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 22:53:54,932 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 22:53:54,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 22:53:54,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 22:53:54,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 22:53:54,934 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 22:53:54,935 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-05 22:53:54,956 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 22:53:54,956 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 22:53:54,957 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 22:53:54,957 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 22:53:54,958 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 22:53:54,958 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 22:53:54,958 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 22:53:54,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 22:53:54,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 22:53:54,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 22:53:54,959 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 22:53:54,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 22:53:54,959 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 22:53:54,959 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 22:53:54,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 22:53:54,960 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 22:53:54,960 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 22:53:54,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 22:53:54,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 22:53:54,960 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 22:53:54,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 22:53:54,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 22:53:54,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 22:53:54,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-05 22:53:54,961 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 22:53:54,961 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 22:53:54,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 22:53:54,962 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 22:53:54,962 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-05 22:53:54,962 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-05 22:53:55,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 22:53:55,254 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 22:53:55,258 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 22:53:55,259 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 22:53:55,259 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 22:53:55,260 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2020-10-05 22:53:55,329 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed48adbbc/c7268e0bca9e4a1ea9240bc76454ccc5/FLAG2acf93b1b [2020-10-05 22:53:55,974 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 22:53:55,975 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2020-10-05 22:53:56,007 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed48adbbc/c7268e0bca9e4a1ea9240bc76454ccc5/FLAG2acf93b1b [2020-10-05 22:53:56,117 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed48adbbc/c7268e0bca9e4a1ea9240bc76454ccc5 [2020-10-05 22:53:56,127 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 22:53:56,129 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 22:53:56,130 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 22:53:56,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 22:53:56,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 22:53:56,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:53:56" (1/1) ... [2020-10-05 22:53:56,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7806e64a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:53:56, skipping insertion in model container [2020-10-05 22:53:56,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:53:56" (1/1) ... [2020-10-05 22:53:56,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 22:53:56,237 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 22:53:57,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 22:53:57,191 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 22:53:57,294 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 22:53:57,692 INFO L208 MainTranslator]: Completed translation [2020-10-05 22:53:57,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:53:57 WrapperNode [2020-10-05 22:53:57,694 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 22:53:57,695 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 22:53:57,696 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 22:53:57,696 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 22:53:57,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:53:57" (1/1) ... [2020-10-05 22:53:57,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:53:57" (1/1) ... [2020-10-05 22:53:57,826 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 22:53:57,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 22:53:57,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 22:53:57,827 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 22:53:57,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:53:57" (1/1) ... [2020-10-05 22:53:57,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:53:57" (1/1) ... [2020-10-05 22:53:57,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:53:57" (1/1) ... [2020-10-05 22:53:57,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:53:57" (1/1) ... [2020-10-05 22:53:57,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:53:57" (1/1) ... [2020-10-05 22:53:57,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:53:57" (1/1) ... [2020-10-05 22:53:57,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:53:57" (1/1) ... [2020-10-05 22:53:57,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 22:53:57,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 22:53:57,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 22:53:57,875 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 22:53:57,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:53:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 22:53:57,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 22:53:57,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-05 22:53:57,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-05 22:53:57,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 22:53:57,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 22:53:57,947 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2020-10-05 22:53:57,947 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2020-10-05 22:53:57,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 22:53:57,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 22:53:57,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-05 22:53:57,951 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 22:53:58,553 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 22:53:58,553 INFO L298 CfgBuilder]: Removed 20 assume(true) statements. [2020-10-05 22:53:58,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:53:58 BoogieIcfgContainer [2020-10-05 22:53:58,556 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 22:53:58,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 22:53:58,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 22:53:58,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 22:53:58,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 10:53:56" (1/3) ... [2020-10-05 22:53:58,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a45c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:53:58, skipping insertion in model container [2020-10-05 22:53:58,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:53:57" (2/3) ... [2020-10-05 22:53:58,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a45c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:53:58, skipping insertion in model container [2020-10-05 22:53:58,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:53:58" (3/3) ... [2020-10-05 22:53:58,564 INFO L109 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2020-10-05 22:53:58,575 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 22:53:58,575 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-05 22:53:58,583 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-10-05 22:53:58,584 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 22:53:58,618 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,618 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,619 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,619 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,619 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,619 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,620 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,620 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,620 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,620 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,621 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,621 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,621 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,621 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,622 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,622 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,622 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,622 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,622 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,623 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,623 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,623 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,624 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,624 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,624 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,624 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,625 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,625 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,625 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,626 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,626 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,626 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,626 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,626 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,627 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,627 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,627 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,627 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,628 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,628 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,628 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,628 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,628 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,629 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,629 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,629 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,629 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,630 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,630 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,630 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,630 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,631 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,631 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,631 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,631 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,632 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,632 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,632 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,636 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,636 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,637 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,637 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,637 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,637 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,638 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,638 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,638 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,638 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,638 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,647 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,647 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,648 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,648 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,648 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,648 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,648 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,649 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,649 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,649 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,649 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~dev~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:53:58,675 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-05 22:53:58,697 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 22:53:58,697 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 22:53:58,697 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-05 22:53:58,697 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 22:53:58,697 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 22:53:58,698 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 22:53:58,698 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 22:53:58,698 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 22:53:58,717 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 131 transitions, 284 flow [2020-10-05 22:53:58,719 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 129 places, 131 transitions, 284 flow [2020-10-05 22:53:58,791 INFO L129 PetriNetUnfolder]: 9/169 cut-off events. [2020-10-05 22:53:58,791 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-05 22:53:58,797 INFO L80 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 169 events. 9/169 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 347 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 86. Up to 4 conditions per place. [2020-10-05 22:53:58,801 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 129 places, 131 transitions, 284 flow [2020-10-05 22:53:58,876 INFO L129 PetriNetUnfolder]: 9/169 cut-off events. [2020-10-05 22:53:58,877 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-10-05 22:53:58,877 INFO L80 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 169 events. 9/169 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 347 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 86. Up to 4 conditions per place. [2020-10-05 22:53:58,883 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2200 [2020-10-05 22:53:58,887 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-10-05 22:53:59,536 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:53:59,556 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:53:59,561 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:53:59,575 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:53:59,576 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-05 22:53:59,577 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:67 [2020-10-05 22:53:59,613 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:53:59,638 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:53:59,643 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:53:59,662 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:53:59,664 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-05 22:53:59,665 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-05 22:53:59,679 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:53:59,701 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:53:59,706 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:53:59,725 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:53:59,727 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-05 22:53:59,728 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-05 22:54:01,999 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:02,025 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:02,030 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:02,094 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:02,096 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:02,096 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-05 22:54:02,115 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:02,144 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:02,150 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:02,172 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:02,173 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:02,174 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-05 22:54:04,245 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:04,274 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:04,279 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:04,303 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:04,305 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:04,305 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-05 22:54:04,322 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:04,346 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:04,351 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:04,375 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:04,376 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:04,377 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:112 [2020-10-05 22:54:06,467 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:06,505 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:06,513 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:06,549 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:06,550 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:06,551 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-05 22:54:06,573 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:06,614 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:06,619 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:06,650 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:06,652 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:06,652 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-05 22:54:09,213 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:09,239 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:09,243 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:09,270 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:09,272 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:09,272 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-05 22:54:09,288 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:09,312 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:09,317 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:09,343 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:09,345 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:09,345 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:114 [2020-10-05 22:54:11,553 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:11,606 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:11,611 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:11,660 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:11,661 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:11,661 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:126, output treesize:128 [2020-10-05 22:54:11,679 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:11,723 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:11,727 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:11,766 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:11,767 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:11,767 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:128, output treesize:130 [2020-10-05 22:54:14,277 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:14,307 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:14,311 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:14,330 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:14,331 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:14,332 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2020-10-05 22:54:14,365 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:14,393 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:14,399 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:14,429 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:14,430 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:14,430 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-05 22:54:14,441 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:14,466 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:14,472 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:14,492 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:14,493 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:14,493 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:114, output treesize:116 [2020-10-05 22:54:16,515 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:16,544 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:16,547 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:16,571 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:16,572 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:16,573 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:122 [2020-10-05 22:54:16,581 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:16,613 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:16,616 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:16,639 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:16,640 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:16,641 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:118, output treesize:120 [2020-10-05 22:54:18,683 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:18,711 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:18,716 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:18,744 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:18,745 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:18,745 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:124 [2020-10-05 22:54:18,761 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:18,792 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:18,818 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:18,852 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:18,853 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:18,853 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:122, output treesize:124 [2020-10-05 22:54:21,559 WARN L193 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2020-10-05 22:54:21,580 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:21,659 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:21,667 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:21,747 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:21,748 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:21,749 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:148, output treesize:160 [2020-10-05 22:54:21,912 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:21,945 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:21,950 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:21,979 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:21,980 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:21,981 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:124, output treesize:126 [2020-10-05 22:54:22,001 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:22,036 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:22,039 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:22,072 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:22,074 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:22,074 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:124, output treesize:126 [2020-10-05 22:54:24,417 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:24,482 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:24,487 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:24,532 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:24,533 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:24,534 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:136, output treesize:138 [2020-10-05 22:54:24,552 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:24,603 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:24,608 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:24,658 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-05 22:54:24,659 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-05 22:54:24,659 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:136, output treesize:138 [2020-10-05 22:54:26,875 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2020-10-05 22:54:27,678 WARN L193 SmtUtils]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-10-05 22:54:28,021 WARN L193 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-10-05 22:54:28,253 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-10-05 22:54:28,491 WARN L193 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-10-05 22:54:28,693 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2954 [2020-10-05 22:54:28,693 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2020-10-05 22:54:28,697 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 32 transitions, 86 flow [2020-10-05 22:54:28,716 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 190 states. [2020-10-05 22:54:28,719 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states. [2020-10-05 22:54:28,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-10-05 22:54:28,725 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:54:28,726 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-10-05 22:54:28,726 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:54:28,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:54:28,732 INFO L82 PathProgramCache]: Analyzing trace with hash 14364445, now seen corresponding path program 1 times [2020-10-05 22:54:28,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:54:28,742 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685625444] [2020-10-05 22:54:28,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:54:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:54:29,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:54:29,151 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685625444] [2020-10-05 22:54:29,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:54:29,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 22:54:29,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559903731] [2020-10-05 22:54:29,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 22:54:29,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:54:29,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 22:54:29,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:54:29,176 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 3 states. [2020-10-05 22:54:29,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:54:29,309 INFO L93 Difference]: Finished difference Result 248 states and 560 transitions. [2020-10-05 22:54:29,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 22:54:29,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-10-05 22:54:29,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:54:29,327 INFO L225 Difference]: With dead ends: 248 [2020-10-05 22:54:29,327 INFO L226 Difference]: Without dead ends: 230 [2020-10-05 22:54:29,328 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:54:29,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2020-10-05 22:54:29,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 200. [2020-10-05 22:54:29,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-10-05 22:54:29,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 444 transitions. [2020-10-05 22:54:29,392 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 444 transitions. Word has length 4 [2020-10-05 22:54:29,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:54:29,393 INFO L479 AbstractCegarLoop]: Abstraction has 200 states and 444 transitions. [2020-10-05 22:54:29,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 22:54:29,393 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 444 transitions. [2020-10-05 22:54:29,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-05 22:54:29,394 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:54:29,394 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-05 22:54:29,394 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 22:54:29,394 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:54:29,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:54:29,395 INFO L82 PathProgramCache]: Analyzing trace with hash 445298819, now seen corresponding path program 1 times [2020-10-05 22:54:29,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:54:29,395 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741164846] [2020-10-05 22:54:29,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:54:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:54:29,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:54:29,478 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741164846] [2020-10-05 22:54:29,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:54:29,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 22:54:29,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394856418] [2020-10-05 22:54:29,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 22:54:29,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:54:29,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 22:54:29,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:54:29,480 INFO L87 Difference]: Start difference. First operand 200 states and 444 transitions. Second operand 3 states. [2020-10-05 22:54:29,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:54:29,574 INFO L93 Difference]: Finished difference Result 243 states and 536 transitions. [2020-10-05 22:54:29,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 22:54:29,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-05 22:54:29,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:54:29,579 INFO L225 Difference]: With dead ends: 243 [2020-10-05 22:54:29,580 INFO L226 Difference]: Without dead ends: 236 [2020-10-05 22:54:29,581 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:54:29,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-10-05 22:54:29,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 221. [2020-10-05 22:54:29,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-10-05 22:54:29,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 505 transitions. [2020-10-05 22:54:29,609 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 505 transitions. Word has length 5 [2020-10-05 22:54:29,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:54:29,610 INFO L479 AbstractCegarLoop]: Abstraction has 221 states and 505 transitions. [2020-10-05 22:54:29,610 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 22:54:29,610 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 505 transitions. [2020-10-05 22:54:29,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 22:54:29,611 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:54:29,612 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:54:29,612 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 22:54:29,612 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:54:29,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:54:29,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1770707455, now seen corresponding path program 1 times [2020-10-05 22:54:29,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:54:29,613 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881206198] [2020-10-05 22:54:29,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:54:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:54:29,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:54:29,689 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881206198] [2020-10-05 22:54:29,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:54:29,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 22:54:29,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067459144] [2020-10-05 22:54:29,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 22:54:29,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:54:29,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 22:54:29,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:54:29,690 INFO L87 Difference]: Start difference. First operand 221 states and 505 transitions. Second operand 3 states. [2020-10-05 22:54:29,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:54:29,703 INFO L93 Difference]: Finished difference Result 86 states and 167 transitions. [2020-10-05 22:54:29,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 22:54:29,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-05 22:54:29,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:54:29,705 INFO L225 Difference]: With dead ends: 86 [2020-10-05 22:54:29,706 INFO L226 Difference]: Without dead ends: 86 [2020-10-05 22:54:29,706 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:54:29,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-10-05 22:54:29,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-10-05 22:54:29,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-05 22:54:29,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 167 transitions. [2020-10-05 22:54:29,723 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 167 transitions. Word has length 9 [2020-10-05 22:54:29,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:54:29,723 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 167 transitions. [2020-10-05 22:54:29,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 22:54:29,723 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 167 transitions. [2020-10-05 22:54:29,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 22:54:29,724 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:54:29,725 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:54:29,725 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 22:54:29,727 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:54:29,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:54:29,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1268591532, now seen corresponding path program 1 times [2020-10-05 22:54:29,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:54:29,728 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271183839] [2020-10-05 22:54:29,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:54:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:54:30,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:54:30,047 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271183839] [2020-10-05 22:54:30,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:54:30,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-05 22:54:30,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138135752] [2020-10-05 22:54:30,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-05 22:54:30,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:54:30,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-05 22:54:30,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-10-05 22:54:30,049 INFO L87 Difference]: Start difference. First operand 86 states and 167 transitions. Second operand 13 states. [2020-10-05 22:54:30,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:54:30,916 INFO L93 Difference]: Finished difference Result 86 states and 166 transitions. [2020-10-05 22:54:30,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-05 22:54:30,917 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2020-10-05 22:54:30,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:54:30,917 INFO L225 Difference]: With dead ends: 86 [2020-10-05 22:54:30,917 INFO L226 Difference]: Without dead ends: 74 [2020-10-05 22:54:30,918 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=465, Unknown=0, NotChecked=0, Total=702 [2020-10-05 22:54:30,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-05 22:54:30,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-05 22:54:30,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-05 22:54:30,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 145 transitions. [2020-10-05 22:54:30,923 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 145 transitions. Word has length 18 [2020-10-05 22:54:30,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:54:30,923 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 145 transitions. [2020-10-05 22:54:30,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-05 22:54:30,924 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 145 transitions. [2020-10-05 22:54:30,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 22:54:30,925 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:54:30,925 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:54:30,925 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 22:54:30,925 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:54:30,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:54:30,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1297219722, now seen corresponding path program 1 times [2020-10-05 22:54:30,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:54:30,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515058686] [2020-10-05 22:54:30,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:54:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:54:31,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:54:31,159 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515058686] [2020-10-05 22:54:31,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:54:31,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 22:54:31,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449529486] [2020-10-05 22:54:31,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 22:54:31,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:54:31,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 22:54:31,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:54:31,161 INFO L87 Difference]: Start difference. First operand 74 states and 145 transitions. Second operand 8 states. [2020-10-05 22:54:31,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:54:31,446 INFO L93 Difference]: Finished difference Result 117 states and 209 transitions. [2020-10-05 22:54:31,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:54:31,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-10-05 22:54:31,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:54:31,448 INFO L225 Difference]: With dead ends: 117 [2020-10-05 22:54:31,448 INFO L226 Difference]: Without dead ends: 117 [2020-10-05 22:54:31,448 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-10-05 22:54:31,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-10-05 22:54:31,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 94. [2020-10-05 22:54:31,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-10-05 22:54:31,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 175 transitions. [2020-10-05 22:54:31,453 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 175 transitions. Word has length 18 [2020-10-05 22:54:31,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:54:31,455 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 175 transitions. [2020-10-05 22:54:31,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 22:54:31,455 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 175 transitions. [2020-10-05 22:54:31,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 22:54:31,457 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:54:31,457 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:54:31,457 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 22:54:31,457 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:54:31,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:54:31,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1297219740, now seen corresponding path program 1 times [2020-10-05 22:54:31,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:54:31,458 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092394754] [2020-10-05 22:54:31,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:54:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:54:32,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:54:32,032 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092394754] [2020-10-05 22:54:32,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:54:32,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-05 22:54:32,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735186735] [2020-10-05 22:54:32,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-05 22:54:32,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:54:32,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-05 22:54:32,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-10-05 22:54:32,033 INFO L87 Difference]: Start difference. First operand 94 states and 175 transitions. Second operand 14 states. [2020-10-05 22:54:32,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:54:32,969 INFO L93 Difference]: Finished difference Result 153 states and 271 transitions. [2020-10-05 22:54:32,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-05 22:54:32,970 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-05 22:54:32,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:54:32,971 INFO L225 Difference]: With dead ends: 153 [2020-10-05 22:54:32,972 INFO L226 Difference]: Without dead ends: 145 [2020-10-05 22:54:32,972 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2020-10-05 22:54:32,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-10-05 22:54:32,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 100. [2020-10-05 22:54:32,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-10-05 22:54:32,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 185 transitions. [2020-10-05 22:54:32,978 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 185 transitions. Word has length 18 [2020-10-05 22:54:32,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:54:32,978 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 185 transitions. [2020-10-05 22:54:32,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-05 22:54:32,978 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 185 transitions. [2020-10-05 22:54:32,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 22:54:32,980 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:54:32,980 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:54:32,980 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 22:54:32,980 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:54:32,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:54:32,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1046484834, now seen corresponding path program 2 times [2020-10-05 22:54:32,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:54:32,981 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279212572] [2020-10-05 22:54:32,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:54:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:54:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:54:33,565 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279212572] [2020-10-05 22:54:33,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:54:33,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-05 22:54:33,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019276254] [2020-10-05 22:54:33,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-05 22:54:33,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:54:33,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-05 22:54:33,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-05 22:54:33,569 INFO L87 Difference]: Start difference. First operand 100 states and 185 transitions. Second operand 14 states. [2020-10-05 22:54:34,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:54:34,654 INFO L93 Difference]: Finished difference Result 155 states and 274 transitions. [2020-10-05 22:54:34,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-05 22:54:34,655 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-05 22:54:34,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:54:34,657 INFO L225 Difference]: With dead ends: 155 [2020-10-05 22:54:34,657 INFO L226 Difference]: Without dead ends: 143 [2020-10-05 22:54:34,658 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2020-10-05 22:54:34,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-10-05 22:54:34,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 98. [2020-10-05 22:54:34,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-10-05 22:54:34,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 181 transitions. [2020-10-05 22:54:34,663 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 181 transitions. Word has length 18 [2020-10-05 22:54:34,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:54:34,663 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 181 transitions. [2020-10-05 22:54:34,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-05 22:54:34,663 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 181 transitions. [2020-10-05 22:54:34,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 22:54:34,664 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:54:34,665 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:54:34,665 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 22:54:34,665 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:54:34,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:54:34,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1347055900, now seen corresponding path program 3 times [2020-10-05 22:54:34,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:54:34,666 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934893162] [2020-10-05 22:54:34,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:54:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:54:35,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:54:35,195 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934893162] [2020-10-05 22:54:35,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:54:35,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-05 22:54:35,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881954857] [2020-10-05 22:54:35,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-05 22:54:35,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:54:35,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-05 22:54:35,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-05 22:54:35,197 INFO L87 Difference]: Start difference. First operand 98 states and 181 transitions. Second operand 14 states. [2020-10-05 22:54:36,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:54:36,150 INFO L93 Difference]: Finished difference Result 139 states and 253 transitions. [2020-10-05 22:54:36,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 22:54:36,152 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-05 22:54:36,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:54:36,154 INFO L225 Difference]: With dead ends: 139 [2020-10-05 22:54:36,154 INFO L226 Difference]: Without dead ends: 123 [2020-10-05 22:54:36,155 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2020-10-05 22:54:36,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-10-05 22:54:36,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 96. [2020-10-05 22:54:36,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-10-05 22:54:36,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 177 transitions. [2020-10-05 22:54:36,159 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 177 transitions. Word has length 18 [2020-10-05 22:54:36,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:54:36,159 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 177 transitions. [2020-10-05 22:54:36,160 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-05 22:54:36,160 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 177 transitions. [2020-10-05 22:54:36,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 22:54:36,160 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:54:36,161 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:54:36,161 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 22:54:36,161 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:54:36,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:54:36,161 INFO L82 PathProgramCache]: Analyzing trace with hash 646402192, now seen corresponding path program 2 times [2020-10-05 22:54:36,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:54:36,162 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232857468] [2020-10-05 22:54:36,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:54:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:54:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:54:36,323 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232857468] [2020-10-05 22:54:36,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:54:36,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 22:54:36,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472130772] [2020-10-05 22:54:36,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 22:54:36,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:54:36,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 22:54:36,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:54:36,325 INFO L87 Difference]: Start difference. First operand 96 states and 177 transitions. Second operand 8 states. [2020-10-05 22:54:36,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:54:36,681 INFO L93 Difference]: Finished difference Result 119 states and 212 transitions. [2020-10-05 22:54:36,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 22:54:36,681 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-10-05 22:54:36,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:54:36,683 INFO L225 Difference]: With dead ends: 119 [2020-10-05 22:54:36,683 INFO L226 Difference]: Without dead ends: 119 [2020-10-05 22:54:36,684 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2020-10-05 22:54:36,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-10-05 22:54:36,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2020-10-05 22:54:36,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-10-05 22:54:36,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 177 transitions. [2020-10-05 22:54:36,688 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 177 transitions. Word has length 18 [2020-10-05 22:54:36,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:54:36,688 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 177 transitions. [2020-10-05 22:54:36,688 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 22:54:36,688 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 177 transitions. [2020-10-05 22:54:36,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 22:54:36,689 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:54:36,689 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:54:36,689 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 22:54:36,690 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:54:36,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:54:36,690 INFO L82 PathProgramCache]: Analyzing trace with hash 646402210, now seen corresponding path program 4 times [2020-10-05 22:54:36,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:54:36,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995318009] [2020-10-05 22:54:36,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:54:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:54:37,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:54:37,193 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995318009] [2020-10-05 22:54:37,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:54:37,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-05 22:54:37,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611035904] [2020-10-05 22:54:37,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-05 22:54:37,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:54:37,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-05 22:54:37,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-05 22:54:37,195 INFO L87 Difference]: Start difference. First operand 96 states and 177 transitions. Second operand 14 states. [2020-10-05 22:54:38,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:54:38,088 INFO L93 Difference]: Finished difference Result 135 states and 244 transitions. [2020-10-05 22:54:38,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-05 22:54:38,089 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-05 22:54:38,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:54:38,091 INFO L225 Difference]: With dead ends: 135 [2020-10-05 22:54:38,091 INFO L226 Difference]: Without dead ends: 113 [2020-10-05 22:54:38,092 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2020-10-05 22:54:38,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-10-05 22:54:38,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 92. [2020-10-05 22:54:38,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-10-05 22:54:38,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 171 transitions. [2020-10-05 22:54:38,095 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 171 transitions. Word has length 18 [2020-10-05 22:54:38,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:54:38,096 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 171 transitions. [2020-10-05 22:54:38,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-05 22:54:38,096 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 171 transitions. [2020-10-05 22:54:38,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 22:54:38,096 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:54:38,096 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:54:38,096 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 22:54:38,097 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:54:38,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:54:38,097 INFO L82 PathProgramCache]: Analyzing trace with hash -318962108, now seen corresponding path program 5 times [2020-10-05 22:54:38,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:54:38,097 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103087132] [2020-10-05 22:54:38,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:54:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:54:38,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:54:38,566 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103087132] [2020-10-05 22:54:38,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:54:38,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-05 22:54:38,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221874607] [2020-10-05 22:54:38,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-05 22:54:38,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:54:38,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-05 22:54:38,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-10-05 22:54:38,568 INFO L87 Difference]: Start difference. First operand 92 states and 171 transitions. Second operand 14 states. [2020-10-05 22:54:39,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:54:39,577 INFO L93 Difference]: Finished difference Result 152 states and 280 transitions. [2020-10-05 22:54:39,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-05 22:54:39,578 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-05 22:54:39,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:54:39,579 INFO L225 Difference]: With dead ends: 152 [2020-10-05 22:54:39,579 INFO L226 Difference]: Without dead ends: 144 [2020-10-05 22:54:39,580 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2020-10-05 22:54:39,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-10-05 22:54:39,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 100. [2020-10-05 22:54:39,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-10-05 22:54:39,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 187 transitions. [2020-10-05 22:54:39,587 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 187 transitions. Word has length 18 [2020-10-05 22:54:39,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:54:39,587 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 187 transitions. [2020-10-05 22:54:39,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-05 22:54:39,588 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 187 transitions. [2020-10-05 22:54:39,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 22:54:39,588 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:54:39,588 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:54:39,588 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 22:54:39,589 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:54:39,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:54:39,589 INFO L82 PathProgramCache]: Analyzing trace with hash -569697014, now seen corresponding path program 6 times [2020-10-05 22:54:39,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:54:39,589 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391637865] [2020-10-05 22:54:39,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:54:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:54:40,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:54:40,069 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391637865] [2020-10-05 22:54:40,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:54:40,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-05 22:54:40,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322904976] [2020-10-05 22:54:40,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-05 22:54:40,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:54:40,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-05 22:54:40,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-05 22:54:40,070 INFO L87 Difference]: Start difference. First operand 100 states and 187 transitions. Second operand 14 states. [2020-10-05 22:54:41,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:54:41,010 INFO L93 Difference]: Finished difference Result 154 states and 283 transitions. [2020-10-05 22:54:41,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-05 22:54:41,011 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-05 22:54:41,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:54:41,012 INFO L225 Difference]: With dead ends: 154 [2020-10-05 22:54:41,012 INFO L226 Difference]: Without dead ends: 142 [2020-10-05 22:54:41,013 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-10-05 22:54:41,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-10-05 22:54:41,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 98. [2020-10-05 22:54:41,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-10-05 22:54:41,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 183 transitions. [2020-10-05 22:54:41,017 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 183 transitions. Word has length 18 [2020-10-05 22:54:41,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:54:41,017 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 183 transitions. [2020-10-05 22:54:41,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-05 22:54:41,017 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 183 transitions. [2020-10-05 22:54:41,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 22:54:41,018 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:54:41,018 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:54:41,018 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 22:54:41,018 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:54:41,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:54:41,019 INFO L82 PathProgramCache]: Analyzing trace with hash -269125948, now seen corresponding path program 7 times [2020-10-05 22:54:41,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:54:41,019 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402850356] [2020-10-05 22:54:41,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:54:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:54:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:54:41,483 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402850356] [2020-10-05 22:54:41,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:54:41,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-05 22:54:41,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894159681] [2020-10-05 22:54:41,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-05 22:54:41,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:54:41,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-05 22:54:41,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-05 22:54:41,484 INFO L87 Difference]: Start difference. First operand 98 states and 183 transitions. Second operand 14 states. [2020-10-05 22:54:42,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:54:42,367 INFO L93 Difference]: Finished difference Result 149 states and 278 transitions. [2020-10-05 22:54:42,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-05 22:54:42,368 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-05 22:54:42,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:54:42,369 INFO L225 Difference]: With dead ends: 149 [2020-10-05 22:54:42,370 INFO L226 Difference]: Without dead ends: 133 [2020-10-05 22:54:42,370 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-10-05 22:54:42,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-10-05 22:54:42,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 96. [2020-10-05 22:54:42,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-10-05 22:54:42,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 179 transitions. [2020-10-05 22:54:42,374 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 179 transitions. Word has length 18 [2020-10-05 22:54:42,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:54:42,375 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 179 transitions. [2020-10-05 22:54:42,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-05 22:54:42,375 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 179 transitions. [2020-10-05 22:54:42,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 22:54:42,375 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:54:42,375 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:54:42,376 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 22:54:42,376 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:54:42,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:54:42,376 INFO L82 PathProgramCache]: Analyzing trace with hash -969779638, now seen corresponding path program 8 times [2020-10-05 22:54:42,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:54:42,377 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426612993] [2020-10-05 22:54:42,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:54:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:54:42,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:54:42,816 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426612993] [2020-10-05 22:54:42,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:54:42,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-05 22:54:42,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739191696] [2020-10-05 22:54:42,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-05 22:54:42,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:54:42,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-05 22:54:42,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2020-10-05 22:54:42,817 INFO L87 Difference]: Start difference. First operand 96 states and 179 transitions. Second operand 14 states. [2020-10-05 22:54:43,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:54:43,740 INFO L93 Difference]: Finished difference Result 167 states and 302 transitions. [2020-10-05 22:54:43,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-05 22:54:43,741 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-10-05 22:54:43,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:54:43,743 INFO L225 Difference]: With dead ends: 167 [2020-10-05 22:54:43,743 INFO L226 Difference]: Without dead ends: 147 [2020-10-05 22:54:43,744 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-10-05 22:54:43,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-10-05 22:54:43,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 94. [2020-10-05 22:54:43,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-10-05 22:54:43,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 175 transitions. [2020-10-05 22:54:43,748 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 175 transitions. Word has length 18 [2020-10-05 22:54:43,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:54:43,748 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 175 transitions. [2020-10-05 22:54:43,748 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-05 22:54:43,749 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 175 transitions. [2020-10-05 22:54:43,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 22:54:43,749 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:54:43,749 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:54:43,750 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 22:54:43,750 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:54:43,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:54:43,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1049440908, now seen corresponding path program 3 times [2020-10-05 22:54:43,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:54:43,751 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149779116] [2020-10-05 22:54:43,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:54:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:54:44,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:54:44,032 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149779116] [2020-10-05 22:54:44,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:54:44,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-05 22:54:44,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060574886] [2020-10-05 22:54:44,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 22:54:44,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:54:44,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 22:54:44,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-10-05 22:54:44,034 INFO L87 Difference]: Start difference. First operand 94 states and 175 transitions. Second operand 11 states. [2020-10-05 22:54:44,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:54:44,625 INFO L93 Difference]: Finished difference Result 206 states and 364 transitions. [2020-10-05 22:54:44,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-05 22:54:44,626 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2020-10-05 22:54:44,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:54:44,629 INFO L225 Difference]: With dead ends: 206 [2020-10-05 22:54:44,630 INFO L226 Difference]: Without dead ends: 206 [2020-10-05 22:54:44,630 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2020-10-05 22:54:44,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-10-05 22:54:44,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 116. [2020-10-05 22:54:44,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-10-05 22:54:44,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 229 transitions. [2020-10-05 22:54:44,643 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 229 transitions. Word has length 18 [2020-10-05 22:54:44,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:54:44,644 INFO L479 AbstractCegarLoop]: Abstraction has 116 states and 229 transitions. [2020-10-05 22:54:44,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 22:54:44,644 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 229 transitions. [2020-10-05 22:54:44,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 22:54:44,645 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:54:44,645 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:54:44,646 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-05 22:54:44,646 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:54:44,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:54:44,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1049440926, now seen corresponding path program 9 times [2020-10-05 22:54:44,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:54:44,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482794955] [2020-10-05 22:54:44,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:54:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 22:54:44,715 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 22:54:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 22:54:44,777 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 22:54:44,834 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 22:54:44,837 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 22:54:44,838 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-05 22:54:44,839 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 22:54:44,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [392] [392] L1682-->L1739: Formula: (and (= ULTIMATE.start_ldv_assert_~expression_Out37464057 |ULTIMATE.start_ldv_assert_#in~expression_In37464057|) (not (= ULTIMATE.start_ldv_assert_~expression_Out37464057 0))) InVars {ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In37464057|} OutVars{ULTIMATE.start_main_#t~mem40=|ULTIMATE.start_main_#t~mem40_Out37464057|, ULTIMATE.start_ldv_assert_#in~expression=|ULTIMATE.start_ldv_assert_#in~expression_In37464057|, ULTIMATE.start_ldv_assert_~expression=ULTIMATE.start_ldv_assert_~expression_Out37464057} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem40, ULTIMATE.start_ldv_assert_~expression] because there is no mapped edge [2020-10-05 22:54:44,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 10:54:44 BasicIcfg [2020-10-05 22:54:44,966 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 22:54:44,970 INFO L168 Benchmark]: Toolchain (without parser) took 48839.59 ms. Allocated memory was 140.0 MB in the beginning and 382.7 MB in the end (delta: 242.7 MB). Free memory was 98.2 MB in the beginning and 259.4 MB in the end (delta: -161.2 MB). Peak memory consumption was 81.5 MB. Max. memory is 7.1 GB. [2020-10-05 22:54:44,970 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 140.0 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-10-05 22:54:44,972 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1564.19 ms. Allocated memory was 140.0 MB in the beginning and 235.4 MB in the end (delta: 95.4 MB). Free memory was 98.0 MB in the beginning and 168.4 MB in the end (delta: -70.4 MB). Peak memory consumption was 76.1 MB. Max. memory is 7.1 GB. [2020-10-05 22:54:44,974 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.62 ms. Allocated memory is still 235.4 MB. Free memory was 168.4 MB in the beginning and 165.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-05 22:54:44,974 INFO L168 Benchmark]: Boogie Preprocessor took 48.04 ms. Allocated memory is still 235.4 MB. Free memory was 165.5 MB in the beginning and 162.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-05 22:54:44,975 INFO L168 Benchmark]: RCFGBuilder took 681.00 ms. Allocated memory is still 235.4 MB. Free memory was 162.7 MB in the beginning and 116.3 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. [2020-10-05 22:54:44,976 INFO L168 Benchmark]: TraceAbstraction took 46409.86 ms. Allocated memory was 235.4 MB in the beginning and 382.7 MB in the end (delta: 147.3 MB). Free memory was 116.3 MB in the beginning and 259.4 MB in the end (delta: -143.0 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. [2020-10-05 22:54:44,985 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.22 ms. Allocated memory is still 140.0 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1564.19 ms. Allocated memory was 140.0 MB in the beginning and 235.4 MB in the end (delta: 95.4 MB). Free memory was 98.0 MB in the beginning and 168.4 MB in the end (delta: -70.4 MB). Peak memory consumption was 76.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 130.62 ms. Allocated memory is still 235.4 MB. Free memory was 168.4 MB in the beginning and 165.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.04 ms. Allocated memory is still 235.4 MB. Free memory was 165.5 MB in the beginning and 162.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 681.00 ms. Allocated memory is still 235.4 MB. Free memory was 162.7 MB in the beginning and 116.3 MB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 46409.86 ms. Allocated memory was 235.4 MB in the beginning and 382.7 MB in the end (delta: 147.3 MB). Free memory was 116.3 MB in the beginning and 259.4 MB in the end (delta: -143.0 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 29.9s, 129 ProgramPointsBefore, 34 ProgramPointsAfterwards, 131 TransitionsBefore, 32 TransitionsAfterwards, 2200 CoEnabledTransitionPairs, 7 FixpointIterations, 63 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 1101 VarBasedMoverChecksPositive, 35 VarBasedMoverChecksNegative, 1 SemBasedMoverChecksPositive, 31 SemBasedMoverChecksNegative, 11 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 24.5s, 0 MoverChecksTotal, 2954 CheckedPairsTotal, 134 TotalNumberOfCompositions - CounterExampleResult [Line: 1682]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1683] 0 pthread_t t1,t2; [L1725] 0 return 0; [L1731] 0 int ret = my_drv_init(); [L1732] COND TRUE 0 ret==0 [L1733] 0 int probe_ret; [L1734] 0 struct my_data data; [L1704] 0 struct device *d = &data->dev; [L1706] 0 data->shared.a = 0 [L1707] 0 data->shared.b = 0 [L1708] 0 int res = __VERIFIER_nondet_int(); [L1709] COND FALSE 0 !(\read(res)) [L1711] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={5:24}, t1={6:0}, t2={3:0}] [L1696] 1 struct device *dev = (struct device*)arg; [L1697] 1 struct my_data *data; [L1698] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1698] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1699] 1 data->shared.a = 1 VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1={6:0}, t2={3:0}] [L1700] 1 data->shared.b VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, data->shared.b=0, dev={5:24}, t1={6:0}, t2={3:0}] [L1712] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, data->shared.b=0, dev={5:24}, t1={6:0}, t2={3:0}] [L1696] 2 struct device *dev = (struct device*)arg; [L1697] 2 struct my_data *data; [L1698] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1698] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1699] 2 data->shared.a = 1 VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, data->shared.b=0, dev={5:24}, t1={6:0}, t2={3:0}] [L1700] EXPR 2 data->shared.b VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, data->shared.b=0, dev={5:24}, t1={6:0}, t2={3:0}] [L1700] 2 data->shared.b = data->shared.b + 1 [L1701] 2 return 0; [L1700] 1 data->shared.b = data->shared.b + 1 [L1701] 1 return 0; [L1713] 0 return 0; [L1735] 0 probe_ret = my_drv_probe(&data) VAL [\result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1={6:0}, t2={3:0}] [L1736] COND TRUE 0 probe_ret==0 [L1719] 0 void *status; [L1720] 0 \read(t1) VAL [\result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1={6:0}, t2={3:0}] [L1720] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1={6:0}, t2={3:0}] [L1721] 0 \read(t2) VAL [\result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1={6:0}, t2={3:0}] [L1721] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1={6:0}, t2={3:0}] [L1738] 0 data.shared.a [L1739] 0 data.shared.b [L1682] COND TRUE 0 !expression [L1682] 0 __VERIFIER_error() VAL [\result={0:0}, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1={6:0}, t2={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 46.1s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 30.0s, HoareTripleCheckerStatistics: 269 SDtfs, 583 SDslu, 947 SDs, 0 SdLazy, 3861 SolverSat, 396 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 497 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 78203 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...