/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 11:26:59,933 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 11:26:59,935 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 11:26:59,964 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 11:26:59,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 11:26:59,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 11:26:59,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 11:26:59,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 11:26:59,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 11:26:59,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 11:26:59,980 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 11:26:59,981 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 11:26:59,981 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 11:26:59,982 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 11:26:59,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 11:26:59,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 11:26:59,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 11:26:59,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 11:26:59,985 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 11:26:59,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 11:26:59,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 11:26:59,990 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 11:26:59,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 11:26:59,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 11:26:59,992 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 11:26:59,992 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 11:26:59,992 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 11:26:59,993 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 11:26:59,993 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 11:26:59,994 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 11:26:59,994 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 11:26:59,994 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 11:26:59,995 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 11:26:59,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 11:26:59,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 11:26:59,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 11:26:59,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 11:26:59,996 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 11:26:59,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 11:26:59,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 11:26:59,997 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 11:27:00,003 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2021-03-11 11:27:00,030 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 11:27:00,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 11:27:00,033 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 11:27:00,033 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 11:27:00,033 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 11:27:00,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 11:27:00,034 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 11:27:00,034 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 11:27:00,034 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 11:27:00,034 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 11:27:00,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 11:27:00,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 11:27:00,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 11:27:00,035 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 11:27:00,035 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 11:27:00,035 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 11:27:00,035 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 11:27:00,035 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 11:27:00,035 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 11:27:00,035 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 11:27:00,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 11:27:00,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 11:27:00,036 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 11:27:00,036 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 11:27:00,036 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 11:27:00,036 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 11:27:00,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 11:27:00,036 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-03-11 11:27:00,036 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-11 11:27:00,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 11:27:00,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 11:27:00,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 11:27:00,288 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 11:27:00,288 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 11:27:00,289 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i [2021-03-11 11:27:00,340 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab3790f8d/4478b7fcc33e4d96bffd93abc87a90b8/FLAG209da37e0 [2021-03-11 11:27:00,784 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 11:27:00,784 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i [2021-03-11 11:27:00,796 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab3790f8d/4478b7fcc33e4d96bffd93abc87a90b8/FLAG209da37e0 [2021-03-11 11:27:00,807 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab3790f8d/4478b7fcc33e4d96bffd93abc87a90b8 [2021-03-11 11:27:00,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 11:27:00,813 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 11:27:00,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 11:27:00,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 11:27:00,819 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 11:27:00,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:27:00" (1/1) ... [2021-03-11 11:27:00,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3758c6d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:27:00, skipping insertion in model container [2021-03-11 11:27:00,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:27:00" (1/1) ... [2021-03-11 11:27:00,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 11:27:00,872 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 11:27:01,026 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i[949,962] [2021-03-11 11:27:01,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 11:27:01,207 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 11:27:01,216 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i[949,962] [2021-03-11 11:27:01,262 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 11:27:01,312 INFO L208 MainTranslator]: Completed translation [2021-03-11 11:27:01,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:27:01 WrapperNode [2021-03-11 11:27:01,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 11:27:01,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 11:27:01,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 11:27:01,314 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 11:27:01,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:27:01" (1/1) ... [2021-03-11 11:27:01,332 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:27:01" (1/1) ... [2021-03-11 11:27:01,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 11:27:01,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 11:27:01,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 11:27:01,355 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 11:27:01,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:27:01" (1/1) ... [2021-03-11 11:27:01,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:27:01" (1/1) ... [2021-03-11 11:27:01,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:27:01" (1/1) ... [2021-03-11 11:27:01,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:27:01" (1/1) ... [2021-03-11 11:27:01,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:27:01" (1/1) ... [2021-03-11 11:27:01,374 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:27:01" (1/1) ... [2021-03-11 11:27:01,376 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:27:01" (1/1) ... [2021-03-11 11:27:01,378 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 11:27:01,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 11:27:01,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 11:27:01,379 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 11:27:01,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:27:01" (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 [2021-03-11 11:27:01,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 11:27:01,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 11:27:01,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 11:27:01,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 11:27:01,473 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 11:27:01,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 11:27:01,473 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 11:27:01,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 11:27:01,473 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 11:27:01,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 11:27:01,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 11:27:01,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 11:27:01,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 11:27:01,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 11:27:01,474 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 11:27:02,820 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 11:27:02,820 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 11:27:02,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:27:02 BoogieIcfgContainer [2021-03-11 11:27:02,821 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 11:27:02,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 11:27:02,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 11:27:02,824 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 11:27:02,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 11:27:00" (1/3) ... [2021-03-11 11:27:02,824 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758f23ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:27:02, skipping insertion in model container [2021-03-11 11:27:02,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:27:01" (2/3) ... [2021-03-11 11:27:02,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@758f23ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:27:02, skipping insertion in model container [2021-03-11 11:27:02,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:27:02" (3/3) ... [2021-03-11 11:27:02,826 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_pso.opt.i [2021-03-11 11:27:02,829 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-03-11 11:27:02,829 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 11:27:02,832 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 11:27:02,832 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 11:27:02,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,858 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,858 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,858 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,859 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,859 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,859 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,860 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,860 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,860 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,860 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,860 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,861 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,862 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,862 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,862 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,862 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,862 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,862 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,862 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,863 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,865 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,865 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,865 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,865 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,865 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,865 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,866 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,866 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,868 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,870 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,870 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,870 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,870 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,871 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,872 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,872 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,872 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,873 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,873 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,873 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,873 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,873 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,873 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,878 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,878 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,878 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 11:27:02,880 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 11:27:02,892 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-11 11:27:02,910 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 11:27:02,910 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-11 11:27:02,910 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 11:27:02,910 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 11:27:02,914 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 11:27:02,914 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 11:27:02,914 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 11:27:02,914 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 11:27:02,924 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 11:27:02,931 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 205 flow [2021-03-11 11:27:02,933 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 205 flow [2021-03-11 11:27:02,934 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 205 flow [2021-03-11 11:27:02,956 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2021-03-11 11:27:02,956 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 11:27:02,958 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-11 11:27:02,960 INFO L116 LiptonReduction]: Number of co-enabled transitions 1578 [2021-03-11 11:27:04,605 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-03-11 11:27:04,954 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-03-11 11:27:05,084 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-11 11:27:06,592 WARN L205 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 188 [2021-03-11 11:27:06,854 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-11 11:27:08,061 WARN L205 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 313 DAG size of output: 269 [2021-03-11 11:27:08,567 WARN L205 SmtUtils]: Spent 504.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-11 11:27:09,801 WARN L205 SmtUtils]: Spent 870.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 203 [2021-03-11 11:27:10,185 WARN L205 SmtUtils]: Spent 382.00 ms on a formula simplification that was a NOOP. DAG size: 201 [2021-03-11 11:27:11,495 WARN L205 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 327 DAG size of output: 283 [2021-03-11 11:27:12,096 WARN L205 SmtUtils]: Spent 596.00 ms on a formula simplification that was a NOOP. DAG size: 280 [2021-03-11 11:27:12,355 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-03-11 11:27:12,485 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-11 11:27:12,729 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-03-11 11:27:12,845 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-11 11:27:13,050 INFO L131 LiptonReduction]: Checked pairs total: 3952 [2021-03-11 11:27:13,050 INFO L133 LiptonReduction]: Total number of compositions: 81 [2021-03-11 11:27:13,057 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2021-03-11 11:27:13,094 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 650 states, 646 states have (on average 3.1393188854489162) internal successors, (2028), 649 states have internal predecessors, (2028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:13,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 650 states, 646 states have (on average 3.1393188854489162) internal successors, (2028), 649 states have internal predecessors, (2028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:13,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-03-11 11:27:13,101 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:13,101 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:13,102 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:13,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:13,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1494262085, now seen corresponding path program 1 times [2021-03-11 11:27:13,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:13,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319498112] [2021-03-11 11:27:13,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:13,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:13,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:27:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:13,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319498112] [2021-03-11 11:27:13,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:13,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 11:27:13,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100521083] [2021-03-11 11:27:13,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 11:27:13,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:13,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 11:27:13,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:27:13,323 INFO L87 Difference]: Start difference. First operand has 650 states, 646 states have (on average 3.1393188854489162) internal successors, (2028), 649 states have internal predecessors, (2028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:13,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:13,386 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2021-03-11 11:27:13,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 11:27:13,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-03-11 11:27:13,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:13,401 INFO L225 Difference]: With dead ends: 550 [2021-03-11 11:27:13,401 INFO L226 Difference]: Without dead ends: 450 [2021-03-11 11:27:13,402 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:27:13,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2021-03-11 11:27:13,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2021-03-11 11:27:13,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 3.024498886414254) internal successors, (1358), 449 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:13,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2021-03-11 11:27:13,451 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 7 [2021-03-11 11:27:13,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:13,452 INFO L480 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2021-03-11 11:27:13,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:13,452 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2021-03-11 11:27:13,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-03-11 11:27:13,453 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:13,453 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:13,453 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 11:27:13,453 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:13,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:13,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1466865287, now seen corresponding path program 1 times [2021-03-11 11:27:13,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:13,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273629349] [2021-03-11 11:27:13,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:13,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:13,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:27:13,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:13,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273629349] [2021-03-11 11:27:13,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:13,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 11:27:13,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499318056] [2021-03-11 11:27:13,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 11:27:13,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:13,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 11:27:13,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:27:13,517 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:13,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:13,530 INFO L93 Difference]: Finished difference Result 440 states and 1320 transitions. [2021-03-11 11:27:13,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 11:27:13,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-03-11 11:27:13,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:13,533 INFO L225 Difference]: With dead ends: 440 [2021-03-11 11:27:13,533 INFO L226 Difference]: Without dead ends: 440 [2021-03-11 11:27:13,534 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:27:13,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2021-03-11 11:27:13,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2021-03-11 11:27:13,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 3.0068337129840548) internal successors, (1320), 439 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:13,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2021-03-11 11:27:13,574 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 9 [2021-03-11 11:27:13,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:13,574 INFO L480 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2021-03-11 11:27:13,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:13,574 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2021-03-11 11:27:13,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-03-11 11:27:13,575 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:13,575 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:13,575 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 11:27:13,575 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:13,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:13,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1771816664, now seen corresponding path program 1 times [2021-03-11 11:27:13,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:13,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538367056] [2021-03-11 11:27:13,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:13,700 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-11 11:27:13,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-11 11:27:13,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:13,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:27:13,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:13,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538367056] [2021-03-11 11:27:13,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:13,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 11:27:13,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119498220] [2021-03-11 11:27:13,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 11:27:13,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:13,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 11:27:13,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:27:13,735 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:13,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:13,762 INFO L93 Difference]: Finished difference Result 434 states and 1298 transitions. [2021-03-11 11:27:13,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 11:27:13,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-03-11 11:27:13,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:13,768 INFO L225 Difference]: With dead ends: 434 [2021-03-11 11:27:13,768 INFO L226 Difference]: Without dead ends: 434 [2021-03-11 11:27:13,769 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.5ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:27:13,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-03-11 11:27:13,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2021-03-11 11:27:13,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 2.9976905311778292) internal successors, (1298), 433 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:13,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1298 transitions. [2021-03-11 11:27:13,791 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1298 transitions. Word has length 10 [2021-03-11 11:27:13,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:13,792 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 1298 transitions. [2021-03-11 11:27:13,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:13,792 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1298 transitions. [2021-03-11 11:27:13,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-03-11 11:27:13,795 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:13,796 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:13,796 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 11:27:13,796 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:13,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:13,796 INFO L82 PathProgramCache]: Analyzing trace with hash 908257463, now seen corresponding path program 1 times [2021-03-11 11:27:13,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:13,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513768355] [2021-03-11 11:27:13,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:13,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:13,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:27:13,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:13,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513768355] [2021-03-11 11:27:13,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:13,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 11:27:13,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543926056] [2021-03-11 11:27:13,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 11:27:13,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:13,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 11:27:13,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:27:13,872 INFO L87 Difference]: Start difference. First operand 434 states and 1298 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:13,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:13,880 INFO L93 Difference]: Finished difference Result 427 states and 1272 transitions. [2021-03-11 11:27:13,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 11:27:13,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-03-11 11:27:13,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:13,883 INFO L225 Difference]: With dead ends: 427 [2021-03-11 11:27:13,883 INFO L226 Difference]: Without dead ends: 427 [2021-03-11 11:27:13,883 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:27:13,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-03-11 11:27:13,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2021-03-11 11:27:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 2.9859154929577465) internal successors, (1272), 426 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:13,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1272 transitions. [2021-03-11 11:27:13,891 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 1272 transitions. Word has length 11 [2021-03-11 11:27:13,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:13,892 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 1272 transitions. [2021-03-11 11:27:13,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:13,892 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 1272 transitions. [2021-03-11 11:27:13,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-03-11 11:27:13,894 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:13,894 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:13,894 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 11:27:13,894 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:13,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:13,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1147433543, now seen corresponding path program 1 times [2021-03-11 11:27:13,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:13,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972161349] [2021-03-11 11:27:13,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:13,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:13,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:27:13,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:13,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:27:13,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:13,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 11:27:13,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:13,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972161349] [2021-03-11 11:27:13,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:13,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 11:27:13,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574196668] [2021-03-11 11:27:13,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 11:27:13,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:13,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 11:27:13,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:27:13,984 INFO L87 Difference]: Start difference. First operand 427 states and 1272 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:14,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:14,023 INFO L93 Difference]: Finished difference Result 422 states and 1253 transitions. [2021-03-11 11:27:14,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 11:27:14,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-03-11 11:27:14,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:14,026 INFO L225 Difference]: With dead ends: 422 [2021-03-11 11:27:14,026 INFO L226 Difference]: Without dead ends: 422 [2021-03-11 11:27:14,029 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.5ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:27:14,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-03-11 11:27:14,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 418. [2021-03-11 11:27:14,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 2.9784172661870505) internal successors, (1242), 417 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:14,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1242 transitions. [2021-03-11 11:27:14,037 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 1242 transitions. Word has length 12 [2021-03-11 11:27:14,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:14,037 INFO L480 AbstractCegarLoop]: Abstraction has 418 states and 1242 transitions. [2021-03-11 11:27:14,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:14,037 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 1242 transitions. [2021-03-11 11:27:14,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-03-11 11:27:14,038 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:14,038 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:14,038 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 11:27:14,038 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:14,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:14,038 INFO L82 PathProgramCache]: Analyzing trace with hash -568678516, now seen corresponding path program 1 times [2021-03-11 11:27:14,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:14,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128423791] [2021-03-11 11:27:14,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:14,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:14,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:27:14,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:14,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:27:14,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:14,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:27:14,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:14,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128423791] [2021-03-11 11:27:14,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:14,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 11:27:14,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943611744] [2021-03-11 11:27:14,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 11:27:14,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:14,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 11:27:14,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:27:14,130 INFO L87 Difference]: Start difference. First operand 418 states and 1242 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:14,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:14,166 INFO L93 Difference]: Finished difference Result 407 states and 1202 transitions. [2021-03-11 11:27:14,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 11:27:14,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-03-11 11:27:14,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:14,169 INFO L225 Difference]: With dead ends: 407 [2021-03-11 11:27:14,169 INFO L226 Difference]: Without dead ends: 407 [2021-03-11 11:27:14,169 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:27:14,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2021-03-11 11:27:14,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2021-03-11 11:27:14,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 2.960591133004926) internal successors, (1202), 406 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:14,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1202 transitions. [2021-03-11 11:27:14,177 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1202 transitions. Word has length 12 [2021-03-11 11:27:14,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:14,177 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 1202 transitions. [2021-03-11 11:27:14,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:14,177 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1202 transitions. [2021-03-11 11:27:14,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-03-11 11:27:14,177 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:14,177 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:14,177 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 11:27:14,177 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:14,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:14,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1210702266, now seen corresponding path program 1 times [2021-03-11 11:27:14,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:14,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124579351] [2021-03-11 11:27:14,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:14,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:14,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:27:14,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:14,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:27:14,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:14,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:27:14,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:14,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:27:14,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:14,264 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124579351] [2021-03-11 11:27:14,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:14,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 11:27:14,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245256520] [2021-03-11 11:27:14,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 11:27:14,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:14,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 11:27:14,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:27:14,265 INFO L87 Difference]: Start difference. First operand 407 states and 1202 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:14,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:14,325 INFO L93 Difference]: Finished difference Result 431 states and 1284 transitions. [2021-03-11 11:27:14,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:27:14,325 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-03-11 11:27:14,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:14,327 INFO L225 Difference]: With dead ends: 431 [2021-03-11 11:27:14,327 INFO L226 Difference]: Without dead ends: 431 [2021-03-11 11:27:14,328 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 22.7ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:27:14,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-03-11 11:27:14,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 415. [2021-03-11 11:27:14,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 2.9565217391304346) internal successors, (1224), 414 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:14,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 1224 transitions. [2021-03-11 11:27:14,336 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 1224 transitions. Word has length 13 [2021-03-11 11:27:14,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:14,336 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 1224 transitions. [2021-03-11 11:27:14,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:14,336 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1224 transitions. [2021-03-11 11:27:14,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-03-11 11:27:14,337 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:14,337 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:14,337 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 11:27:14,337 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:14,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:14,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1211461146, now seen corresponding path program 2 times [2021-03-11 11:27:14,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:14,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132493679] [2021-03-11 11:27:14,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:14,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:14,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:27:14,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:14,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:27:14,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:14,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:27:14,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:14,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 11:27:14,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:14,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132493679] [2021-03-11 11:27:14,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:14,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 11:27:14,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510948335] [2021-03-11 11:27:14,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 11:27:14,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:14,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 11:27:14,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:27:14,416 INFO L87 Difference]: Start difference. First operand 415 states and 1224 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:14,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:14,487 INFO L93 Difference]: Finished difference Result 476 states and 1393 transitions. [2021-03-11 11:27:14,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 11:27:14,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-03-11 11:27:14,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:14,490 INFO L225 Difference]: With dead ends: 476 [2021-03-11 11:27:14,490 INFO L226 Difference]: Without dead ends: 476 [2021-03-11 11:27:14,492 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 36.1ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-03-11 11:27:14,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2021-03-11 11:27:14,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 448. [2021-03-11 11:27:14,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 2.9440715883668904) internal successors, (1316), 447 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:14,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1316 transitions. [2021-03-11 11:27:14,500 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 1316 transitions. Word has length 13 [2021-03-11 11:27:14,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:14,500 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 1316 transitions. [2021-03-11 11:27:14,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:14,500 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 1316 transitions. [2021-03-11 11:27:14,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-03-11 11:27:14,501 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:14,501 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:14,501 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 11:27:14,501 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:14,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:14,501 INFO L82 PathProgramCache]: Analyzing trace with hash -449671006, now seen corresponding path program 1 times [2021-03-11 11:27:14,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:14,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535056985] [2021-03-11 11:27:14,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:14,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:14,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:27:14,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:14,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:27:14,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:14,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535056985] [2021-03-11 11:27:14,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:14,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 11:27:14,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205924968] [2021-03-11 11:27:14,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 11:27:14,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:14,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 11:27:14,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:27:14,544 INFO L87 Difference]: Start difference. First operand 448 states and 1316 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:14,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:14,553 INFO L93 Difference]: Finished difference Result 609 states and 1745 transitions. [2021-03-11 11:27:14,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 11:27:14,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-03-11 11:27:14,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:14,556 INFO L225 Difference]: With dead ends: 609 [2021-03-11 11:27:14,556 INFO L226 Difference]: Without dead ends: 408 [2021-03-11 11:27:14,556 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:27:14,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2021-03-11 11:27:14,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 390. [2021-03-11 11:27:14,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 2.7737789203084833) internal successors, (1079), 389 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 1079 transitions. [2021-03-11 11:27:14,563 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 1079 transitions. Word has length 13 [2021-03-11 11:27:14,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:14,563 INFO L480 AbstractCegarLoop]: Abstraction has 390 states and 1079 transitions. [2021-03-11 11:27:14,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:14,563 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 1079 transitions. [2021-03-11 11:27:14,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-03-11 11:27:14,564 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:14,564 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:14,564 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 11:27:14,564 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:14,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:14,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1122933501, now seen corresponding path program 1 times [2021-03-11 11:27:14,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:14,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107201995] [2021-03-11 11:27:14,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:14,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:14,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:27:14,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:14,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 11:27:14,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:14,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-11 11:27:14,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:14,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-11 11:27:14,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:14,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-11 11:27:14,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:14,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107201995] [2021-03-11 11:27:14,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:14,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 11:27:14,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322321349] [2021-03-11 11:27:14,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-11 11:27:14,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:14,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-11 11:27:14,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:27:14,673 INFO L87 Difference]: Start difference. First operand 390 states and 1079 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:14,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:14,794 INFO L93 Difference]: Finished difference Result 378 states and 1041 transitions. [2021-03-11 11:27:14,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:27:14,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-03-11 11:27:14,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:14,796 INFO L225 Difference]: With dead ends: 378 [2021-03-11 11:27:14,796 INFO L226 Difference]: Without dead ends: 282 [2021-03-11 11:27:14,796 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 99.5ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-03-11 11:27:14,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-03-11 11:27:14,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 252. [2021-03-11 11:27:14,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 2.7768924302788847) internal successors, (697), 251 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:14,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 697 transitions. [2021-03-11 11:27:14,800 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 697 transitions. Word has length 14 [2021-03-11 11:27:14,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:14,801 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 697 transitions. [2021-03-11 11:27:14,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:14,801 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 697 transitions. [2021-03-11 11:27:14,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-03-11 11:27:14,801 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:14,801 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:14,801 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 11:27:14,801 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:14,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:14,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1054899603, now seen corresponding path program 1 times [2021-03-11 11:27:14,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:14,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538573234] [2021-03-11 11:27:14,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:14,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:14,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:27:14,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:14,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:27:14,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:14,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:27:14,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:14,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538573234] [2021-03-11 11:27:14,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:14,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 11:27:14,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57661684] [2021-03-11 11:27:14,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 11:27:14,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:14,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 11:27:14,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 11:27:14,854 INFO L87 Difference]: Start difference. First operand 252 states and 697 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:14,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:14,873 INFO L93 Difference]: Finished difference Result 251 states and 612 transitions. [2021-03-11 11:27:14,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 11:27:14,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-03-11 11:27:14,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:14,874 INFO L225 Difference]: With dead ends: 251 [2021-03-11 11:27:14,874 INFO L226 Difference]: Without dead ends: 181 [2021-03-11 11:27:14,875 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:27:14,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-03-11 11:27:14,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2021-03-11 11:27:14,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 2.3833333333333333) internal successors, (429), 180 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:14,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 429 transitions. [2021-03-11 11:27:14,878 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 429 transitions. Word has length 14 [2021-03-11 11:27:14,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:14,878 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 429 transitions. [2021-03-11 11:27:14,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:14,878 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 429 transitions. [2021-03-11 11:27:14,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-03-11 11:27:14,878 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:14,878 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:14,879 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 11:27:14,879 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:14,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:14,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1974844628, now seen corresponding path program 1 times [2021-03-11 11:27:14,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:14,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536248049] [2021-03-11 11:27:14,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:14,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:14,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:14,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:27:14,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:14,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:27:14,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:14,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:27:14,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:14,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:27:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:14,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536248049] [2021-03-11 11:27:14,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:14,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 11:27:14,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689526788] [2021-03-11 11:27:14,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 11:27:14,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:14,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 11:27:14,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 11:27:14,935 INFO L87 Difference]: Start difference. First operand 181 states and 429 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:14,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:14,968 INFO L93 Difference]: Finished difference Result 150 states and 317 transitions. [2021-03-11 11:27:14,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 11:27:14,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-03-11 11:27:14,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:14,970 INFO L225 Difference]: With dead ends: 150 [2021-03-11 11:27:14,970 INFO L226 Difference]: Without dead ends: 112 [2021-03-11 11:27:14,970 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 12.6ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:27:14,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-03-11 11:27:14,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-03-11 11:27:14,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 2.036036036036036) internal successors, (226), 111 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:14,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 226 transitions. [2021-03-11 11:27:14,972 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 226 transitions. Word has length 15 [2021-03-11 11:27:14,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:14,972 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 226 transitions. [2021-03-11 11:27:14,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:14,972 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 226 transitions. [2021-03-11 11:27:14,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-03-11 11:27:14,973 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:14,973 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:14,973 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-11 11:27:14,973 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:14,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:14,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1106654447, now seen corresponding path program 1 times [2021-03-11 11:27:14,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:14,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485109028] [2021-03-11 11:27:14,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:15,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:15,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:27:15,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:15,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:27:15,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:15,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485109028] [2021-03-11 11:27:15,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:15,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 11:27:15,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181697021] [2021-03-11 11:27:15,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 11:27:15,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:15,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 11:27:15,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:27:15,034 INFO L87 Difference]: Start difference. First operand 112 states and 226 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:15,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:15,042 INFO L93 Difference]: Finished difference Result 151 states and 297 transitions. [2021-03-11 11:27:15,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 11:27:15,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-03-11 11:27:15,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:15,043 INFO L225 Difference]: With dead ends: 151 [2021-03-11 11:27:15,043 INFO L226 Difference]: Without dead ends: 113 [2021-03-11 11:27:15,044 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 11:27:15,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-03-11 11:27:15,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2021-03-11 11:27:15,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.9090909090909092) internal successors, (210), 110 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:15,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 210 transitions. [2021-03-11 11:27:15,046 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 210 transitions. Word has length 16 [2021-03-11 11:27:15,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:15,046 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 210 transitions. [2021-03-11 11:27:15,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:15,046 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 210 transitions. [2021-03-11 11:27:15,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-03-11 11:27:15,046 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:15,046 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:15,046 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-11 11:27:15,046 INFO L428 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:15,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:15,048 INFO L82 PathProgramCache]: Analyzing trace with hash -53485598, now seen corresponding path program 1 times [2021-03-11 11:27:15,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:15,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163526582] [2021-03-11 11:27:15,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:15,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:15,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:27:15,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:15,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:27:15,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:15,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 11:27:15,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:15,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:27:15,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:15,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 11:27:15,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:15,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163526582] [2021-03-11 11:27:15,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:15,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 11:27:15,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945634039] [2021-03-11 11:27:15,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 11:27:15,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:15,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 11:27:15,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:27:15,114 INFO L87 Difference]: Start difference. First operand 111 states and 210 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:15,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:15,148 INFO L93 Difference]: Finished difference Result 97 states and 181 transitions. [2021-03-11 11:27:15,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 11:27:15,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-03-11 11:27:15,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:15,149 INFO L225 Difference]: With dead ends: 97 [2021-03-11 11:27:15,149 INFO L226 Difference]: Without dead ends: 47 [2021-03-11 11:27:15,150 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 19.6ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-03-11 11:27:15,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-03-11 11:27:15,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2021-03-11 11:27:15,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 46 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:15,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 80 transitions. [2021-03-11 11:27:15,151 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 80 transitions. Word has length 17 [2021-03-11 11:27:15,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:15,151 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 80 transitions. [2021-03-11 11:27:15,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:15,151 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2021-03-11 11:27:15,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-11 11:27:15,152 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:15,152 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:15,152 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-11 11:27:15,152 INFO L428 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:15,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:15,152 INFO L82 PathProgramCache]: Analyzing trace with hash 923221364, now seen corresponding path program 1 times [2021-03-11 11:27:15,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:15,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612025963] [2021-03-11 11:27:15,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 11:27:15,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:15,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 11:27:15,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:15,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 11:27:15,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:15,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-11 11:27:15,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:15,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:27:15,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 11:27:15,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-11 11:27:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 11:27:15,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612025963] [2021-03-11 11:27:15,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 11:27:15,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 11:27:15,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840349574] [2021-03-11 11:27:15,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 11:27:15,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 11:27:15,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 11:27:15,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:27:15,242 INFO L87 Difference]: Start difference. First operand 47 states and 80 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:15,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-11 11:27:15,269 INFO L93 Difference]: Finished difference Result 61 states and 102 transitions. [2021-03-11 11:27:15,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 11:27:15,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-03-11 11:27:15,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-11 11:27:15,270 INFO L225 Difference]: With dead ends: 61 [2021-03-11 11:27:15,270 INFO L226 Difference]: Without dead ends: 35 [2021-03-11 11:27:15,271 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 27.1ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-11 11:27:15,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-03-11 11:27:15,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-03-11 11:27:15,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 34 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:15,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2021-03-11 11:27:15,273 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 20 [2021-03-11 11:27:15,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-11 11:27:15,273 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2021-03-11 11:27:15,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-11 11:27:15,273 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2021-03-11 11:27:15,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-03-11 11:27:15,274 INFO L511 BasicCegarLoop]: Found error trace [2021-03-11 11:27:15,274 INFO L519 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 11:27:15,274 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-11 11:27:15,274 INFO L428 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 11:27:15,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 11:27:15,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1492832008, now seen corresponding path program 2 times [2021-03-11 11:27:15,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 11:27:15,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116355315] [2021-03-11 11:27:15,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 11:27:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 11:27:15,306 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 11:27:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 11:27:15,335 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 11:27:15,366 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 11:27:15,367 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 11:27:15,367 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-11 11:27:15,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 11:27:15 BasicIcfg [2021-03-11 11:27:15,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 11:27:15,441 INFO L168 Benchmark]: Toolchain (without parser) took 14630.47 ms. Allocated memory was 358.6 MB in the beginning and 625.0 MB in the end (delta: 266.3 MB). Free memory was 321.9 MB in the beginning and 497.8 MB in the end (delta: -175.9 MB). Peak memory consumption was 92.1 MB. Max. memory is 16.0 GB. [2021-03-11 11:27:15,441 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 358.6 MB. Free memory was 340.0 MB in the beginning and 339.9 MB in the end (delta: 75.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 11:27:15,442 INFO L168 Benchmark]: CACSL2BoogieTranslator took 499.37 ms. Allocated memory is still 358.6 MB. Free memory was 321.3 MB in the beginning and 317.3 MB in the end (delta: 3.9 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. [2021-03-11 11:27:15,444 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.32 ms. Allocated memory is still 358.6 MB. Free memory was 317.3 MB in the beginning and 314.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 11:27:15,446 INFO L168 Benchmark]: Boogie Preprocessor took 23.32 ms. Allocated memory is still 358.6 MB. Free memory was 314.2 MB in the beginning and 312.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 11:27:15,446 INFO L168 Benchmark]: RCFGBuilder took 1442.08 ms. Allocated memory is still 358.6 MB. Free memory was 312.1 MB in the beginning and 308.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 176.4 MB. Max. memory is 16.0 GB. [2021-03-11 11:27:15,446 INFO L168 Benchmark]: TraceAbstraction took 12617.93 ms. Allocated memory was 358.6 MB in the beginning and 625.0 MB in the end (delta: 266.3 MB). Free memory was 308.7 MB in the beginning and 497.8 MB in the end (delta: -189.1 MB). Peak memory consumption was 76.2 MB. Max. memory is 16.0 GB. [2021-03-11 11:27:15,453 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 358.6 MB. Free memory was 340.0 MB in the beginning and 339.9 MB in the end (delta: 75.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 499.37 ms. Allocated memory is still 358.6 MB. Free memory was 321.3 MB in the beginning and 317.3 MB in the end (delta: 3.9 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 41.32 ms. Allocated memory is still 358.6 MB. Free memory was 317.3 MB in the beginning and 314.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 23.32 ms. Allocated memory is still 358.6 MB. Free memory was 314.2 MB in the beginning and 312.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1442.08 ms. Allocated memory is still 358.6 MB. Free memory was 312.1 MB in the beginning and 308.7 MB in the end (delta: 3.4 MB). Peak memory consumption was 176.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 12617.93 ms. Allocated memory was 358.6 MB in the beginning and 625.0 MB in the end (delta: 266.3 MB). Free memory was 308.7 MB in the beginning and 497.8 MB in the end (delta: -189.1 MB). Peak memory consumption was 76.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10117.7ms, 103 PlacesBefore, 35 PlacesAfterwards, 95 TransitionsBefore, 25 TransitionsAfterwards, 1578 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 81 TotalNumberOfCompositions, 3952 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1972, positive: 1828, positive conditional: 0, positive unconditional: 1828, negative: 144, negative conditional: 0, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1116, positive: 1067, positive conditional: 0, positive unconditional: 1067, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1116, positive: 1057, positive conditional: 0, positive unconditional: 1057, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 59, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 783, positive: 55, positive conditional: 0, positive unconditional: 55, negative: 727, negative conditional: 0, negative unconditional: 727, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1972, positive: 761, positive conditional: 0, positive unconditional: 761, negative: 95, negative conditional: 0, negative unconditional: 95, unknown: 1116, unknown conditional: 0, unknown unconditional: 1116] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 101, Positive conditional cache size: 0, Positive unconditional cache size: 101, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2498; [L812] FCALL, FORK 0 pthread_create(&t2498, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t2499; [L814] FCALL, FORK 0 pthread_create(&t2499, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2500; [L816] FCALL, FORK 0 pthread_create(&t2500, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L754] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 3 return 0; [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 94 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12459.3ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 17.8ms, AutomataDifference: 640.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 10180.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 329 SDtfs, 308 SDslu, 440 SDs, 0 SdLazy, 272 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 308.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 307.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred in iteration=0, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 164.9ms AutomataMinimizationTime, 15 MinimizatonAttempts, 98 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 42.8ms SsaConstructionTime, 359.5ms SatisfiabilityAnalysisTime, 811.6ms InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 181 ConstructedInterpolants, 0 QuantifiedInterpolants, 1302 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...