/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 20:04:30,552 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 20:04:30,554 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 20:04:30,598 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 20:04:30,599 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 20:04:30,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 20:04:30,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 20:04:30,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 20:04:30,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 20:04:30,624 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 20:04:30,625 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 20:04:30,626 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 20:04:30,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 20:04:30,628 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 20:04:30,629 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 20:04:30,631 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 20:04:30,632 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 20:04:30,632 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 20:04:30,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 20:04:30,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 20:04:30,638 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 20:04:30,639 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 20:04:30,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 20:04:30,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 20:04:30,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 20:04:30,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 20:04:30,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 20:04:30,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 20:04:30,647 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 20:04:30,648 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 20:04:30,648 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 20:04:30,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 20:04:30,650 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 20:04:30,650 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 20:04:30,651 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 20:04:30,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 20:04:30,652 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 20:04:30,652 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 20:04:30,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 20:04:30,654 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 20:04:30,654 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 20:04:30,655 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 20:04:30,679 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 20:04:30,679 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 20:04:30,680 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 20:04:30,680 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 20:04:30,681 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 20:04:30,681 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 20:04:30,681 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 20:04:30,681 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 20:04:30,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 20:04:30,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 20:04:30,682 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 20:04:30,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 20:04:30,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 20:04:30,682 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 20:04:30,682 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 20:04:30,682 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 20:04:30,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 20:04:30,682 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 20:04:30,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 20:04:30,682 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 20:04:30,682 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 20:04:30,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:04:30,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 20:04:30,683 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 20:04:30,683 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 20:04:30,683 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 20:04:30,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 20:04:30,683 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 20:04:30,683 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 20:04:30,683 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 20:04:30,683 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 20:04:30,683 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 20:04:30,684 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 20:04:30,684 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 20:04:30,868 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 20:04:30,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 20:04:30,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 20:04:30,887 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 20:04:30,888 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 20:04:30,888 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c [2022-01-10 20:04:30,948 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0df63663f/dd925caa410b47de9f9489fc4badb818/FLAGf5ac20a1b [2022-01-10 20:04:31,280 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 20:04:31,281 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c [2022-01-10 20:04:31,289 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0df63663f/dd925caa410b47de9f9489fc4badb818/FLAGf5ac20a1b [2022-01-10 20:04:31,696 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0df63663f/dd925caa410b47de9f9489fc4badb818 [2022-01-10 20:04:31,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 20:04:31,701 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 20:04:31,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 20:04:31,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 20:04:31,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 20:04:31,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:04:31" (1/1) ... [2022-01-10 20:04:31,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28b9d63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:04:31, skipping insertion in model container [2022-01-10 20:04:31,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:04:31" (1/1) ... [2022-01-10 20:04:31,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 20:04:31,772 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 20:04:31,952 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c[911,924] [2022-01-10 20:04:32,019 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c[8416,8429] [2022-01-10 20:04:32,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:04:32,055 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 20:04:32,064 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c[911,924] [2022-01-10 20:04:32,090 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.01.cil-2.c[8416,8429] [2022-01-10 20:04:32,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:04:32,126 INFO L208 MainTranslator]: Completed translation [2022-01-10 20:04:32,127 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:04:32 WrapperNode [2022-01-10 20:04:32,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 20:04:32,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 20:04:32,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 20:04:32,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 20:04:32,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:04:32" (1/1) ... [2022-01-10 20:04:32,152 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:04:32" (1/1) ... [2022-01-10 20:04:32,193 INFO L137 Inliner]: procedures = 58, calls = 65, calls flagged for inlining = 60, calls inlined = 72, statements flattened = 821 [2022-01-10 20:04:32,194 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 20:04:32,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 20:04:32,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 20:04:32,195 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 20:04:32,201 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:04:32" (1/1) ... [2022-01-10 20:04:32,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:04:32" (1/1) ... [2022-01-10 20:04:32,214 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:04:32" (1/1) ... [2022-01-10 20:04:32,214 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:04:32" (1/1) ... [2022-01-10 20:04:32,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:04:32" (1/1) ... [2022-01-10 20:04:32,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:04:32" (1/1) ... [2022-01-10 20:04:32,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:04:32" (1/1) ... [2022-01-10 20:04:32,243 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 20:04:32,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 20:04:32,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 20:04:32,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 20:04:32,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:04:32" (1/1) ... [2022-01-10 20:04:32,262 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:04:32,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:04:32,288 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 20:04:32,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 20:04:32,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 20:04:32,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 20:04:32,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 20:04:32,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 20:04:32,389 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 20:04:32,404 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 20:04:32,811 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##107: assume !(1bv32 == ~q_free~0); [2022-01-10 20:04:32,811 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume 1bv32 == ~q_free~0;~c_dr_st~0 := 2bv32;~c_dr_pc~0 := 2bv32;~a_t~0 := do_read_c_~a~0#1; [2022-01-10 20:04:32,812 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 20:04:32,817 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 20:04:32,818 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-01-10 20:04:32,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:04:32 BoogieIcfgContainer [2022-01-10 20:04:32,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 20:04:32,819 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 20:04:32,820 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 20:04:32,820 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 20:04:32,822 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:04:32" (1/1) ... [2022-01-10 20:04:32,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:04:32 BasicIcfg [2022-01-10 20:04:32,963 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 20:04:32,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 20:04:32,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 20:04:32,966 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 20:04:32,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 08:04:31" (1/4) ... [2022-01-10 20:04:32,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed3c3da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:04:32, skipping insertion in model container [2022-01-10 20:04:32,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:04:32" (2/4) ... [2022-01-10 20:04:32,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed3c3da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:04:32, skipping insertion in model container [2022-01-10 20:04:32,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:04:32" (3/4) ... [2022-01-10 20:04:32,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ed3c3da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:04:32, skipping insertion in model container [2022-01-10 20:04:32,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:04:32" (4/4) ... [2022-01-10 20:04:32,968 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.01.cil-2.cTransformedIcfg [2022-01-10 20:04:32,971 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 20:04:32,971 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-01-10 20:04:32,998 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 20:04:33,002 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 20:04:33,002 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-10 20:04:33,017 INFO L276 IsEmpty]: Start isEmpty. Operand has 303 states, 298 states have (on average 1.563758389261745) internal successors, (466), 302 states have internal predecessors, (466), 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) [2022-01-10 20:04:33,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 20:04:33,023 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:33,024 INFO L514 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] [2022-01-10 20:04:33,024 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:33,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:33,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1421582439, now seen corresponding path program 1 times [2022-01-10 20:04:33,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:33,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193844484] [2022-01-10 20:04:33,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:33,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:33,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:33,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:33,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193844484] [2022-01-10 20:04:33,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193844484] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:33,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:33,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:04:33,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307443760] [2022-01-10 20:04:33,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:33,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:33,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:33,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:33,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:33,210 INFO L87 Difference]: Start difference. First operand has 303 states, 298 states have (on average 1.563758389261745) internal successors, (466), 302 states have internal predecessors, (466), 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, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) [2022-01-10 20:04:33,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:33,285 INFO L93 Difference]: Finished difference Result 565 states and 869 transitions. [2022-01-10 20:04:33,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:33,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 44 [2022-01-10 20:04:33,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:33,308 INFO L225 Difference]: With dead ends: 565 [2022-01-10 20:04:33,309 INFO L226 Difference]: Without dead ends: 292 [2022-01-10 20:04:33,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:33,313 INFO L933 BasicCegarLoop]: 440 mSDtfsCounter, 205 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:33,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 673 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:33,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-01-10 20:04:33,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2022-01-10 20:04:33,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 288 states have (on average 1.5034722222222223) internal successors, (433), 291 states have internal predecessors, (433), 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) [2022-01-10 20:04:33,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 433 transitions. [2022-01-10 20:04:33,376 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 433 transitions. Word has length 44 [2022-01-10 20:04:33,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:33,376 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 433 transitions. [2022-01-10 20:04:33,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) [2022-01-10 20:04:33,377 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 433 transitions. [2022-01-10 20:04:33,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 20:04:33,383 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:33,383 INFO L514 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] [2022-01-10 20:04:33,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 20:04:33,383 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:33,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:33,389 INFO L85 PathProgramCache]: Analyzing trace with hash -211221560, now seen corresponding path program 1 times [2022-01-10 20:04:33,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:33,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833569017] [2022-01-10 20:04:33,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:33,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:33,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:33,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:33,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833569017] [2022-01-10 20:04:33,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833569017] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:33,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:33,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:04:33,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456288998] [2022-01-10 20:04:33,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:33,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:33,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:33,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:33,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:33,476 INFO L87 Difference]: Start difference. First operand 292 states and 433 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) [2022-01-10 20:04:33,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:33,574 INFO L93 Difference]: Finished difference Result 550 states and 818 transitions. [2022-01-10 20:04:33,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:33,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 44 [2022-01-10 20:04:33,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:33,576 INFO L225 Difference]: With dead ends: 550 [2022-01-10 20:04:33,576 INFO L226 Difference]: Without dead ends: 425 [2022-01-10 20:04:33,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:33,578 INFO L933 BasicCegarLoop]: 427 mSDtfsCounter, 179 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:33,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 822 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:04:33,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-01-10 20:04:33,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 421. [2022-01-10 20:04:33,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 417 states have (on average 1.474820143884892) internal successors, (615), 420 states have internal predecessors, (615), 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) [2022-01-10 20:04:33,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 615 transitions. [2022-01-10 20:04:33,596 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 615 transitions. Word has length 44 [2022-01-10 20:04:33,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:33,596 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 615 transitions. [2022-01-10 20:04:33,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) [2022-01-10 20:04:33,597 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 615 transitions. [2022-01-10 20:04:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 20:04:33,598 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:33,598 INFO L514 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] [2022-01-10 20:04:33,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 20:04:33,598 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:33,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:33,599 INFO L85 PathProgramCache]: Analyzing trace with hash 260963241, now seen corresponding path program 1 times [2022-01-10 20:04:33,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:33,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135869375] [2022-01-10 20:04:33,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:33,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:33,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:33,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:33,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135869375] [2022-01-10 20:04:33,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135869375] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:33,673 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:33,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:04:33,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370065109] [2022-01-10 20:04:33,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:33,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:33,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:33,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:33,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:33,675 INFO L87 Difference]: Start difference. First operand 421 states and 615 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) [2022-01-10 20:04:33,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:33,713 INFO L93 Difference]: Finished difference Result 839 states and 1220 transitions. [2022-01-10 20:04:33,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:33,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 44 [2022-01-10 20:04:33,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:33,716 INFO L225 Difference]: With dead ends: 839 [2022-01-10 20:04:33,716 INFO L226 Difference]: Without dead ends: 599 [2022-01-10 20:04:33,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:33,717 INFO L933 BasicCegarLoop]: 420 mSDtfsCounter, 394 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:33,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [394 Valid, 555 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:33,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-01-10 20:04:33,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 591. [2022-01-10 20:04:33,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 587 states have (on average 1.4480408858603067) internal successors, (850), 590 states have internal predecessors, (850), 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) [2022-01-10 20:04:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 850 transitions. [2022-01-10 20:04:33,735 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 850 transitions. Word has length 44 [2022-01-10 20:04:33,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:33,735 INFO L470 AbstractCegarLoop]: Abstraction has 591 states and 850 transitions. [2022-01-10 20:04:33,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) [2022-01-10 20:04:33,735 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 850 transitions. [2022-01-10 20:04:33,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 20:04:33,736 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:33,736 INFO L514 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] [2022-01-10 20:04:33,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 20:04:33,737 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:33,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:33,737 INFO L85 PathProgramCache]: Analyzing trace with hash 941423973, now seen corresponding path program 1 times [2022-01-10 20:04:33,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:33,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802018120] [2022-01-10 20:04:33,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:33,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:33,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:33,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:33,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802018120] [2022-01-10 20:04:33,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802018120] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:33,789 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:33,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:04:33,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800057993] [2022-01-10 20:04:33,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:33,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:33,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:33,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:33,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:33,791 INFO L87 Difference]: Start difference. First operand 591 states and 850 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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) [2022-01-10 20:04:33,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:33,823 INFO L93 Difference]: Finished difference Result 846 states and 1225 transitions. [2022-01-10 20:04:33,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:33,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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 44 [2022-01-10 20:04:33,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:33,827 INFO L225 Difference]: With dead ends: 846 [2022-01-10 20:04:33,827 INFO L226 Difference]: Without dead ends: 699 [2022-01-10 20:04:33,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:33,836 INFO L933 BasicCegarLoop]: 421 mSDtfsCounter, 391 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:33,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [391 Valid, 595 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:33,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-01-10 20:04:33,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 695. [2022-01-10 20:04:33,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 691 states have (on average 1.4500723589001447) internal successors, (1002), 694 states have internal predecessors, (1002), 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) [2022-01-10 20:04:33,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1002 transitions. [2022-01-10 20:04:33,859 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1002 transitions. Word has length 44 [2022-01-10 20:04:33,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:33,859 INFO L470 AbstractCegarLoop]: Abstraction has 695 states and 1002 transitions. [2022-01-10 20:04:33,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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) [2022-01-10 20:04:33,859 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1002 transitions. [2022-01-10 20:04:33,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 20:04:33,860 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:33,860 INFO L514 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] [2022-01-10 20:04:33,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 20:04:33,860 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:33,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:33,862 INFO L85 PathProgramCache]: Analyzing trace with hash 2047252357, now seen corresponding path program 1 times [2022-01-10 20:04:33,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:33,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934768667] [2022-01-10 20:04:33,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:33,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:33,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:33,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:33,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934768667] [2022-01-10 20:04:33,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934768667] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:33,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:33,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:04:33,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975548401] [2022-01-10 20:04:33,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:33,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:33,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:33,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:33,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:33,925 INFO L87 Difference]: Start difference. First operand 695 states and 1002 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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) [2022-01-10 20:04:33,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:33,955 INFO L93 Difference]: Finished difference Result 945 states and 1370 transitions. [2022-01-10 20:04:33,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:33,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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 44 [2022-01-10 20:04:33,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:33,959 INFO L225 Difference]: With dead ends: 945 [2022-01-10 20:04:33,959 INFO L226 Difference]: Without dead ends: 695 [2022-01-10 20:04:33,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:33,963 INFO L933 BasicCegarLoop]: 415 mSDtfsCounter, 411 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:33,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 415 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:33,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-01-10 20:04:33,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 695. [2022-01-10 20:04:33,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 691 states have (on average 1.4384949348769898) internal successors, (994), 694 states have internal predecessors, (994), 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) [2022-01-10 20:04:33,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 994 transitions. [2022-01-10 20:04:33,992 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 994 transitions. Word has length 44 [2022-01-10 20:04:33,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:33,997 INFO L470 AbstractCegarLoop]: Abstraction has 695 states and 994 transitions. [2022-01-10 20:04:33,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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) [2022-01-10 20:04:33,997 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 994 transitions. [2022-01-10 20:04:33,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 20:04:33,998 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:33,998 INFO L514 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] [2022-01-10 20:04:33,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 20:04:33,999 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:33,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:34,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1519306395, now seen corresponding path program 1 times [2022-01-10 20:04:34,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:34,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44527455] [2022-01-10 20:04:34,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:34,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:34,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:34,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:34,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:34,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44527455] [2022-01-10 20:04:34,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44527455] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:34,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:34,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:04:34,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719496578] [2022-01-10 20:04:34,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:34,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:34,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:34,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:34,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:34,050 INFO L87 Difference]: Start difference. First operand 695 states and 994 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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) [2022-01-10 20:04:34,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:34,090 INFO L93 Difference]: Finished difference Result 944 states and 1353 transitions. [2022-01-10 20:04:34,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:34,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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 44 [2022-01-10 20:04:34,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:34,093 INFO L225 Difference]: With dead ends: 944 [2022-01-10 20:04:34,093 INFO L226 Difference]: Without dead ends: 695 [2022-01-10 20:04:34,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:34,095 INFO L933 BasicCegarLoop]: 402 mSDtfsCounter, 379 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:34,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 420 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:34,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-01-10 20:04:34,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 695. [2022-01-10 20:04:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 691 states have (on average 1.4182344428364688) internal successors, (980), 694 states have internal predecessors, (980), 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) [2022-01-10 20:04:34,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 980 transitions. [2022-01-10 20:04:34,141 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 980 transitions. Word has length 44 [2022-01-10 20:04:34,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:34,141 INFO L470 AbstractCegarLoop]: Abstraction has 695 states and 980 transitions. [2022-01-10 20:04:34,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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) [2022-01-10 20:04:34,141 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 980 transitions. [2022-01-10 20:04:34,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 20:04:34,142 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:34,142 INFO L514 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] [2022-01-10 20:04:34,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 20:04:34,142 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:34,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:34,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1232927492, now seen corresponding path program 1 times [2022-01-10 20:04:34,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:34,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713786565] [2022-01-10 20:04:34,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:34,143 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:34,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:34,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:34,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713786565] [2022-01-10 20:04:34,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713786565] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:34,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:34,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:04:34,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576057071] [2022-01-10 20:04:34,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:34,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:34,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:34,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:34,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:34,186 INFO L87 Difference]: Start difference. First operand 695 states and 980 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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) [2022-01-10 20:04:34,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:34,222 INFO L93 Difference]: Finished difference Result 943 states and 1324 transitions. [2022-01-10 20:04:34,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:34,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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 44 [2022-01-10 20:04:34,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:34,225 INFO L225 Difference]: With dead ends: 943 [2022-01-10 20:04:34,225 INFO L226 Difference]: Without dead ends: 695 [2022-01-10 20:04:34,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:34,226 INFO L933 BasicCegarLoop]: 393 mSDtfsCounter, 370 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:34,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 410 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:34,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-01-10 20:04:34,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 695. [2022-01-10 20:04:34,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 691 states have (on average 1.3979739507959479) internal successors, (966), 694 states have internal predecessors, (966), 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) [2022-01-10 20:04:34,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 966 transitions. [2022-01-10 20:04:34,255 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 966 transitions. Word has length 44 [2022-01-10 20:04:34,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:34,256 INFO L470 AbstractCegarLoop]: Abstraction has 695 states and 966 transitions. [2022-01-10 20:04:34,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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) [2022-01-10 20:04:34,256 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 966 transitions. [2022-01-10 20:04:34,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 20:04:34,256 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:34,256 INFO L514 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] [2022-01-10 20:04:34,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 20:04:34,257 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:34,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:34,257 INFO L85 PathProgramCache]: Analyzing trace with hash 622460835, now seen corresponding path program 1 times [2022-01-10 20:04:34,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:34,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24460690] [2022-01-10 20:04:34,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:34,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:34,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:34,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:34,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24460690] [2022-01-10 20:04:34,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24460690] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:34,314 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:34,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:04:34,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244205990] [2022-01-10 20:04:34,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:34,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:04:34,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:34,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:04:34,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:04:34,315 INFO L87 Difference]: Start difference. First operand 695 states and 966 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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) [2022-01-10 20:04:34,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:34,391 INFO L93 Difference]: Finished difference Result 1122 states and 1550 transitions. [2022-01-10 20:04:34,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:04:34,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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 44 [2022-01-10 20:04:34,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:34,394 INFO L225 Difference]: With dead ends: 1122 [2022-01-10 20:04:34,394 INFO L226 Difference]: Without dead ends: 881 [2022-01-10 20:04:34,395 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:04:34,396 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 512 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:34,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [512 Valid, 1417 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:34,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2022-01-10 20:04:34,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 701. [2022-01-10 20:04:34,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 697 states have (on average 1.3859397417503587) internal successors, (966), 700 states have internal predecessors, (966), 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) [2022-01-10 20:04:34,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 966 transitions. [2022-01-10 20:04:34,429 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 966 transitions. Word has length 44 [2022-01-10 20:04:34,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:34,429 INFO L470 AbstractCegarLoop]: Abstraction has 701 states and 966 transitions. [2022-01-10 20:04:34,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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) [2022-01-10 20:04:34,429 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 966 transitions. [2022-01-10 20:04:34,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 20:04:34,430 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:34,430 INFO L514 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] [2022-01-10 20:04:34,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 20:04:34,430 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:34,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:34,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1584074852, now seen corresponding path program 1 times [2022-01-10 20:04:34,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:34,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668886706] [2022-01-10 20:04:34,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:34,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:34,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:34,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:34,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668886706] [2022-01-10 20:04:34,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668886706] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:34,475 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:34,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:04:34,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64350658] [2022-01-10 20:04:34,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:34,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:34,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:34,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:34,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:34,477 INFO L87 Difference]: Start difference. First operand 701 states and 966 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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) [2022-01-10 20:04:34,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:34,536 INFO L93 Difference]: Finished difference Result 1153 states and 1552 transitions. [2022-01-10 20:04:34,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:34,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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 44 [2022-01-10 20:04:34,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:34,539 INFO L225 Difference]: With dead ends: 1153 [2022-01-10 20:04:34,539 INFO L226 Difference]: Without dead ends: 901 [2022-01-10 20:04:34,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:34,541 INFO L933 BasicCegarLoop]: 390 mSDtfsCounter, 327 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:34,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 540 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:34,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2022-01-10 20:04:34,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 875. [2022-01-10 20:04:34,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 871 states have (on average 1.357060849598163) internal successors, (1182), 874 states have internal predecessors, (1182), 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) [2022-01-10 20:04:34,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1182 transitions. [2022-01-10 20:04:34,581 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1182 transitions. Word has length 44 [2022-01-10 20:04:34,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:34,585 INFO L470 AbstractCegarLoop]: Abstraction has 875 states and 1182 transitions. [2022-01-10 20:04:34,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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) [2022-01-10 20:04:34,585 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1182 transitions. [2022-01-10 20:04:34,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 20:04:34,585 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:34,585 INFO L514 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] [2022-01-10 20:04:34,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 20:04:34,586 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:34,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:34,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1230249883, now seen corresponding path program 1 times [2022-01-10 20:04:34,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:34,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724761341] [2022-01-10 20:04:34,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:34,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:34,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:34,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:34,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724761341] [2022-01-10 20:04:34,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724761341] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:34,618 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:34,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:04:34,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759987327] [2022-01-10 20:04:34,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:34,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:34,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:34,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:34,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:34,619 INFO L87 Difference]: Start difference. First operand 875 states and 1182 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2022-01-10 20:04:34,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:34,686 INFO L93 Difference]: Finished difference Result 1597 states and 2216 transitions. [2022-01-10 20:04:34,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:34,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 45 [2022-01-10 20:04:34,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:34,690 INFO L225 Difference]: With dead ends: 1597 [2022-01-10 20:04:34,690 INFO L226 Difference]: Without dead ends: 1201 [2022-01-10 20:04:34,691 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:34,691 INFO L933 BasicCegarLoop]: 383 mSDtfsCounter, 347 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:34,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 521 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:34,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2022-01-10 20:04:34,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 1193. [2022-01-10 20:04:34,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 1189 states have (on average 1.3582842724978974) internal successors, (1615), 1192 states have internal predecessors, (1615), 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) [2022-01-10 20:04:34,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1615 transitions. [2022-01-10 20:04:34,745 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1615 transitions. Word has length 45 [2022-01-10 20:04:34,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:34,745 INFO L470 AbstractCegarLoop]: Abstraction has 1193 states and 1615 transitions. [2022-01-10 20:04:34,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) [2022-01-10 20:04:34,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1615 transitions. [2022-01-10 20:04:34,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-10 20:04:34,746 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:34,746 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:04:34,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 20:04:34,747 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:34,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:34,747 INFO L85 PathProgramCache]: Analyzing trace with hash -854160836, now seen corresponding path program 1 times [2022-01-10 20:04:34,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:34,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871887324] [2022-01-10 20:04:34,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:34,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 20:04:34,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:34,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871887324] [2022-01-10 20:04:34,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871887324] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:34,774 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:34,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:04:34,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135782724] [2022-01-10 20:04:34,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:34,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:34,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:34,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:34,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:34,775 INFO L87 Difference]: Start difference. First operand 1193 states and 1615 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 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) [2022-01-10 20:04:34,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:34,850 INFO L93 Difference]: Finished difference Result 2201 states and 3029 transitions. [2022-01-10 20:04:34,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:34,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 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 59 [2022-01-10 20:04:34,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:34,856 INFO L225 Difference]: With dead ends: 2201 [2022-01-10 20:04:34,856 INFO L226 Difference]: Without dead ends: 1505 [2022-01-10 20:04:34,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:34,857 INFO L933 BasicCegarLoop]: 386 mSDtfsCounter, 343 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:34,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 523 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:34,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2022-01-10 20:04:34,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1501. [2022-01-10 20:04:34,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1501 states, 1497 states have (on average 1.344689378757515) internal successors, (2013), 1500 states have internal predecessors, (2013), 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) [2022-01-10 20:04:34,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 2013 transitions. [2022-01-10 20:04:34,910 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 2013 transitions. Word has length 59 [2022-01-10 20:04:34,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:34,910 INFO L470 AbstractCegarLoop]: Abstraction has 1501 states and 2013 transitions. [2022-01-10 20:04:34,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 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) [2022-01-10 20:04:34,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 2013 transitions. [2022-01-10 20:04:34,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-10 20:04:34,911 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:34,911 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:04:34,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 20:04:34,911 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:34,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:34,912 INFO L85 PathProgramCache]: Analyzing trace with hash 2130517700, now seen corresponding path program 1 times [2022-01-10 20:04:34,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:34,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957920867] [2022-01-10 20:04:34,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:34,912 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:34,941 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:34,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:34,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957920867] [2022-01-10 20:04:34,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957920867] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:34,941 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:34,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:04:34,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452270808] [2022-01-10 20:04:34,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:34,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:34,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:34,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:34,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:34,943 INFO L87 Difference]: Start difference. First operand 1501 states and 2013 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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) [2022-01-10 20:04:35,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:35,068 INFO L93 Difference]: Finished difference Result 3475 states and 4713 transitions. [2022-01-10 20:04:35,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:35,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 61 [2022-01-10 20:04:35,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:35,077 INFO L225 Difference]: With dead ends: 3475 [2022-01-10 20:04:35,078 INFO L226 Difference]: Without dead ends: 2471 [2022-01-10 20:04:35,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:35,082 INFO L933 BasicCegarLoop]: 537 mSDtfsCounter, 146 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:35,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 910 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:35,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2022-01-10 20:04:35,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 2471. [2022-01-10 20:04:35,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2471 states, 2467 states have (on average 1.341305229023105) internal successors, (3309), 2470 states have internal predecessors, (3309), 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) [2022-01-10 20:04:35,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 3309 transitions. [2022-01-10 20:04:35,175 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 3309 transitions. Word has length 61 [2022-01-10 20:04:35,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:35,175 INFO L470 AbstractCegarLoop]: Abstraction has 2471 states and 3309 transitions. [2022-01-10 20:04:35,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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) [2022-01-10 20:04:35,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 3309 transitions. [2022-01-10 20:04:35,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-10 20:04:35,177 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:35,177 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:04:35,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 20:04:35,177 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:35,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:35,178 INFO L85 PathProgramCache]: Analyzing trace with hash -409453540, now seen corresponding path program 1 times [2022-01-10 20:04:35,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:35,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659479029] [2022-01-10 20:04:35,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:35,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:35,200 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:35,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:35,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659479029] [2022-01-10 20:04:35,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659479029] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:35,201 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:35,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:04:35,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591458111] [2022-01-10 20:04:35,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:35,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:35,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:35,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:35,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:35,202 INFO L87 Difference]: Start difference. First operand 2471 states and 3309 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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) [2022-01-10 20:04:35,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:35,334 INFO L93 Difference]: Finished difference Result 3243 states and 4304 transitions. [2022-01-10 20:04:35,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:35,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 70 [2022-01-10 20:04:35,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:35,341 INFO L225 Difference]: With dead ends: 3243 [2022-01-10 20:04:35,342 INFO L226 Difference]: Without dead ends: 2823 [2022-01-10 20:04:35,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:35,343 INFO L933 BasicCegarLoop]: 381 mSDtfsCounter, 333 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:35,343 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 531 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:35,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2022-01-10 20:04:35,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 2787. [2022-01-10 20:04:35,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2787 states, 2783 states have (on average 1.334890406036651) internal successors, (3715), 2786 states have internal predecessors, (3715), 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) [2022-01-10 20:04:35,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2787 states to 2787 states and 3715 transitions. [2022-01-10 20:04:35,469 INFO L78 Accepts]: Start accepts. Automaton has 2787 states and 3715 transitions. Word has length 70 [2022-01-10 20:04:35,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:35,469 INFO L470 AbstractCegarLoop]: Abstraction has 2787 states and 3715 transitions. [2022-01-10 20:04:35,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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) [2022-01-10 20:04:35,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2787 states and 3715 transitions. [2022-01-10 20:04:35,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-10 20:04:35,471 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:35,471 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:04:35,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 20:04:35,471 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:35,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:35,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1015751077, now seen corresponding path program 1 times [2022-01-10 20:04:35,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:35,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011475150] [2022-01-10 20:04:35,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:35,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:35,493 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:35,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:35,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011475150] [2022-01-10 20:04:35,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011475150] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:35,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:35,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:04:35,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973616672] [2022-01-10 20:04:35,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:35,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:35,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:35,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:35,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:35,494 INFO L87 Difference]: Start difference. First operand 2787 states and 3715 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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) [2022-01-10 20:04:35,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:35,633 INFO L93 Difference]: Finished difference Result 4174 states and 5485 transitions. [2022-01-10 20:04:35,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:35,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 70 [2022-01-10 20:04:35,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:35,643 INFO L225 Difference]: With dead ends: 4174 [2022-01-10 20:04:35,643 INFO L226 Difference]: Without dead ends: 3448 [2022-01-10 20:04:35,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:35,645 INFO L933 BasicCegarLoop]: 412 mSDtfsCounter, 348 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:35,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 583 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:35,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3448 states. [2022-01-10 20:04:35,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3448 to 3428. [2022-01-10 20:04:35,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3428 states, 3424 states have (on average 1.3145443925233644) internal successors, (4501), 3427 states have internal predecessors, (4501), 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) [2022-01-10 20:04:35,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3428 states to 3428 states and 4501 transitions. [2022-01-10 20:04:35,808 INFO L78 Accepts]: Start accepts. Automaton has 3428 states and 4501 transitions. Word has length 70 [2022-01-10 20:04:35,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:35,808 INFO L470 AbstractCegarLoop]: Abstraction has 3428 states and 4501 transitions. [2022-01-10 20:04:35,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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) [2022-01-10 20:04:35,808 INFO L276 IsEmpty]: Start isEmpty. Operand 3428 states and 4501 transitions. [2022-01-10 20:04:35,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-10 20:04:35,810 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:35,811 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:04:35,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 20:04:35,811 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:35,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:35,811 INFO L85 PathProgramCache]: Analyzing trace with hash 133817980, now seen corresponding path program 1 times [2022-01-10 20:04:35,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:35,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43753828] [2022-01-10 20:04:35,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:35,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:35,835 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 20:04:35,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:35,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43753828] [2022-01-10 20:04:35,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43753828] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:35,835 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:35,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:04:35,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063067526] [2022-01-10 20:04:35,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:35,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:35,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:35,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:35,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:35,836 INFO L87 Difference]: Start difference. First operand 3428 states and 4501 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) [2022-01-10 20:04:35,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:35,993 INFO L93 Difference]: Finished difference Result 4778 states and 6203 transitions. [2022-01-10 20:04:35,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:35,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 70 [2022-01-10 20:04:35,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:36,003 INFO L225 Difference]: With dead ends: 4778 [2022-01-10 20:04:36,003 INFO L226 Difference]: Without dead ends: 3405 [2022-01-10 20:04:36,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:36,008 INFO L933 BasicCegarLoop]: 386 mSDtfsCounter, 189 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:36,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 579 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:36,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3405 states. [2022-01-10 20:04:36,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3405 to 3405. [2022-01-10 20:04:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3405 states, 3401 states have (on average 1.3160835048515143) internal successors, (4476), 3404 states have internal predecessors, (4476), 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) [2022-01-10 20:04:36,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3405 states to 3405 states and 4476 transitions. [2022-01-10 20:04:36,155 INFO L78 Accepts]: Start accepts. Automaton has 3405 states and 4476 transitions. Word has length 70 [2022-01-10 20:04:36,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:36,156 INFO L470 AbstractCegarLoop]: Abstraction has 3405 states and 4476 transitions. [2022-01-10 20:04:36,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) [2022-01-10 20:04:36,156 INFO L276 IsEmpty]: Start isEmpty. Operand 3405 states and 4476 transitions. [2022-01-10 20:04:36,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-10 20:04:36,158 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:36,158 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:04:36,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 20:04:36,158 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:36,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:36,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1057079233, now seen corresponding path program 1 times [2022-01-10 20:04:36,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:36,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060691832] [2022-01-10 20:04:36,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:36,159 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:36,190 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:36,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:36,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060691832] [2022-01-10 20:04:36,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060691832] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:36,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:36,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:04:36,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760102404] [2022-01-10 20:04:36,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:36,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:36,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:36,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:36,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:36,192 INFO L87 Difference]: Start difference. First operand 3405 states and 4476 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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) [2022-01-10 20:04:36,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:36,378 INFO L93 Difference]: Finished difference Result 5861 states and 7535 transitions. [2022-01-10 20:04:36,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:36,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 71 [2022-01-10 20:04:36,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:36,389 INFO L225 Difference]: With dead ends: 5861 [2022-01-10 20:04:36,389 INFO L226 Difference]: Without dead ends: 3959 [2022-01-10 20:04:36,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:36,393 INFO L933 BasicCegarLoop]: 517 mSDtfsCounter, 137 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:36,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 889 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:36,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3959 states. [2022-01-10 20:04:36,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3959 to 3959. [2022-01-10 20:04:36,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3959 states, 3955 states have (on average 1.297345132743363) internal successors, (5131), 3958 states have internal predecessors, (5131), 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) [2022-01-10 20:04:36,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3959 states to 3959 states and 5131 transitions. [2022-01-10 20:04:36,572 INFO L78 Accepts]: Start accepts. Automaton has 3959 states and 5131 transitions. Word has length 71 [2022-01-10 20:04:36,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:36,572 INFO L470 AbstractCegarLoop]: Abstraction has 3959 states and 5131 transitions. [2022-01-10 20:04:36,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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) [2022-01-10 20:04:36,572 INFO L276 IsEmpty]: Start isEmpty. Operand 3959 states and 5131 transitions. [2022-01-10 20:04:36,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-10 20:04:36,576 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:36,577 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:04:36,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 20:04:36,577 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:36,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:36,577 INFO L85 PathProgramCache]: Analyzing trace with hash -603935288, now seen corresponding path program 1 times [2022-01-10 20:04:36,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:36,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742987345] [2022-01-10 20:04:36,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:36,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:36,623 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 20:04:36,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:36,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742987345] [2022-01-10 20:04:36,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742987345] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:36,624 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:36,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:04:36,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912146850] [2022-01-10 20:04:36,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:36,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:36,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:36,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:36,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:36,625 INFO L87 Difference]: Start difference. First operand 3959 states and 5131 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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) [2022-01-10 20:04:36,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:36,860 INFO L93 Difference]: Finished difference Result 7823 states and 10383 transitions. [2022-01-10 20:04:36,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:36,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 103 [2022-01-10 20:04:36,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:36,885 INFO L225 Difference]: With dead ends: 7823 [2022-01-10 20:04:36,885 INFO L226 Difference]: Without dead ends: 5891 [2022-01-10 20:04:36,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:36,890 INFO L933 BasicCegarLoop]: 383 mSDtfsCounter, 130 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:36,890 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 720 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:36,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5891 states. [2022-01-10 20:04:37,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5891 to 5887. [2022-01-10 20:04:37,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5887 states, 5883 states have (on average 1.3100458949515554) internal successors, (7707), 5886 states have internal predecessors, (7707), 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) [2022-01-10 20:04:37,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5887 states to 5887 states and 7707 transitions. [2022-01-10 20:04:37,215 INFO L78 Accepts]: Start accepts. Automaton has 5887 states and 7707 transitions. Word has length 103 [2022-01-10 20:04:37,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:37,216 INFO L470 AbstractCegarLoop]: Abstraction has 5887 states and 7707 transitions. [2022-01-10 20:04:37,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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) [2022-01-10 20:04:37,216 INFO L276 IsEmpty]: Start isEmpty. Operand 5887 states and 7707 transitions. [2022-01-10 20:04:37,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-10 20:04:37,221 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:37,222 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:04:37,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 20:04:37,222 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:37,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:37,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1803707940, now seen corresponding path program 1 times [2022-01-10 20:04:37,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:37,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384282138] [2022-01-10 20:04:37,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:37,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:37,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:37,283 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-10 20:04:37,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:37,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384282138] [2022-01-10 20:04:37,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384282138] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:37,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:37,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:04:37,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027405194] [2022-01-10 20:04:37,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:37,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:37,284 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:37,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:37,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:37,285 INFO L87 Difference]: Start difference. First operand 5887 states and 7707 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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) [2022-01-10 20:04:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:37,619 INFO L93 Difference]: Finished difference Result 7737 states and 9987 transitions. [2022-01-10 20:04:37,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:37,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 103 [2022-01-10 20:04:37,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:37,629 INFO L225 Difference]: With dead ends: 7737 [2022-01-10 20:04:37,629 INFO L226 Difference]: Without dead ends: 5839 [2022-01-10 20:04:37,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:37,632 INFO L933 BasicCegarLoop]: 390 mSDtfsCounter, 300 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:37,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 541 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:04:37,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5839 states. [2022-01-10 20:04:37,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5839 to 5839. [2022-01-10 20:04:37,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5839 states, 5835 states have (on average 1.2975149957155099) internal successors, (7571), 5838 states have internal predecessors, (7571), 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) [2022-01-10 20:04:37,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5839 states to 5839 states and 7571 transitions. [2022-01-10 20:04:37,875 INFO L78 Accepts]: Start accepts. Automaton has 5839 states and 7571 transitions. Word has length 103 [2022-01-10 20:04:37,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:37,875 INFO L470 AbstractCegarLoop]: Abstraction has 5839 states and 7571 transitions. [2022-01-10 20:04:37,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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) [2022-01-10 20:04:37,876 INFO L276 IsEmpty]: Start isEmpty. Operand 5839 states and 7571 transitions. [2022-01-10 20:04:37,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-10 20:04:37,881 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:37,881 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:04:37,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 20:04:37,881 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:37,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:37,882 INFO L85 PathProgramCache]: Analyzing trace with hash 346992529, now seen corresponding path program 1 times [2022-01-10 20:04:37,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:37,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248261901] [2022-01-10 20:04:37,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:37,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:37,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:37,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248261901] [2022-01-10 20:04:37,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248261901] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:37,911 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:37,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:04:37,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742707342] [2022-01-10 20:04:37,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:37,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:37,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:37,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:37,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:37,912 INFO L87 Difference]: Start difference. First operand 5839 states and 7571 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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) [2022-01-10 20:04:38,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:38,121 INFO L93 Difference]: Finished difference Result 7791 states and 10243 transitions. [2022-01-10 20:04:38,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:38,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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 104 [2022-01-10 20:04:38,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:38,124 INFO L225 Difference]: With dead ends: 7791 [2022-01-10 20:04:38,125 INFO L226 Difference]: Without dead ends: 1880 [2022-01-10 20:04:38,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:38,129 INFO L933 BasicCegarLoop]: 489 mSDtfsCounter, 112 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:38,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 841 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:38,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2022-01-10 20:04:38,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1880. [2022-01-10 20:04:38,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1878 states have (on average 1.1964856230031948) internal successors, (2247), 1879 states have internal predecessors, (2247), 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) [2022-01-10 20:04:38,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2247 transitions. [2022-01-10 20:04:38,189 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2247 transitions. Word has length 104 [2022-01-10 20:04:38,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:38,189 INFO L470 AbstractCegarLoop]: Abstraction has 1880 states and 2247 transitions. [2022-01-10 20:04:38,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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) [2022-01-10 20:04:38,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2247 transitions. [2022-01-10 20:04:38,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-10 20:04:38,190 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:38,190 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:04:38,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 20:04:38,191 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:38,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:38,191 INFO L85 PathProgramCache]: Analyzing trace with hash 497784487, now seen corresponding path program 1 times [2022-01-10 20:04:38,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:38,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775348317] [2022-01-10 20:04:38,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:38,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:38,218 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 20:04:38,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:38,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775348317] [2022-01-10 20:04:38,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775348317] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:38,218 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:38,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:04:38,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675023672] [2022-01-10 20:04:38,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:38,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:38,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:38,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:38,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:38,219 INFO L87 Difference]: Start difference. First operand 1880 states and 2247 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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) [2022-01-10 20:04:38,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:38,298 INFO L93 Difference]: Finished difference Result 3734 states and 4465 transitions. [2022-01-10 20:04:38,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:38,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 104 [2022-01-10 20:04:38,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:38,302 INFO L225 Difference]: With dead ends: 3734 [2022-01-10 20:04:38,302 INFO L226 Difference]: Without dead ends: 1884 [2022-01-10 20:04:38,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:38,305 INFO L933 BasicCegarLoop]: 291 mSDtfsCounter, 123 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:38,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 467 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:38,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2022-01-10 20:04:38,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1880. [2022-01-10 20:04:38,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1878 states have (on average 1.18370607028754) internal successors, (2223), 1879 states have internal predecessors, (2223), 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) [2022-01-10 20:04:38,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2223 transitions. [2022-01-10 20:04:38,370 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2223 transitions. Word has length 104 [2022-01-10 20:04:38,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:38,370 INFO L470 AbstractCegarLoop]: Abstraction has 1880 states and 2223 transitions. [2022-01-10 20:04:38,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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) [2022-01-10 20:04:38,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2223 transitions. [2022-01-10 20:04:38,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-10 20:04:38,372 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:38,372 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:04:38,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 20:04:38,372 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:38,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:38,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1441721460, now seen corresponding path program 1 times [2022-01-10 20:04:38,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:38,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21379159] [2022-01-10 20:04:38,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:38,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:38,402 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:04:38,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:38,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21379159] [2022-01-10 20:04:38,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21379159] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:38,402 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:38,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:04:38,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387816895] [2022-01-10 20:04:38,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:38,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:38,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:38,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:38,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:38,403 INFO L87 Difference]: Start difference. First operand 1880 states and 2223 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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) [2022-01-10 20:04:38,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:38,465 INFO L93 Difference]: Finished difference Result 3173 states and 3753 transitions. [2022-01-10 20:04:38,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:38,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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 104 [2022-01-10 20:04:38,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:38,468 INFO L225 Difference]: With dead ends: 3173 [2022-01-10 20:04:38,468 INFO L226 Difference]: Without dead ends: 1323 [2022-01-10 20:04:38,470 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:38,470 INFO L933 BasicCegarLoop]: 292 mSDtfsCounter, 119 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:38,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 424 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:38,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2022-01-10 20:04:38,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1315. [2022-01-10 20:04:38,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1315 states, 1313 states have (on average 1.1523229246001523) internal successors, (1513), 1314 states have internal predecessors, (1513), 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) [2022-01-10 20:04:38,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1513 transitions. [2022-01-10 20:04:38,533 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1513 transitions. Word has length 104 [2022-01-10 20:04:38,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:38,533 INFO L470 AbstractCegarLoop]: Abstraction has 1315 states and 1513 transitions. [2022-01-10 20:04:38,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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) [2022-01-10 20:04:38,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1513 transitions. [2022-01-10 20:04:38,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-10 20:04:38,534 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:38,535 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:04:38,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 20:04:38,535 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:38,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:38,535 INFO L85 PathProgramCache]: Analyzing trace with hash -343669118, now seen corresponding path program 1 times [2022-01-10 20:04:38,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:38,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776212955] [2022-01-10 20:04:38,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:38,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:38,577 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-01-10 20:04:38,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:38,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776212955] [2022-01-10 20:04:38,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776212955] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:38,577 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:38,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:04:38,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786669986] [2022-01-10 20:04:38,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:38,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:04:38,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:38,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:04:38,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:04:38,578 INFO L87 Difference]: Start difference. First operand 1315 states and 1513 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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) [2022-01-10 20:04:38,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:38,667 INFO L93 Difference]: Finished difference Result 2383 states and 2733 transitions. [2022-01-10 20:04:38,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:04:38,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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 105 [2022-01-10 20:04:38,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:38,669 INFO L225 Difference]: With dead ends: 2383 [2022-01-10 20:04:38,669 INFO L226 Difference]: Without dead ends: 695 [2022-01-10 20:04:38,670 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:04:38,670 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 412 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:38,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [412 Valid, 455 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:38,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-01-10 20:04:38,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 629. [2022-01-10 20:04:38,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 627 states have (on average 1.1116427432216907) internal successors, (697), 628 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:04:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 697 transitions. [2022-01-10 20:04:38,696 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 697 transitions. Word has length 105 [2022-01-10 20:04:38,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:38,696 INFO L470 AbstractCegarLoop]: Abstraction has 629 states and 697 transitions. [2022-01-10 20:04:38,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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) [2022-01-10 20:04:38,696 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 697 transitions. [2022-01-10 20:04:38,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-10 20:04:38,697 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:38,697 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:04:38,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 20:04:38,697 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:38,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:38,697 INFO L85 PathProgramCache]: Analyzing trace with hash -557362496, now seen corresponding path program 1 times [2022-01-10 20:04:38,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:38,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784695474] [2022-01-10 20:04:38,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:38,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:38,766 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 20:04:38,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:38,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784695474] [2022-01-10 20:04:38,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784695474] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:38,766 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:38,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 20:04:38,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376468895] [2022-01-10 20:04:38,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:38,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 20:04:38,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:38,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 20:04:38,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 20:04:38,767 INFO L87 Difference]: Start difference. First operand 629 states and 697 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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) [2022-01-10 20:04:38,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:38,828 INFO L93 Difference]: Finished difference Result 633 states and 701 transitions. [2022-01-10 20:04:38,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 20:04:38,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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 105 [2022-01-10 20:04:38,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:38,830 INFO L225 Difference]: With dead ends: 633 [2022-01-10 20:04:38,830 INFO L226 Difference]: Without dead ends: 631 [2022-01-10 20:04:38,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 20:04:38,831 INFO L933 BasicCegarLoop]: 258 mSDtfsCounter, 211 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:38,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 513 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:38,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2022-01-10 20:04:38,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 627. [2022-01-10 20:04:38,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 626 states have (on average 1.1086261980830672) internal successors, (694), 626 states have internal predecessors, (694), 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) [2022-01-10 20:04:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 694 transitions. [2022-01-10 20:04:38,884 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 694 transitions. Word has length 105 [2022-01-10 20:04:38,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:38,884 INFO L470 AbstractCegarLoop]: Abstraction has 627 states and 694 transitions. [2022-01-10 20:04:38,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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) [2022-01-10 20:04:38,884 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 694 transitions. [2022-01-10 20:04:38,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-01-10 20:04:38,885 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:38,885 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:04:38,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 20:04:38,886 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:38,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:38,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1242112909, now seen corresponding path program 1 times [2022-01-10 20:04:38,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:38,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164150912] [2022-01-10 20:04:38,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:38,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:38,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:04:38,921 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-01-10 20:04:38,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:04:38,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164150912] [2022-01-10 20:04:38,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164150912] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:04:38,921 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:04:38,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:04:38,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943589388] [2022-01-10 20:04:38,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:04:38,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:04:38,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:04:38,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:04:38,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:38,923 INFO L87 Difference]: Start difference. First operand 627 states and 694 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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) [2022-01-10 20:04:39,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:04:39,025 INFO L93 Difference]: Finished difference Result 1301 states and 1443 transitions. [2022-01-10 20:04:39,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:04:39,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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 109 [2022-01-10 20:04:39,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:04:39,027 INFO L225 Difference]: With dead ends: 1301 [2022-01-10 20:04:39,027 INFO L226 Difference]: Without dead ends: 953 [2022-01-10 20:04:39,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:04:39,029 INFO L933 BasicCegarLoop]: 301 mSDtfsCounter, 126 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:04:39,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 466 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:04:39,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2022-01-10 20:04:39,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 629. [2022-01-10 20:04:39,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 628 states have (on average 1.10828025477707) internal successors, (696), 628 states have internal predecessors, (696), 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) [2022-01-10 20:04:39,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 696 transitions. [2022-01-10 20:04:39,095 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 696 transitions. Word has length 109 [2022-01-10 20:04:39,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:04:39,095 INFO L470 AbstractCegarLoop]: Abstraction has 629 states and 696 transitions. [2022-01-10 20:04:39,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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) [2022-01-10 20:04:39,095 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 696 transitions. [2022-01-10 20:04:39,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 20:04:39,096 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:04:39,096 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:04:39,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 20:04:39,096 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:04:39,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:04:39,096 INFO L85 PathProgramCache]: Analyzing trace with hash 118482583, now seen corresponding path program 1 times [2022-01-10 20:04:39,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:04:39,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712230326] [2022-01-10 20:04:39,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:04:39,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:04:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 20:04:39,136 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 20:04:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 20:04:39,196 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 20:04:39,196 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 20:04:39,197 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-10 20:04:39,199 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-01-10 20:04:39,199 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-01-10 20:04:39,199 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-01-10 20:04:39,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 20:04:39,202 INFO L732 BasicCegarLoop]: Path program 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] [2022-01-10 20:04:39,205 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 20:04:39,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:04:39 BasicIcfg [2022-01-10 20:04:39,475 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 20:04:39,475 INFO L158 Benchmark]: Toolchain (without parser) took 7774.09ms. Allocated memory was 174.1MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 117.1MB in the beginning and 1.1GB in the end (delta: -937.4MB). Peak memory consumption was 127.1MB. Max. memory is 8.0GB. [2022-01-10 20:04:39,475 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 174.1MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 20:04:39,477 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.31ms. Allocated memory was 174.1MB in the beginning and 218.1MB in the end (delta: 44.0MB). Free memory was 116.9MB in the beginning and 183.8MB in the end (delta: -66.9MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2022-01-10 20:04:39,477 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.07ms. Allocated memory is still 218.1MB. Free memory was 183.8MB in the beginning and 180.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-10 20:04:39,478 INFO L158 Benchmark]: Boogie Preprocessor took 48.41ms. Allocated memory is still 218.1MB. Free memory was 180.2MB in the beginning and 177.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 20:04:39,478 INFO L158 Benchmark]: RCFGBuilder took 575.73ms. Allocated memory is still 218.1MB. Free memory was 177.0MB in the beginning and 144.5MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-01-10 20:04:39,478 INFO L158 Benchmark]: IcfgTransformer took 143.91ms. Allocated memory is still 218.1MB. Free memory was 144.5MB in the beginning and 128.3MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-01-10 20:04:39,479 INFO L158 Benchmark]: TraceAbstraction took 6510.67ms. Allocated memory was 218.1MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 127.7MB in the beginning and 1.1GB in the end (delta: -926.8MB). Peak memory consumption was 92.4MB. Max. memory is 8.0GB. [2022-01-10 20:04:39,484 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.09ms. Allocated memory is still 174.1MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 413.31ms. Allocated memory was 174.1MB in the beginning and 218.1MB in the end (delta: 44.0MB). Free memory was 116.9MB in the beginning and 183.8MB in the end (delta: -66.9MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.07ms. Allocated memory is still 218.1MB. Free memory was 183.8MB in the beginning and 180.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.41ms. Allocated memory is still 218.1MB. Free memory was 180.2MB in the beginning and 177.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 575.73ms. Allocated memory is still 218.1MB. Free memory was 177.0MB in the beginning and 144.5MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * IcfgTransformer took 143.91ms. Allocated memory is still 218.1MB. Free memory was 144.5MB in the beginning and 128.3MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 6510.67ms. Allocated memory was 218.1MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 127.7MB in the beginning and 1.1GB in the end (delta: -926.8MB). Peak memory consumption was 92.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 599]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int fast_clk_edge ; [L33] int slow_clk_edge ; [L34] int q_buf_0 ; [L35] int q_free ; [L36] int q_read_ev ; [L37] int q_write_ev ; [L38] int q_req_up ; [L39] int q_ev ; [L60] int p_num_write ; [L61] int p_last_write ; [L62] int p_dw_st ; [L63] int p_dw_pc ; [L64] int p_dw_i ; [L65] int c_num_read ; [L66] int c_last_read ; [L67] int c_dr_st ; [L68] int c_dr_pc ; [L69] int c_dr_i ; [L202] static int a_t ; [L352] static int t = 0; [L603] int m_pc = 0; [L604] int t1_pc = 0; [L605] int m_st ; [L606] int t1_st ; [L607] int m_i ; [L608] int t1_i ; [L609] int M_E = 2; [L610] int T1_E = 2; [L611] int E_M = 2; [L612] int E_1 = 2; [L616] int token ; [L618] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L1077] COND FALSE !(__VERIFIER_nondet_int()) [L1080] CALL main2() [L1064] int __retres1 ; [L1068] CALL init_model2() [L979] m_i = 1 [L980] t1_i = 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1068] RET init_model2() [L1069] CALL start_simulation2() [L1005] int kernel_st ; [L1006] int tmp ; [L1007] int tmp___0 ; [L1011] kernel_st = 0 [L1012] FCALL update_channels2() [L1013] CALL init_threads2() [L761] COND TRUE m_i == 1 [L762] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L766] COND TRUE t1_i == 1 [L767] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1013] RET init_threads2() [L1014] CALL fire_delta_events2() [L850] COND FALSE !(M_E == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L855] COND FALSE !(T1_E == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L860] COND FALSE !(E_M == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L865] COND FALSE !(E_1 == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1014] RET fire_delta_events2() [L1015] CALL activate_threads2() [L903] int tmp ; [L904] int tmp___0 ; [L908] CALL, EXPR is_master_triggered() [L712] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L715] COND FALSE !(m_pc == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L725] __retres1 = 0 VAL [__retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L727] return (__retres1); VAL [\result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L908] RET, EXPR is_master_triggered() [L908] tmp = is_master_triggered() [L910] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L916] CALL, EXPR is_transmit1_triggered() [L731] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L734] COND FALSE !(t1_pc == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L744] __retres1 = 0 VAL [__retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L746] return (__retres1); VAL [\result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L916] RET, EXPR is_transmit1_triggered() [L916] tmp___0 = is_transmit1_triggered() [L918] COND FALSE !(\read(tmp___0)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L1015] RET activate_threads2() [L1016] CALL reset_delta_events2() [L878] COND FALSE !(M_E == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L883] COND FALSE !(T1_E == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L888] COND FALSE !(E_M == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L893] COND FALSE !(E_1 == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1016] RET reset_delta_events2() [L1019] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L1022] kernel_st = 1 [L1023] CALL eval2() [L797] int tmp ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L801] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] CALL, EXPR exists_runnable_thread2() [L776] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L779] COND TRUE m_st == 0 [L780] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L792] return (__retres1); VAL [\result=-1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] RET, EXPR exists_runnable_thread2() [L804] tmp = exists_runnable_thread2() [L806] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L811] COND TRUE m_st == 0 [L812] int tmp_ndt_1; [L813] tmp_ndt_1 = __VERIFIER_nondet_int() [L814] COND FALSE !(\read(tmp_ndt_1)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L825] COND TRUE t1_st == 0 [L826] int tmp_ndt_2; [L827] tmp_ndt_2 = __VERIFIER_nondet_int() [L828] COND TRUE \read(tmp_ndt_2) [L830] t1_st = 1 [L831] CALL transmit1() [L679] COND TRUE t1_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L690] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L692] t1_pc = 1 [L693] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L831] RET transmit1() [L801] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=4, token=0] [L804] CALL, EXPR exists_runnable_thread2() [L776] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L779] COND TRUE m_st == 0 [L780] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L792] return (__retres1); VAL [\result=-1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L804] RET, EXPR exists_runnable_thread2() [L804] tmp = exists_runnable_thread2() [L806] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=4, token=0] [L811] COND TRUE m_st == 0 [L812] int tmp_ndt_1; [L813] tmp_ndt_1 = __VERIFIER_nondet_int() [L814] COND TRUE \read(tmp_ndt_1) [L816] m_st = 1 [L817] CALL master() [L621] int tmp_var = __VERIFIER_nondet_int(); [L623] COND TRUE m_pc == 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L634] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L637] token = __VERIFIER_nondet_int() [L638] local = token [L639] E_1 = 1 [L640] CALL immediate_notify() [L932] CALL activate_threads2() [L903] int tmp ; [L904] int tmp___0 ; [L908] CALL, EXPR is_master_triggered() [L712] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L715] COND FALSE !(m_pc == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L725] __retres1 = 0 VAL [__retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L727] return (__retres1); VAL [\result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L908] RET, EXPR is_master_triggered() [L908] tmp = is_master_triggered() [L910] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L916] CALL, EXPR is_transmit1_triggered() [L731] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L734] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L735] COND TRUE E_1 == 1 [L736] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L746] return (__retres1); VAL [\result=-1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L916] RET, EXPR is_transmit1_triggered() [L916] tmp___0 = is_transmit1_triggered() [L918] COND TRUE \read(tmp___0) [L919] t1_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L932] RET activate_threads2() [L640] RET immediate_notify() [L641] E_1 = 2 [L642] m_pc = 1 [L643] m_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L817] RET master() [L825] COND TRUE t1_st == 0 [L826] int tmp_ndt_2; [L827] tmp_ndt_2 = __VERIFIER_nondet_int() [L828] COND TRUE \read(tmp_ndt_2) [L830] t1_st = 1 [L831] CALL transmit1() [L679] COND FALSE !(t1_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L682] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L698] token += 1 [L699] E_M = 1 [L700] CALL immediate_notify() [L932] CALL activate_threads2() [L903] int tmp ; [L904] int tmp___0 ; [L908] CALL, EXPR is_master_triggered() [L712] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L715] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L716] COND TRUE E_M == 1 [L717] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L727] return (__retres1); VAL [\result=-1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L908] RET, EXPR is_master_triggered() [L908] tmp = is_master_triggered() [L910] COND TRUE \read(tmp) [L911] m_st = 0 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L916] CALL, EXPR is_transmit1_triggered() [L731] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L734] COND TRUE t1_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L735] COND FALSE !(E_1 == 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L744] __retres1 = 0 VAL [__retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L746] return (__retres1); VAL [\result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L916] RET, EXPR is_transmit1_triggered() [L916] tmp___0 = is_transmit1_triggered() [L918] COND FALSE !(\read(tmp___0)) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L932] RET activate_threads2() [L700] RET immediate_notify() [L701] E_M = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L690] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L692] t1_pc = 1 [L693] t1_st = 2 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L831] RET transmit1() [L801] COND TRUE 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=5, token=1] [L804] CALL, EXPR exists_runnable_thread2() [L776] int __retres1 ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L779] COND TRUE m_st == 0 [L780] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L792] return (__retres1); VAL [\result=-1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L804] RET, EXPR exists_runnable_thread2() [L804] tmp = exists_runnable_thread2() [L806] COND TRUE \read(tmp) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=1, tmp_ndt_2=5, token=1] [L811] COND TRUE m_st == 0 [L812] int tmp_ndt_1; [L813] tmp_ndt_1 = __VERIFIER_nondet_int() [L814] COND TRUE \read(tmp_ndt_1) [L816] m_st = 1 [L817] CALL master() [L621] int tmp_var = __VERIFIER_nondet_int(); [L623] COND FALSE !(m_pc == 0) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L626] COND TRUE m_pc == 1 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L648] COND FALSE !(token != local + 1) VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L653] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L654] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L659] COND TRUE tmp_var <= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L660] COND TRUE tmp_var >= 5 VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L661] COND TRUE tmp_var == 5 [L662] CALL error2() [L599] reach_error() VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 303 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6544 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6544 mSDsluCounter, 14810 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5502 mSDsCounter, 167 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 395 IncrementalHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 167 mSolverCounterUnsat, 9308 mSDtfsCounter, 395 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5887occurred in iteration=17, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 700 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1789 NumberOfCodeBlocks, 1789 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1655 ConstructedInterpolants, 0 QuantifiedInterpolants, 3412 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 289/289 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! [2022-01-10 20:04:39,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...