/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-10 17:34:58,515 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-10 17:34:58,518 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-10 17:34:58,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-10 17:34:58,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-10 17:34:58,545 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-10 17:34:58,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-10 17:34:58,552 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-10 17:34:58,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-10 17:34:58,558 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-10 17:34:58,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-10 17:34:58,559 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-10 17:34:58,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-10 17:34:58,561 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-10 17:34:58,562 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-10 17:34:58,562 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-10 17:34:58,563 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-10 17:34:58,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-10 17:34:58,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-10 17:34:58,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-10 17:34:58,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-10 17:34:58,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-10 17:34:58,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-10 17:34:58,573 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-10 17:34:58,576 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-10 17:34:58,576 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-10 17:34:58,576 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-10 17:34:58,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-10 17:34:58,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-10 17:34:58,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-10 17:34:58,578 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-10 17:34:58,579 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-10 17:34:58,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-10 17:34:58,580 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-10 17:34:58,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-10 17:34:58,581 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-10 17:34:58,582 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-10 17:34:58,582 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-10 17:34:58,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-10 17:34:58,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-10 17:34:58,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-10 17:34:58,585 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-NoLbe.epf [2021-03-10 17:34:58,614 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-10 17:34:58,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-10 17:34:58,614 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-03-10 17:34:58,614 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-03-10 17:34:58,616 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-10 17:34:58,616 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-10 17:34:58,617 INFO L138 SettingsManager]: * Use SBE=true [2021-03-10 17:34:58,617 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-10 17:34:58,617 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-10 17:34:58,617 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-10 17:34:58,617 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-10 17:34:58,617 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-10 17:34:58,618 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-10 17:34:58,618 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-10 17:34:58,618 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-10 17:34:58,618 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-10 17:34:58,618 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-10 17:34:58,618 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-10 17:34:58,618 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-10 17:34:58,618 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-10 17:34:58,618 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-10 17:34:58,618 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-10 17:34:58,618 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-10 17:34:58,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-10 17:34:58,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-10 17:34:58,619 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-10 17:34:58,619 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-10 17:34:58,619 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-10 17:34:58,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-10 17:34:58,619 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-03-10 17:34:58,619 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-03-10 17:34:58,619 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-10 17:34:58,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-10 17:34:58,864 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-10 17:34:58,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-10 17:34:58,867 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-10 17:34:58,869 INFO L275 PluginConnector]: CDTParser initialized [2021-03-10 17:34:58,870 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i [2021-03-10 17:34:58,913 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c79208ab1/81163044d0a042ada99214f1ab437eb8/FLAG983a67730 [2021-03-10 17:34:59,413 INFO L306 CDTParser]: Found 1 translation units. [2021-03-10 17:34:59,413 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i [2021-03-10 17:34:59,424 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c79208ab1/81163044d0a042ada99214f1ab437eb8/FLAG983a67730 [2021-03-10 17:34:59,647 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c79208ab1/81163044d0a042ada99214f1ab437eb8 [2021-03-10 17:34:59,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-10 17:34:59,652 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-10 17:34:59,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-10 17:34:59,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-10 17:34:59,656 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-10 17:34:59,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.03 05:34:59" (1/1) ... [2021-03-10 17:34:59,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31dee1f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:34:59, skipping insertion in model container [2021-03-10 17:34:59,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.03 05:34:59" (1/1) ... [2021-03-10 17:34:59,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-10 17:34:59,699 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-10 17:34:59,784 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/safe029_rmo.opt.i[949,962] [2021-03-10 17:34:59,935 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-10 17:34:59,939 INFO L203 MainTranslator]: Completed pre-run [2021-03-10 17:34:59,946 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/safe029_rmo.opt.i[949,962] [2021-03-10 17:34:59,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-10 17:35:00,001 INFO L208 MainTranslator]: Completed translation [2021-03-10 17:35:00,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:00 WrapperNode [2021-03-10 17:35:00,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-10 17:35:00,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-10 17:35:00,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-10 17:35:00,002 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-10 17:35:00,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:00" (1/1) ... [2021-03-10 17:35:00,015 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:00" (1/1) ... [2021-03-10 17:35:00,037 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-10 17:35:00,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-10 17:35:00,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-10 17:35:00,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-10 17:35:00,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:00" (1/1) ... [2021-03-10 17:35:00,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:00" (1/1) ... [2021-03-10 17:35:00,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:00" (1/1) ... [2021-03-10 17:35:00,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:00" (1/1) ... [2021-03-10 17:35:00,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:00" (1/1) ... [2021-03-10 17:35:00,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:00" (1/1) ... [2021-03-10 17:35:00,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:00" (1/1) ... [2021-03-10 17:35:00,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-10 17:35:00,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-10 17:35:00,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-10 17:35:00,063 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-10 17:35:00,064 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:00" (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-10 17:35:00,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-10 17:35:00,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-10 17:35:00,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-10 17:35:00,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-10 17:35:00,112 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-10 17:35:00,113 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-10 17:35:00,113 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-10 17:35:00,113 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-10 17:35:00,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-10 17:35:00,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-10 17:35:00,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-10 17:35:00,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-10 17:35:00,115 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-10 17:35:01,325 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-10 17:35:01,325 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-10 17:35:01,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.03 05:35:01 BoogieIcfgContainer [2021-03-10 17:35:01,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-10 17:35:01,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-10 17:35:01,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-10 17:35:01,331 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-10 17:35:01,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.03 05:34:59" (1/3) ... [2021-03-10 17:35:01,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72baac9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.03 05:35:01, skipping insertion in model container [2021-03-10 17:35:01,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.03 05:35:00" (2/3) ... [2021-03-10 17:35:01,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72baac9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.03 05:35:01, skipping insertion in model container [2021-03-10 17:35:01,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.03 05:35:01" (3/3) ... [2021-03-10 17:35:01,332 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_rmo.opt.i [2021-03-10 17:35:01,337 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-03-10 17:35:01,337 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-10 17:35:01,339 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-10 17:35:01,340 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-10 17:35:01,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,362 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,363 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,364 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,364 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,367 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,367 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,367 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,367 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,368 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,368 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,368 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,368 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,372 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,372 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,374 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,374 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,375 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,375 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-10 17:35:01,376 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-10 17:35:01,386 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-10 17:35:01,406 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-10 17:35:01,406 INFO L377 AbstractCegarLoop]: Hoare is true [2021-03-10 17:35:01,406 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-10 17:35:01,406 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-10 17:35:01,407 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-10 17:35:01,407 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-10 17:35:01,407 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-10 17:35:01,407 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-10 17:35:01,415 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 79 transitions, 168 flow [2021-03-10 17:35:01,473 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1793 states, 1789 states have (on average 2.761878144214645) internal successors, (4941), 1792 states have internal predecessors, (4941), 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-10 17:35:01,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 1793 states, 1789 states have (on average 2.761878144214645) internal successors, (4941), 1792 states have internal predecessors, (4941), 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-10 17:35:01,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-03-10 17:35:01,491 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:01,492 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:01,493 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:01,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:01,498 INFO L82 PathProgramCache]: Analyzing trace with hash 34008290, now seen corresponding path program 1 times [2021-03-10 17:35:01,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:01,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532362032] [2021-03-10 17:35:01,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:01,695 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-10 17:35:01,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532362032] [2021-03-10 17:35:01,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:01,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-10 17:35:01,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130831365] [2021-03-10 17:35:01,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-10 17:35:01,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:01,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-10 17:35:01,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-10 17:35:01,714 INFO L87 Difference]: Start difference. First operand has 1793 states, 1789 states have (on average 2.761878144214645) internal successors, (4941), 1792 states have internal predecessors, (4941), 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 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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-10 17:35:01,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:01,779 INFO L93 Difference]: Finished difference Result 1537 states and 4077 transitions. [2021-03-10 17:35:01,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-10 17:35:01,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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 39 [2021-03-10 17:35:01,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:01,795 INFO L225 Difference]: With dead ends: 1537 [2021-03-10 17:35:01,796 INFO L226 Difference]: Without dead ends: 961 [2021-03-10 17:35:01,796 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-10 17:35:01,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2021-03-10 17:35:01,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 961. [2021-03-10 17:35:01,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 960 states have (on average 2.596875) internal successors, (2493), 960 states have internal predecessors, (2493), 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-10 17:35:01,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 2493 transitions. [2021-03-10 17:35:01,862 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 2493 transitions. Word has length 39 [2021-03-10 17:35:01,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:01,863 INFO L480 AbstractCegarLoop]: Abstraction has 961 states and 2493 transitions. [2021-03-10 17:35:01,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 19.5) internal successors, (39), 3 states have internal predecessors, (39), 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-10 17:35:01,863 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 2493 transitions. [2021-03-10 17:35:01,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-03-10 17:35:01,869 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:01,870 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:01,870 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-10 17:35:01,870 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:01,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:01,872 INFO L82 PathProgramCache]: Analyzing trace with hash 74522913, now seen corresponding path program 1 times [2021-03-10 17:35:01,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:01,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731218570] [2021-03-10 17:35:01,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:02,149 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-10 17:35:02,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731218570] [2021-03-10 17:35:02,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:02,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-10 17:35:02,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697315587] [2021-03-10 17:35:02,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-10 17:35:02,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:02,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-10 17:35:02,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-03-10 17:35:02,153 INFO L87 Difference]: Start difference. First operand 961 states and 2493 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 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-10 17:35:02,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:02,406 INFO L93 Difference]: Finished difference Result 1145 states and 2929 transitions. [2021-03-10 17:35:02,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 17:35:02,406 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 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 50 [2021-03-10 17:35:02,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:02,409 INFO L225 Difference]: With dead ends: 1145 [2021-03-10 17:35:02,409 INFO L226 Difference]: Without dead ends: 889 [2021-03-10 17:35:02,410 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 186.9ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2021-03-10 17:35:02,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2021-03-10 17:35:02,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 889. [2021-03-10 17:35:02,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 888 states have (on average 2.564189189189189) internal successors, (2277), 888 states have internal predecessors, (2277), 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-10 17:35:02,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 2277 transitions. [2021-03-10 17:35:02,428 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 2277 transitions. Word has length 50 [2021-03-10 17:35:02,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:02,429 INFO L480 AbstractCegarLoop]: Abstraction has 889 states and 2277 transitions. [2021-03-10 17:35:02,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 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-10 17:35:02,429 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 2277 transitions. [2021-03-10 17:35:02,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-03-10 17:35:02,432 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:02,433 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:02,433 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-10 17:35:02,433 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:02,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:02,433 INFO L82 PathProgramCache]: Analyzing trace with hash -520467644, now seen corresponding path program 1 times [2021-03-10 17:35:02,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:02,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570114696] [2021-03-10 17:35:02,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:02,604 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-10 17:35:02,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570114696] [2021-03-10 17:35:02,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:02,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-10 17:35:02,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948840842] [2021-03-10 17:35:02,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-10 17:35:02,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:02,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-10 17:35:02,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-03-10 17:35:02,605 INFO L87 Difference]: Start difference. First operand 889 states and 2277 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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-10 17:35:02,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:02,829 INFO L93 Difference]: Finished difference Result 991 states and 2513 transitions. [2021-03-10 17:35:02,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 17:35:02,830 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 53 [2021-03-10 17:35:02,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:02,833 INFO L225 Difference]: With dead ends: 991 [2021-03-10 17:35:02,833 INFO L226 Difference]: Without dead ends: 831 [2021-03-10 17:35:02,834 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 152.7ms TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-03-10 17:35:02,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2021-03-10 17:35:02,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 829. [2021-03-10 17:35:02,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 828 states have (on average 2.5471014492753623) internal successors, (2109), 828 states have internal predecessors, (2109), 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-10 17:35:02,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 2109 transitions. [2021-03-10 17:35:02,850 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 2109 transitions. Word has length 53 [2021-03-10 17:35:02,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:02,852 INFO L480 AbstractCegarLoop]: Abstraction has 829 states and 2109 transitions. [2021-03-10 17:35:02,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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-10 17:35:02,852 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 2109 transitions. [2021-03-10 17:35:02,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-03-10 17:35:02,853 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:02,853 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:02,853 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-10 17:35:02,853 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:02,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:02,854 INFO L82 PathProgramCache]: Analyzing trace with hash 2127932930, now seen corresponding path program 1 times [2021-03-10 17:35:02,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:02,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228837561] [2021-03-10 17:35:02,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:02,959 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-10 17:35:02,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228837561] [2021-03-10 17:35:02,959 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:02,959 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-10 17:35:02,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301412954] [2021-03-10 17:35:02,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-10 17:35:02,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:02,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-10 17:35:02,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-10 17:35:02,960 INFO L87 Difference]: Start difference. First operand 829 states and 2109 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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-10 17:35:03,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:03,048 INFO L93 Difference]: Finished difference Result 1415 states and 3560 transitions. [2021-03-10 17:35:03,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 17:35:03,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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 54 [2021-03-10 17:35:03,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:03,052 INFO L225 Difference]: With dead ends: 1415 [2021-03-10 17:35:03,052 INFO L226 Difference]: Without dead ends: 931 [2021-03-10 17:35:03,052 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 76.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:35:03,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2021-03-10 17:35:03,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 781. [2021-03-10 17:35:03,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 780 states have (on average 2.473076923076923) internal successors, (1929), 780 states have internal predecessors, (1929), 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-10 17:35:03,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1929 transitions. [2021-03-10 17:35:03,065 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1929 transitions. Word has length 54 [2021-03-10 17:35:03,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:03,065 INFO L480 AbstractCegarLoop]: Abstraction has 781 states and 1929 transitions. [2021-03-10 17:35:03,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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-10 17:35:03,066 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1929 transitions. [2021-03-10 17:35:03,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-03-10 17:35:03,067 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:03,067 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:03,067 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-10 17:35:03,067 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:03,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:03,068 INFO L82 PathProgramCache]: Analyzing trace with hash 2139498596, now seen corresponding path program 1 times [2021-03-10 17:35:03,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:03,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054899453] [2021-03-10 17:35:03,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:03,234 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-10 17:35:03,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054899453] [2021-03-10 17:35:03,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:03,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-10 17:35:03,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976056262] [2021-03-10 17:35:03,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-10 17:35:03,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:03,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-10 17:35:03,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-03-10 17:35:03,235 INFO L87 Difference]: Start difference. First operand 781 states and 1929 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 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-10 17:35:03,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:03,417 INFO L93 Difference]: Finished difference Result 969 states and 2390 transitions. [2021-03-10 17:35:03,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-10 17:35:03,418 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 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 55 [2021-03-10 17:35:03,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:03,420 INFO L225 Difference]: With dead ends: 969 [2021-03-10 17:35:03,420 INFO L226 Difference]: Without dead ends: 849 [2021-03-10 17:35:03,421 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 135.0ms TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2021-03-10 17:35:03,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2021-03-10 17:35:03,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 791. [2021-03-10 17:35:03,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 790 states have (on average 2.4658227848101264) internal successors, (1948), 790 states have internal predecessors, (1948), 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-10 17:35:03,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1948 transitions. [2021-03-10 17:35:03,433 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1948 transitions. Word has length 55 [2021-03-10 17:35:03,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:03,433 INFO L480 AbstractCegarLoop]: Abstraction has 791 states and 1948 transitions. [2021-03-10 17:35:03,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 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-10 17:35:03,433 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1948 transitions. [2021-03-10 17:35:03,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-03-10 17:35:03,435 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:03,435 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:03,435 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-10 17:35:03,435 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:03,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:03,435 INFO L82 PathProgramCache]: Analyzing trace with hash 226277412, now seen corresponding path program 2 times [2021-03-10 17:35:03,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:03,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667631011] [2021-03-10 17:35:03,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:03,599 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-10 17:35:03,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667631011] [2021-03-10 17:35:03,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:03,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-10 17:35:03,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12860139] [2021-03-10 17:35:03,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-10 17:35:03,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:03,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-10 17:35:03,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-10 17:35:03,600 INFO L87 Difference]: Start difference. First operand 791 states and 1948 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-10 17:35:03,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:03,802 INFO L93 Difference]: Finished difference Result 970 states and 2391 transitions. [2021-03-10 17:35:03,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 17:35:03,802 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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 55 [2021-03-10 17:35:03,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:03,806 INFO L225 Difference]: With dead ends: 970 [2021-03-10 17:35:03,806 INFO L226 Difference]: Without dead ends: 850 [2021-03-10 17:35:03,806 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 129.6ms TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2021-03-10 17:35:03,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2021-03-10 17:35:03,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 789. [2021-03-10 17:35:03,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 2.467005076142132) internal successors, (1944), 788 states have internal predecessors, (1944), 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-10 17:35:03,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1944 transitions. [2021-03-10 17:35:03,846 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1944 transitions. Word has length 55 [2021-03-10 17:35:03,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:03,846 INFO L480 AbstractCegarLoop]: Abstraction has 789 states and 1944 transitions. [2021-03-10 17:35:03,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-10 17:35:03,846 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1944 transitions. [2021-03-10 17:35:03,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-03-10 17:35:03,847 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:03,847 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:03,847 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-10 17:35:03,847 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:03,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:03,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1184104846, now seen corresponding path program 3 times [2021-03-10 17:35:03,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:03,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335115728] [2021-03-10 17:35:03,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:04,023 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-10 17:35:04,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335115728] [2021-03-10 17:35:04,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:04,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-10 17:35:04,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768097968] [2021-03-10 17:35:04,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-10 17:35:04,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:04,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-10 17:35:04,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-03-10 17:35:04,024 INFO L87 Difference]: Start difference. First operand 789 states and 1944 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-10 17:35:04,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:04,250 INFO L93 Difference]: Finished difference Result 969 states and 2386 transitions. [2021-03-10 17:35:04,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-10 17:35:04,250 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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 55 [2021-03-10 17:35:04,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:04,253 INFO L225 Difference]: With dead ends: 969 [2021-03-10 17:35:04,253 INFO L226 Difference]: Without dead ends: 833 [2021-03-10 17:35:04,253 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 143.8ms TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-03-10 17:35:04,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2021-03-10 17:35:04,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 801. [2021-03-10 17:35:04,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 800 states have (on average 2.47125) internal successors, (1977), 800 states have internal predecessors, (1977), 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-10 17:35:04,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1977 transitions. [2021-03-10 17:35:04,266 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1977 transitions. Word has length 55 [2021-03-10 17:35:04,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:04,266 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 1977 transitions. [2021-03-10 17:35:04,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 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-10 17:35:04,266 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1977 transitions. [2021-03-10 17:35:04,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-03-10 17:35:04,267 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:04,267 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:04,268 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-10 17:35:04,268 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:04,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:04,268 INFO L82 PathProgramCache]: Analyzing trace with hash 2096203587, now seen corresponding path program 1 times [2021-03-10 17:35:04,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:04,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011195550] [2021-03-10 17:35:04,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:04,428 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-10 17:35:04,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011195550] [2021-03-10 17:35:04,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:04,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-10 17:35:04,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683437455] [2021-03-10 17:35:04,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-10 17:35:04,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:04,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-10 17:35:04,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-03-10 17:35:04,429 INFO L87 Difference]: Start difference. First operand 801 states and 1977 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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-10 17:35:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:04,660 INFO L93 Difference]: Finished difference Result 1209 states and 2924 transitions. [2021-03-10 17:35:04,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-10 17:35:04,660 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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 56 [2021-03-10 17:35:04,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:04,663 INFO L225 Difference]: With dead ends: 1209 [2021-03-10 17:35:04,663 INFO L226 Difference]: Without dead ends: 1063 [2021-03-10 17:35:04,664 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 175.6ms TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2021-03-10 17:35:04,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2021-03-10 17:35:04,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 801. [2021-03-10 17:35:04,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 800 states have (on average 2.425) internal successors, (1940), 800 states have internal predecessors, (1940), 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-10 17:35:04,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1940 transitions. [2021-03-10 17:35:04,681 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1940 transitions. Word has length 56 [2021-03-10 17:35:04,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:04,681 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 1940 transitions. [2021-03-10 17:35:04,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 12 states have internal predecessors, (56), 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-10 17:35:04,681 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1940 transitions. [2021-03-10 17:35:04,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-03-10 17:35:04,682 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:04,682 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:04,682 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-10 17:35:04,682 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:04,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:04,683 INFO L82 PathProgramCache]: Analyzing trace with hash 182982403, now seen corresponding path program 2 times [2021-03-10 17:35:04,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:04,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397851804] [2021-03-10 17:35:04,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:04,891 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-10 17:35:04,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397851804] [2021-03-10 17:35:04,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:04,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-03-10 17:35:04,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344251524] [2021-03-10 17:35:04,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-03-10 17:35:04,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:04,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-03-10 17:35:04,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2021-03-10 17:35:04,893 INFO L87 Difference]: Start difference. First operand 801 states and 1940 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 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-10 17:35:05,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:05,135 INFO L93 Difference]: Finished difference Result 902 states and 2172 transitions. [2021-03-10 17:35:05,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-03-10 17:35:05,135 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 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 56 [2021-03-10 17:35:05,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:05,137 INFO L225 Difference]: With dead ends: 902 [2021-03-10 17:35:05,137 INFO L226 Difference]: Without dead ends: 701 [2021-03-10 17:35:05,138 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 254.1ms TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2021-03-10 17:35:05,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2021-03-10 17:35:05,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2021-03-10 17:35:05,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 700 states have (on average 2.4385714285714286) internal successors, (1707), 700 states have internal predecessors, (1707), 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-10 17:35:05,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1707 transitions. [2021-03-10 17:35:05,147 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1707 transitions. Word has length 56 [2021-03-10 17:35:05,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:05,148 INFO L480 AbstractCegarLoop]: Abstraction has 701 states and 1707 transitions. [2021-03-10 17:35:05,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 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-10 17:35:05,148 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1707 transitions. [2021-03-10 17:35:05,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-03-10 17:35:05,148 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:05,149 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:05,149 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-10 17:35:05,149 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:05,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:05,149 INFO L82 PathProgramCache]: Analyzing trace with hash -628822589, now seen corresponding path program 3 times [2021-03-10 17:35:05,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:05,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035447404] [2021-03-10 17:35:05,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:05,300 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-10 17:35:05,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035447404] [2021-03-10 17:35:05,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:05,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-03-10 17:35:05,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496067841] [2021-03-10 17:35:05,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-10 17:35:05,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:05,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-10 17:35:05,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-03-10 17:35:05,301 INFO L87 Difference]: Start difference. First operand 701 states and 1707 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 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-10 17:35:05,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:05,519 INFO L93 Difference]: Finished difference Result 1061 states and 2557 transitions. [2021-03-10 17:35:05,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-03-10 17:35:05,527 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 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 56 [2021-03-10 17:35:05,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:05,529 INFO L225 Difference]: With dead ends: 1061 [2021-03-10 17:35:05,529 INFO L226 Difference]: Without dead ends: 673 [2021-03-10 17:35:05,530 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 189.2ms TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2021-03-10 17:35:05,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2021-03-10 17:35:05,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 553. [2021-03-10 17:35:05,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 552 states have (on average 2.3822463768115942) internal successors, (1315), 552 states have internal predecessors, (1315), 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-10 17:35:05,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 1315 transitions. [2021-03-10 17:35:05,539 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 1315 transitions. Word has length 56 [2021-03-10 17:35:05,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:05,539 INFO L480 AbstractCegarLoop]: Abstraction has 553 states and 1315 transitions. [2021-03-10 17:35:05,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 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-10 17:35:05,539 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 1315 transitions. [2021-03-10 17:35:05,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-03-10 17:35:05,540 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:05,540 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:05,540 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-10 17:35:05,540 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:05,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:05,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1162271869, now seen corresponding path program 1 times [2021-03-10 17:35:05,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:05,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67841518] [2021-03-10 17:35:05,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:05,622 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-10 17:35:05,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67841518] [2021-03-10 17:35:05,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:05,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-10 17:35:05,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703397279] [2021-03-10 17:35:05,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-10 17:35:05,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:05,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-10 17:35:05,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-10 17:35:05,624 INFO L87 Difference]: Start difference. First operand 553 states and 1315 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-10 17:35:05,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:05,690 INFO L93 Difference]: Finished difference Result 623 states and 1439 transitions. [2021-03-10 17:35:05,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-10 17:35:05,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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 56 [2021-03-10 17:35:05,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:05,692 INFO L225 Difference]: With dead ends: 623 [2021-03-10 17:35:05,692 INFO L226 Difference]: Without dead ends: 439 [2021-03-10 17:35:05,692 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 65.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-03-10 17:35:05,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2021-03-10 17:35:05,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2021-03-10 17:35:05,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 2.276255707762557) internal successors, (997), 438 states have internal predecessors, (997), 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-10 17:35:05,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 997 transitions. [2021-03-10 17:35:05,698 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 997 transitions. Word has length 56 [2021-03-10 17:35:05,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:05,698 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 997 transitions. [2021-03-10 17:35:05,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-10 17:35:05,698 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 997 transitions. [2021-03-10 17:35:05,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-03-10 17:35:05,702 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:05,702 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:05,702 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-10 17:35:05,702 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:05,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:05,702 INFO L82 PathProgramCache]: Analyzing trace with hash 680883867, now seen corresponding path program 1 times [2021-03-10 17:35:05,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:05,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391943246] [2021-03-10 17:35:05,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-10 17:35:05,758 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-10 17:35:05,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391943246] [2021-03-10 17:35:05,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-10 17:35:05,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-10 17:35:05,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515433481] [2021-03-10 17:35:05,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-10 17:35:05,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-10 17:35:05,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-10 17:35:05,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-10 17:35:05,759 INFO L87 Difference]: Start difference. First operand 439 states and 997 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-10 17:35:05,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-03-10 17:35:05,833 INFO L93 Difference]: Finished difference Result 361 states and 774 transitions. [2021-03-10 17:35:05,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-10 17:35:05,833 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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 57 [2021-03-10 17:35:05,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-03-10 17:35:05,834 INFO L225 Difference]: With dead ends: 361 [2021-03-10 17:35:05,834 INFO L226 Difference]: Without dead ends: 217 [2021-03-10 17:35:05,834 INFO L775 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 70.3ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-03-10 17:35:05,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-03-10 17:35:05,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2021-03-10 17:35:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 2.013888888888889) internal successors, (435), 216 states have internal predecessors, (435), 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-10 17:35:05,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 435 transitions. [2021-03-10 17:35:05,837 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 435 transitions. Word has length 57 [2021-03-10 17:35:05,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-03-10 17:35:05,837 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 435 transitions. [2021-03-10 17:35:05,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-10 17:35:05,838 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 435 transitions. [2021-03-10 17:35:05,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-03-10 17:35:05,839 INFO L511 BasicCegarLoop]: Found error trace [2021-03-10 17:35:05,839 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-10 17:35:05,840 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-10 17:35:05,840 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-10 17:35:05,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-10 17:35:05,840 INFO L82 PathProgramCache]: Analyzing trace with hash 759548348, now seen corresponding path program 1 times [2021-03-10 17:35:05,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-10 17:35:05,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798710147] [2021-03-10 17:35:05,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-10 17:35:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-10 17:35:05,872 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-10 17:35:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-10 17:35:05,894 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-10 17:35:05,923 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-10 17:35:05,923 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-10 17:35:05,923 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-10 17:35:06,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.03 05:35:06 BasicIcfg [2021-03-10 17:35:06,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-10 17:35:06,004 INFO L168 Benchmark]: Toolchain (without parser) took 6353.31 ms. Allocated memory was 402.7 MB in the beginning and 497.0 MB in the end (delta: 94.4 MB). Free memory was 366.1 MB in the beginning and 208.7 MB in the end (delta: 157.4 MB). Peak memory consumption was 254.4 MB. Max. memory is 16.0 GB. [2021-03-10 17:35:06,004 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 402.7 MB. Free memory is still 383.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-10 17:35:06,004 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.98 ms. Allocated memory is still 402.7 MB. Free memory was 365.6 MB in the beginning and 362.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.0 GB. [2021-03-10 17:35:06,004 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.48 ms. Allocated memory is still 402.7 MB. Free memory was 362.2 MB in the beginning and 360.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-10 17:35:06,004 INFO L168 Benchmark]: Boogie Preprocessor took 24.23 ms. Allocated memory is still 402.7 MB. Free memory was 360.1 MB in the beginning and 358.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-10 17:35:06,004 INFO L168 Benchmark]: RCFGBuilder took 1264.71 ms. Allocated memory is still 402.7 MB. Free memory was 358.0 MB in the beginning and 347.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 169.9 MB. Max. memory is 16.0 GB. [2021-03-10 17:35:06,004 INFO L168 Benchmark]: TraceAbstraction took 4674.22 ms. Allocated memory was 402.7 MB in the beginning and 497.0 MB in the end (delta: 94.4 MB). Free memory was 347.5 MB in the beginning and 208.7 MB in the end (delta: 138.8 MB). Peak memory consumption was 234.2 MB. Max. memory is 16.0 GB. [2021-03-10 17:35:06,005 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.12 ms. Allocated memory is still 402.7 MB. Free memory is still 383.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 347.98 ms. Allocated memory is still 402.7 MB. Free memory was 365.6 MB in the beginning and 362.2 MB in the end (delta: 3.3 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 35.48 ms. Allocated memory is still 402.7 MB. Free memory was 362.2 MB in the beginning and 360.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 24.23 ms. Allocated memory is still 402.7 MB. Free memory was 360.1 MB in the beginning and 358.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1264.71 ms. Allocated memory is still 402.7 MB. Free memory was 358.0 MB in the beginning and 347.5 MB in the end (delta: 10.5 MB). Peak memory consumption was 169.9 MB. Max. memory is 16.0 GB. * TraceAbstraction took 4674.22 ms. Allocated memory was 402.7 MB in the beginning and 497.0 MB in the end (delta: 94.4 MB). Free memory was 347.5 MB in the beginning and 208.7 MB in the end (delta: 138.8 MB). Peak memory consumption was 234.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L713] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L714] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L715] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L716] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L717] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L718] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L719] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L720] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L721] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L722] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L723] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L724] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L725] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L726] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L790] 0 pthread_t t2483; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L791] FCALL, FORK 0 pthread_create(&t2483, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] 0 pthread_t t2484; 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L793] FCALL, FORK 0 pthread_create(&t2484, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 y = 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 y = 2 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = 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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4518.9ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 40.1ms, AutomataDifference: 2149.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 66.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1139 SDtfs, 1698 SDslu, 4539 SDs, 0 SdLazy, 907 SolverSat, 213 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 825.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1585.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1793occurred in iteration=0, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 214.1ms AutomataMinimizationTime, 12 MinimizatonAttempts, 685 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 37.3ms SsaConstructionTime, 391.7ms SatisfiabilityAnalysisTime, 1410.6ms InterpolantComputationTime, 702 NumberOfCodeBlocks, 702 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 630 ConstructedInterpolants, 0 QuantifiedInterpolants, 3648 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...