/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_BITWISE.epf -i ../../../trunk/examples/svcomp/combinations/Problem05_label45+token_ring.12.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 13:41:01,951 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 13:41:01,953 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 13:41:02,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 13:41:02,025 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 13:41:02,026 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 13:41:02,027 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 13:41:02,029 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 13:41:02,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 13:41:02,031 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 13:41:02,032 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 13:41:02,033 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 13:41:02,034 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 13:41:02,034 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 13:41:02,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 13:41:02,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 13:41:02,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 13:41:02,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 13:41:02,056 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 13:41:02,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 13:41:02,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 13:41:02,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 13:41:02,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 13:41:02,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 13:41:02,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 13:41:02,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 13:41:02,074 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 13:41:02,075 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 13:41:02,075 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 13:41:02,076 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 13:41:02,076 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 13:41:02,077 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 13:41:02,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 13:41:02,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 13:41:02,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 13:41:02,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 13:41:02,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 13:41:02,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 13:41:02,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 13:41:02,080 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 13:41:02,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 13:41:02,089 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 13:41:02,127 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 13:41:02,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 13:41:02,127 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 13:41:02,127 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 13:41:02,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 13:41:02,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 13:41:02,129 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 13:41:02,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 13:41:02,130 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 13:41:02,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 13:41:02,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 13:41:02,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 13:41:02,131 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 13:41:02,131 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 13:41:02,131 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 13:41:02,131 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 13:41:02,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 13:41:02,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 13:41:02,131 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 13:41:02,131 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 13:41:02,132 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 13:41:02,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 13:41:02,133 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 13:41:02,133 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 13:41:02,133 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 13:41:02,133 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 13:41:02,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 13:41:02,133 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 13:41:02,134 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 13:41:02,134 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 13:41:02,134 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 13:41:02,134 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 13:41:02,135 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 13:41:02,135 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE 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 13:41:02,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 13:41:02,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 13:41:02,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 13:41:02,413 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 13:41:02,414 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 13:41:02,416 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/Problem05_label45+token_ring.12.cil-1.c [2022-01-10 13:41:02,478 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0ef601aa/060b17fcceab45e1add9edee60b4a410/FLAG0d3a1851c [2022-01-10 13:41:03,372 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 13:41:03,373 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/Problem05_label45+token_ring.12.cil-1.c [2022-01-10 13:41:03,429 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0ef601aa/060b17fcceab45e1add9edee60b4a410/FLAG0d3a1851c [2022-01-10 13:41:03,484 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0ef601aa/060b17fcceab45e1add9edee60b4a410 [2022-01-10 13:41:03,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 13:41:03,488 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 13:41:03,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 13:41:03,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 13:41:03,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 13:41:03,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:41:03" (1/1) ... [2022-01-10 13:41:03,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ec19e60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:03, skipping insertion in model container [2022-01-10 13:41:03,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:41:03" (1/1) ... [2022-01-10 13:41:03,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 13:41:03,713 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 13:41:05,383 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/Problem05_label45+token_ring.12.cil-1.c[380323,380336] [2022-01-10 13:41:05,410 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/Problem05_label45+token_ring.12.cil-1.c[383339,383352] [2022-01-10 13:41:05,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 13:41:05,726 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 13:41:06,500 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/Problem05_label45+token_ring.12.cil-1.c[380323,380336] [2022-01-10 13:41:06,510 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/Problem05_label45+token_ring.12.cil-1.c[383339,383352] [2022-01-10 13:41:06,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 13:41:06,650 INFO L208 MainTranslator]: Completed translation [2022-01-10 13:41:06,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:06 WrapperNode [2022-01-10 13:41:06,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 13:41:06,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 13:41:06,652 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 13:41:06,652 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 13:41:06,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:06" (1/1) ... [2022-01-10 13:41:06,784 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:06" (1/1) ... [2022-01-10 13:41:07,195 INFO L137 Inliner]: procedures = 69, calls = 78, calls flagged for inlining = 73, calls inlined = 280, statements flattened = 16481 [2022-01-10 13:41:07,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 13:41:07,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 13:41:07,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 13:41:07,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 13:41:07,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:06" (1/1) ... [2022-01-10 13:41:07,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:06" (1/1) ... [2022-01-10 13:41:07,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:06" (1/1) ... [2022-01-10 13:41:07,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:06" (1/1) ... [2022-01-10 13:41:07,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:06" (1/1) ... [2022-01-10 13:41:07,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:06" (1/1) ... [2022-01-10 13:41:07,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:06" (1/1) ... [2022-01-10 13:41:07,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 13:41:07,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 13:41:07,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 13:41:07,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 13:41:07,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:06" (1/1) ... [2022-01-10 13:41:07,735 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 13:41:07,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 13:41:07,761 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 13:41:07,787 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 13:41:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 13:41:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 13:41:07,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 13:41:07,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 13:41:07,971 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 13:41:07,972 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 13:41:17,249 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 13:41:17,291 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 13:41:17,291 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-01-10 13:41:17,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:41:17 BoogieIcfgContainer [2022-01-10 13:41:17,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 13:41:17,301 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 13:41:17,301 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 13:41:17,302 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 13:41:17,305 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:41:17" (1/1) ... [2022-01-10 13:41:19,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 01:41:19 BasicIcfg [2022-01-10 13:41:19,198 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 13:41:19,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 13:41:19,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 13:41:19,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 13:41:19,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:41:03" (1/4) ... [2022-01-10 13:41:19,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60742458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:41:19, skipping insertion in model container [2022-01-10 13:41:19,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:41:06" (2/4) ... [2022-01-10 13:41:19,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60742458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:41:19, skipping insertion in model container [2022-01-10 13:41:19,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:41:17" (3/4) ... [2022-01-10 13:41:19,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60742458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:41:19, skipping insertion in model container [2022-01-10 13:41:19,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 01:41:19" (4/4) ... [2022-01-10 13:41:19,205 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.12.cil-1.cTransformedIcfg [2022-01-10 13:41:19,209 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 13:41:19,210 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-10 13:41:19,258 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 13:41:19,264 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 13:41:19,264 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-10 13:41:19,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 3983 states, 3979 states have (on average 1.7041970344307615) internal successors, (6781), 3982 states have internal predecessors, (6781), 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 13:41:19,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:19,361 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:19,362 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:19,362 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:19,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:19,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1071510294, now seen corresponding path program 1 times [2022-01-10 13:41:19,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:19,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774534580] [2022-01-10 13:41:19,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:19,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:19,774 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 13:41:19,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:19,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774534580] [2022-01-10 13:41:19,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774534580] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:19,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:19,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:41:19,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575728701] [2022-01-10 13:41:19,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:19,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:19,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:19,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:19,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:19,835 INFO L87 Difference]: Start difference. First operand has 3983 states, 3979 states have (on average 1.7041970344307615) internal successors, (6781), 3982 states have internal predecessors, (6781), 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 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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 13:41:20,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:20,139 INFO L93 Difference]: Finished difference Result 7954 states and 13540 transitions. [2022-01-10 13:41:20,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:20,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:20,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:20,180 INFO L225 Difference]: With dead ends: 7954 [2022-01-10 13:41:20,180 INFO L226 Difference]: Without dead ends: 3915 [2022-01-10 13:41:20,195 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 13:41:20,201 INFO L933 BasicCegarLoop]: 6684 mSDtfsCounter, 2652 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2652 SdHoareTripleChecker+Valid, 10706 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 13:41:20,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2652 Valid, 10706 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:20,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3915 states. [2022-01-10 13:41:20,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3915 to 3915. [2022-01-10 13:41:20,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3915 states, 3912 states have (on average 1.69120654396728) internal successors, (6616), 3914 states have internal predecessors, (6616), 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 13:41:20,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3915 states to 3915 states and 6616 transitions. [2022-01-10 13:41:20,526 INFO L78 Accepts]: Start accepts. Automaton has 3915 states and 6616 transitions. Word has length 165 [2022-01-10 13:41:20,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:20,527 INFO L470 AbstractCegarLoop]: Abstraction has 3915 states and 6616 transitions. [2022-01-10 13:41:20,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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 13:41:20,527 INFO L276 IsEmpty]: Start isEmpty. Operand 3915 states and 6616 transitions. [2022-01-10 13:41:20,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:20,529 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:20,530 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:20,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 13:41:20,530 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:20,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:20,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1774106133, now seen corresponding path program 1 times [2022-01-10 13:41:20,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:20,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57624937] [2022-01-10 13:41:20,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:20,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:20,627 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 13:41:20,627 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:20,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57624937] [2022-01-10 13:41:20,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57624937] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:20,628 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:20,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:41:20,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823891288] [2022-01-10 13:41:20,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:20,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:20,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:20,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:20,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:20,631 INFO L87 Difference]: Start difference. First operand 3915 states and 6616 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:20,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:20,799 INFO L93 Difference]: Finished difference Result 7228 states and 11501 transitions. [2022-01-10 13:41:20,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:20,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:20,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:20,824 INFO L225 Difference]: With dead ends: 7228 [2022-01-10 13:41:20,826 INFO L226 Difference]: Without dead ends: 5453 [2022-01-10 13:41:20,836 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 13:41:20,838 INFO L933 BasicCegarLoop]: 6610 mSDtfsCounter, 6459 mSDsluCounter, 2385 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6459 SdHoareTripleChecker+Valid, 8995 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 13:41:20,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6459 Valid, 8995 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:20,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5453 states. [2022-01-10 13:41:21,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5453 to 5449. [2022-01-10 13:41:21,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5449 states, 5446 states have (on average 1.6285347043701799) internal successors, (8869), 5448 states have internal predecessors, (8869), 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 13:41:21,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8869 transitions. [2022-01-10 13:41:21,034 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8869 transitions. Word has length 165 [2022-01-10 13:41:21,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:21,037 INFO L470 AbstractCegarLoop]: Abstraction has 5449 states and 8869 transitions. [2022-01-10 13:41:21,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:21,039 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8869 transitions. [2022-01-10 13:41:21,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:21,046 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:21,047 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:21,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 13:41:21,052 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:21,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:21,053 INFO L85 PathProgramCache]: Analyzing trace with hash -823143627, now seen corresponding path program 1 times [2022-01-10 13:41:21,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:21,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563173009] [2022-01-10 13:41:21,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:21,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:21,188 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 13:41:21,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:21,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563173009] [2022-01-10 13:41:21,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563173009] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:21,190 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:21,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:41:21,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578865396] [2022-01-10 13:41:21,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:21,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:21,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:21,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:21,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:21,194 INFO L87 Difference]: Start difference. First operand 5449 states and 8869 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:21,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:21,367 INFO L93 Difference]: Finished difference Result 8757 states and 13747 transitions. [2022-01-10 13:41:21,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:21,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:21,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:21,392 INFO L225 Difference]: With dead ends: 8757 [2022-01-10 13:41:21,392 INFO L226 Difference]: Without dead ends: 5449 [2022-01-10 13:41:21,402 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 13:41:21,406 INFO L933 BasicCegarLoop]: 6604 mSDtfsCounter, 6589 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6589 SdHoareTripleChecker+Valid, 6604 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 13:41:21,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6589 Valid, 6604 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:21,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2022-01-10 13:41:21,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5449. [2022-01-10 13:41:21,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5449 states, 5446 states have (on average 1.627065736320235) internal successors, (8861), 5448 states have internal predecessors, (8861), 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 13:41:21,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8861 transitions. [2022-01-10 13:41:21,630 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8861 transitions. Word has length 165 [2022-01-10 13:41:21,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:21,630 INFO L470 AbstractCegarLoop]: Abstraction has 5449 states and 8861 transitions. [2022-01-10 13:41:21,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:21,631 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8861 transitions. [2022-01-10 13:41:21,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:21,634 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:21,634 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:21,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 13:41:21,634 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:21,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:21,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1586926101, now seen corresponding path program 1 times [2022-01-10 13:41:21,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:21,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389853229] [2022-01-10 13:41:21,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:21,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:21,732 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 13:41:21,732 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:21,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389853229] [2022-01-10 13:41:21,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389853229] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:21,733 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:21,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:41:21,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834883151] [2022-01-10 13:41:21,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:21,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:21,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:21,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:21,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:21,735 INFO L87 Difference]: Start difference. First operand 5449 states and 8861 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:22,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:22,029 INFO L93 Difference]: Finished difference Result 8756 states and 13730 transitions. [2022-01-10 13:41:22,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:22,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:22,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:22,053 INFO L225 Difference]: With dead ends: 8756 [2022-01-10 13:41:22,053 INFO L226 Difference]: Without dead ends: 5449 [2022-01-10 13:41:22,061 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 13:41:22,062 INFO L933 BasicCegarLoop]: 6599 mSDtfsCounter, 6583 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6583 SdHoareTripleChecker+Valid, 6599 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 13:41:22,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6583 Valid, 6599 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:22,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2022-01-10 13:41:22,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5449. [2022-01-10 13:41:22,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5449 states, 5446 states have (on average 1.62559676827029) internal successors, (8853), 5448 states have internal predecessors, (8853), 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 13:41:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8853 transitions. [2022-01-10 13:41:22,240 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8853 transitions. Word has length 165 [2022-01-10 13:41:22,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:22,241 INFO L470 AbstractCegarLoop]: Abstraction has 5449 states and 8853 transitions. [2022-01-10 13:41:22,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:22,241 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8853 transitions. [2022-01-10 13:41:22,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:22,243 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:22,243 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:22,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 13:41:22,244 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:22,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:22,245 INFO L85 PathProgramCache]: Analyzing trace with hash 833386293, now seen corresponding path program 1 times [2022-01-10 13:41:22,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:22,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128005478] [2022-01-10 13:41:22,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:22,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:22,336 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 13:41:22,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:22,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128005478] [2022-01-10 13:41:22,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128005478] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:22,338 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:22,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:41:22,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996170162] [2022-01-10 13:41:22,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:22,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:22,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:22,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:22,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:22,339 INFO L87 Difference]: Start difference. First operand 5449 states and 8853 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:22,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:22,496 INFO L93 Difference]: Finished difference Result 8755 states and 13713 transitions. [2022-01-10 13:41:22,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:22,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:22,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:22,531 INFO L225 Difference]: With dead ends: 8755 [2022-01-10 13:41:22,531 INFO L226 Difference]: Without dead ends: 5449 [2022-01-10 13:41:22,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 13:41:22,541 INFO L933 BasicCegarLoop]: 6594 mSDtfsCounter, 6577 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6577 SdHoareTripleChecker+Valid, 6594 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 13:41:22,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6577 Valid, 6594 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:22,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2022-01-10 13:41:22,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5449. [2022-01-10 13:41:22,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5449 states, 5446 states have (on average 1.6241278002203452) internal successors, (8845), 5448 states have internal predecessors, (8845), 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 13:41:22,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8845 transitions. [2022-01-10 13:41:22,729 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8845 transitions. Word has length 165 [2022-01-10 13:41:22,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:22,732 INFO L470 AbstractCegarLoop]: Abstraction has 5449 states and 8845 transitions. [2022-01-10 13:41:22,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8845 transitions. [2022-01-10 13:41:22,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:22,736 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:22,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 13:41:22,736 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:22,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:22,737 INFO L85 PathProgramCache]: Analyzing trace with hash 531983893, now seen corresponding path program 1 times [2022-01-10 13:41:22,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:22,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515948227] [2022-01-10 13:41:22,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:22,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:22,808 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 13:41:22,808 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:22,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515948227] [2022-01-10 13:41:22,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515948227] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:22,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:22,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:41:22,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751775106] [2022-01-10 13:41:22,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:22,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:22,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:22,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:22,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:22,810 INFO L87 Difference]: Start difference. First operand 5449 states and 8845 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:22,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:22,992 INFO L93 Difference]: Finished difference Result 8754 states and 13696 transitions. [2022-01-10 13:41:22,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:22,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:22,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:23,005 INFO L225 Difference]: With dead ends: 8754 [2022-01-10 13:41:23,005 INFO L226 Difference]: Without dead ends: 5449 [2022-01-10 13:41:23,012 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 13:41:23,014 INFO L933 BasicCegarLoop]: 6589 mSDtfsCounter, 6571 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6571 SdHoareTripleChecker+Valid, 6589 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 13:41:23,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6571 Valid, 6589 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:23,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2022-01-10 13:41:23,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5449. [2022-01-10 13:41:23,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5449 states, 5446 states have (on average 1.6226588321704003) internal successors, (8837), 5448 states have internal predecessors, (8837), 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 13:41:23,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8837 transitions. [2022-01-10 13:41:23,193 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8837 transitions. Word has length 165 [2022-01-10 13:41:23,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:23,194 INFO L470 AbstractCegarLoop]: Abstraction has 5449 states and 8837 transitions. [2022-01-10 13:41:23,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:23,195 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8837 transitions. [2022-01-10 13:41:23,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:23,197 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:23,197 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:23,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 13:41:23,197 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:23,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:23,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1555948747, now seen corresponding path program 1 times [2022-01-10 13:41:23,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:23,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47202584] [2022-01-10 13:41:23,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:23,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:23,259 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 13:41:23,259 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:23,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47202584] [2022-01-10 13:41:23,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47202584] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:23,259 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:23,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:41:23,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54698693] [2022-01-10 13:41:23,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:23,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:23,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:23,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:23,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:23,261 INFO L87 Difference]: Start difference. First operand 5449 states and 8837 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:23,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:23,440 INFO L93 Difference]: Finished difference Result 8753 states and 13679 transitions. [2022-01-10 13:41:23,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:23,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:23,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:23,455 INFO L225 Difference]: With dead ends: 8753 [2022-01-10 13:41:23,455 INFO L226 Difference]: Without dead ends: 5449 [2022-01-10 13:41:23,464 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 13:41:23,466 INFO L933 BasicCegarLoop]: 6584 mSDtfsCounter, 6565 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6565 SdHoareTripleChecker+Valid, 6584 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 13:41:23,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6565 Valid, 6584 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:23,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2022-01-10 13:41:23,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5449. [2022-01-10 13:41:23,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5449 states, 5446 states have (on average 1.6211898641204554) internal successors, (8829), 5448 states have internal predecessors, (8829), 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 13:41:23,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8829 transitions. [2022-01-10 13:41:23,648 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8829 transitions. Word has length 165 [2022-01-10 13:41:23,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:23,648 INFO L470 AbstractCegarLoop]: Abstraction has 5449 states and 8829 transitions. [2022-01-10 13:41:23,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:23,649 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8829 transitions. [2022-01-10 13:41:23,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:23,651 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:23,651 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:23,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 13:41:23,651 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:23,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:23,652 INFO L85 PathProgramCache]: Analyzing trace with hash 316361237, now seen corresponding path program 1 times [2022-01-10 13:41:23,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:23,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666881514] [2022-01-10 13:41:23,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:23,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:23,707 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 13:41:23,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:23,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666881514] [2022-01-10 13:41:23,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666881514] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:23,708 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:23,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:41:23,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347150569] [2022-01-10 13:41:23,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:23,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:23,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:23,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:23,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:23,710 INFO L87 Difference]: Start difference. First operand 5449 states and 8829 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:23,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:23,924 INFO L93 Difference]: Finished difference Result 8752 states and 13662 transitions. [2022-01-10 13:41:23,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:23,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:23,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:23,937 INFO L225 Difference]: With dead ends: 8752 [2022-01-10 13:41:23,938 INFO L226 Difference]: Without dead ends: 5449 [2022-01-10 13:41:23,945 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 13:41:23,945 INFO L933 BasicCegarLoop]: 6579 mSDtfsCounter, 6559 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6559 SdHoareTripleChecker+Valid, 6579 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 13:41:23,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6559 Valid, 6579 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:23,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2022-01-10 13:41:24,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5449. [2022-01-10 13:41:24,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5449 states, 5446 states have (on average 1.6197208960705105) internal successors, (8821), 5448 states have internal predecessors, (8821), 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 13:41:24,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8821 transitions. [2022-01-10 13:41:24,127 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8821 transitions. Word has length 165 [2022-01-10 13:41:24,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:24,127 INFO L470 AbstractCegarLoop]: Abstraction has 5449 states and 8821 transitions. [2022-01-10 13:41:24,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:24,128 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8821 transitions. [2022-01-10 13:41:24,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:24,129 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:24,129 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:24,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 13:41:24,130 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:24,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:24,130 INFO L85 PathProgramCache]: Analyzing trace with hash 99663669, now seen corresponding path program 1 times [2022-01-10 13:41:24,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:24,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951289684] [2022-01-10 13:41:24,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:24,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:24,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 13:41:24,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:24,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951289684] [2022-01-10 13:41:24,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951289684] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:24,185 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:24,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:41:24,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336610569] [2022-01-10 13:41:24,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:24,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:24,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:24,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:24,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:24,187 INFO L87 Difference]: Start difference. First operand 5449 states and 8821 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:24,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:24,343 INFO L93 Difference]: Finished difference Result 8751 states and 13645 transitions. [2022-01-10 13:41:24,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:24,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:24,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:24,356 INFO L225 Difference]: With dead ends: 8751 [2022-01-10 13:41:24,356 INFO L226 Difference]: Without dead ends: 5449 [2022-01-10 13:41:24,365 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 13:41:24,367 INFO L933 BasicCegarLoop]: 6574 mSDtfsCounter, 6553 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6553 SdHoareTripleChecker+Valid, 6574 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 13:41:24,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6553 Valid, 6574 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:24,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2022-01-10 13:41:24,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5449. [2022-01-10 13:41:24,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5449 states, 5446 states have (on average 1.6182519280205656) internal successors, (8813), 5448 states have internal predecessors, (8813), 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 13:41:24,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8813 transitions. [2022-01-10 13:41:24,546 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8813 transitions. Word has length 165 [2022-01-10 13:41:24,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:24,546 INFO L470 AbstractCegarLoop]: Abstraction has 5449 states and 8813 transitions. [2022-01-10 13:41:24,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:24,549 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8813 transitions. [2022-01-10 13:41:24,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:24,551 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:24,552 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:24,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 13:41:24,552 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:24,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:24,552 INFO L85 PathProgramCache]: Analyzing trace with hash 231220757, now seen corresponding path program 1 times [2022-01-10 13:41:24,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:24,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914657903] [2022-01-10 13:41:24,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:24,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:24,608 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 13:41:24,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:24,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914657903] [2022-01-10 13:41:24,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914657903] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:24,609 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:24,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:41:24,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434793934] [2022-01-10 13:41:24,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:24,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:24,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:24,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:24,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:24,610 INFO L87 Difference]: Start difference. First operand 5449 states and 8813 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:24,799 INFO L93 Difference]: Finished difference Result 8750 states and 13628 transitions. [2022-01-10 13:41:24,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:24,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:24,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:24,813 INFO L225 Difference]: With dead ends: 8750 [2022-01-10 13:41:24,813 INFO L226 Difference]: Without dead ends: 5449 [2022-01-10 13:41:24,821 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 13:41:24,822 INFO L933 BasicCegarLoop]: 6569 mSDtfsCounter, 6547 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6547 SdHoareTripleChecker+Valid, 6569 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 13:41:24,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6547 Valid, 6569 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:24,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2022-01-10 13:41:25,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5449. [2022-01-10 13:41:25,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5449 states, 5446 states have (on average 1.6167829599706207) internal successors, (8805), 5448 states have internal predecessors, (8805), 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 13:41:25,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8805 transitions. [2022-01-10 13:41:25,057 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8805 transitions. Word has length 165 [2022-01-10 13:41:25,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:25,057 INFO L470 AbstractCegarLoop]: Abstraction has 5449 states and 8805 transitions. [2022-01-10 13:41:25,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:25,058 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8805 transitions. [2022-01-10 13:41:25,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:25,060 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:25,060 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:25,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 13:41:25,061 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:25,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:25,062 INFO L85 PathProgramCache]: Analyzing trace with hash -872914123, now seen corresponding path program 1 times [2022-01-10 13:41:25,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:25,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978763895] [2022-01-10 13:41:25,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:25,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:25,136 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 13:41:25,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:25,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978763895] [2022-01-10 13:41:25,137 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978763895] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:25,137 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:25,137 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:41:25,137 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574125634] [2022-01-10 13:41:25,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:25,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:25,138 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:25,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:25,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:25,139 INFO L87 Difference]: Start difference. First operand 5449 states and 8805 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:25,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:25,344 INFO L93 Difference]: Finished difference Result 8749 states and 13611 transitions. [2022-01-10 13:41:25,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:25,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:25,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:25,357 INFO L225 Difference]: With dead ends: 8749 [2022-01-10 13:41:25,358 INFO L226 Difference]: Without dead ends: 5449 [2022-01-10 13:41:25,367 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 13:41:25,368 INFO L933 BasicCegarLoop]: 6564 mSDtfsCounter, 6541 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6541 SdHoareTripleChecker+Valid, 6564 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 13:41:25,369 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6541 Valid, 6564 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:25,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2022-01-10 13:41:25,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5449. [2022-01-10 13:41:25,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5449 states, 5446 states have (on average 1.6153139919206758) internal successors, (8797), 5448 states have internal predecessors, (8797), 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 13:41:25,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8797 transitions. [2022-01-10 13:41:25,588 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8797 transitions. Word has length 165 [2022-01-10 13:41:25,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:25,589 INFO L470 AbstractCegarLoop]: Abstraction has 5449 states and 8797 transitions. [2022-01-10 13:41:25,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:25,589 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8797 transitions. [2022-01-10 13:41:25,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:25,591 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:25,591 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:25,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 13:41:25,592 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:25,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:25,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1446773269, now seen corresponding path program 1 times [2022-01-10 13:41:25,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:25,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133115438] [2022-01-10 13:41:25,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:25,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:25,644 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 13:41:25,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:25,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133115438] [2022-01-10 13:41:25,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133115438] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:25,645 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:25,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:41:25,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462295556] [2022-01-10 13:41:25,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:25,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:25,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:25,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:25,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:25,647 INFO L87 Difference]: Start difference. First operand 5449 states and 8797 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:25,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:25,857 INFO L93 Difference]: Finished difference Result 8748 states and 13594 transitions. [2022-01-10 13:41:25,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:25,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:25,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:25,870 INFO L225 Difference]: With dead ends: 8748 [2022-01-10 13:41:25,870 INFO L226 Difference]: Without dead ends: 5449 [2022-01-10 13:41:25,880 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 13:41:25,881 INFO L933 BasicCegarLoop]: 6559 mSDtfsCounter, 6535 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6535 SdHoareTripleChecker+Valid, 6559 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 13:41:25,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6535 Valid, 6559 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:25,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2022-01-10 13:41:26,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5449. [2022-01-10 13:41:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5449 states, 5446 states have (on average 1.613845023870731) internal successors, (8789), 5448 states have internal predecessors, (8789), 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 13:41:26,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8789 transitions. [2022-01-10 13:41:26,120 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8789 transitions. Word has length 165 [2022-01-10 13:41:26,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:26,120 INFO L470 AbstractCegarLoop]: Abstraction has 5449 states and 8789 transitions. [2022-01-10 13:41:26,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:26,121 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8789 transitions. [2022-01-10 13:41:26,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:26,123 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:26,123 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:26,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 13:41:26,123 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:26,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:26,124 INFO L85 PathProgramCache]: Analyzing trace with hash -140966091, now seen corresponding path program 1 times [2022-01-10 13:41:26,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:26,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149380289] [2022-01-10 13:41:26,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:26,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:26,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 13:41:26,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:26,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149380289] [2022-01-10 13:41:26,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149380289] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:26,186 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:26,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:41:26,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053726665] [2022-01-10 13:41:26,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:26,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:26,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:26,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:26,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:26,187 INFO L87 Difference]: Start difference. First operand 5449 states and 8789 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:26,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:26,367 INFO L93 Difference]: Finished difference Result 8746 states and 13575 transitions. [2022-01-10 13:41:26,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:26,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:26,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:26,379 INFO L225 Difference]: With dead ends: 8746 [2022-01-10 13:41:26,379 INFO L226 Difference]: Without dead ends: 5449 [2022-01-10 13:41:26,386 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 13:41:26,387 INFO L933 BasicCegarLoop]: 6554 mSDtfsCounter, 6528 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6528 SdHoareTripleChecker+Valid, 6554 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 13:41:26,387 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6528 Valid, 6554 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:26,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2022-01-10 13:41:26,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5449. [2022-01-10 13:41:26,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5449 states, 5446 states have (on average 1.6123760558207858) internal successors, (8781), 5448 states have internal predecessors, (8781), 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 13:41:26,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8781 transitions. [2022-01-10 13:41:26,570 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8781 transitions. Word has length 165 [2022-01-10 13:41:26,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:26,570 INFO L470 AbstractCegarLoop]: Abstraction has 5449 states and 8781 transitions. [2022-01-10 13:41:26,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:26,571 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8781 transitions. [2022-01-10 13:41:26,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:26,572 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:26,572 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:26,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 13:41:26,573 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:26,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:26,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1890899029, now seen corresponding path program 1 times [2022-01-10 13:41:26,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:26,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76366503] [2022-01-10 13:41:26,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:26,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:26,627 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 13:41:26,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:26,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76366503] [2022-01-10 13:41:26,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76366503] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:26,628 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:26,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:41:26,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766296212] [2022-01-10 13:41:26,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:26,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:26,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:26,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:26,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:26,630 INFO L87 Difference]: Start difference. First operand 5449 states and 8781 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:26,911 INFO L93 Difference]: Finished difference Result 8745 states and 13558 transitions. [2022-01-10 13:41:26,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:26,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:26,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:26,935 INFO L225 Difference]: With dead ends: 8745 [2022-01-10 13:41:26,935 INFO L226 Difference]: Without dead ends: 5449 [2022-01-10 13:41:26,942 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 13:41:26,943 INFO L933 BasicCegarLoop]: 6519 mSDtfsCounter, 6375 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6375 SdHoareTripleChecker+Valid, 6647 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:41:26,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6375 Valid, 6647 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:26,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2022-01-10 13:41:27,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5449. [2022-01-10 13:41:27,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5449 states, 5446 states have (on average 1.6057656995960339) internal successors, (8745), 5448 states have internal predecessors, (8745), 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 13:41:27,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8745 transitions. [2022-01-10 13:41:27,174 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8745 transitions. Word has length 165 [2022-01-10 13:41:27,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:27,174 INFO L470 AbstractCegarLoop]: Abstraction has 5449 states and 8745 transitions. [2022-01-10 13:41:27,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:27,175 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8745 transitions. [2022-01-10 13:41:27,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:27,177 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:27,177 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:27,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 13:41:27,177 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:27,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:27,178 INFO L85 PathProgramCache]: Analyzing trace with hash -665666124, now seen corresponding path program 1 times [2022-01-10 13:41:27,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:27,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974843701] [2022-01-10 13:41:27,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:27,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:27,232 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 13:41:27,232 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:27,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974843701] [2022-01-10 13:41:27,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974843701] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:27,233 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:27,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:41:27,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147000028] [2022-01-10 13:41:27,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:27,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:27,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:27,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:27,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:27,235 INFO L87 Difference]: Start difference. First operand 5449 states and 8745 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:27,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:27,502 INFO L93 Difference]: Finished difference Result 8744 states and 13485 transitions. [2022-01-10 13:41:27,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:27,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:27,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:27,517 INFO L225 Difference]: With dead ends: 8744 [2022-01-10 13:41:27,517 INFO L226 Difference]: Without dead ends: 5449 [2022-01-10 13:41:27,526 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 13:41:27,527 INFO L933 BasicCegarLoop]: 6499 mSDtfsCounter, 6355 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6355 SdHoareTripleChecker+Valid, 6626 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:41:27,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6355 Valid, 6626 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:27,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2022-01-10 13:41:27,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5449. [2022-01-10 13:41:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5449 states, 5446 states have (on average 1.5991553433712817) internal successors, (8709), 5448 states have internal predecessors, (8709), 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 13:41:27,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8709 transitions. [2022-01-10 13:41:27,762 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8709 transitions. Word has length 165 [2022-01-10 13:41:27,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:27,763 INFO L470 AbstractCegarLoop]: Abstraction has 5449 states and 8709 transitions. [2022-01-10 13:41:27,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:27,763 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8709 transitions. [2022-01-10 13:41:27,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:27,765 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:27,765 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:27,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 13:41:27,765 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:27,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:27,766 INFO L85 PathProgramCache]: Analyzing trace with hash -372197229, now seen corresponding path program 1 times [2022-01-10 13:41:27,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:27,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558516797] [2022-01-10 13:41:27,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:27,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:27,815 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 13:41:27,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:27,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558516797] [2022-01-10 13:41:27,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558516797] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:27,817 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:27,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:41:27,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436251569] [2022-01-10 13:41:27,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:27,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:27,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:27,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:27,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:27,819 INFO L87 Difference]: Start difference. First operand 5449 states and 8709 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:28,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:28,092 INFO L93 Difference]: Finished difference Result 8743 states and 13412 transitions. [2022-01-10 13:41:28,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:28,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:28,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:28,103 INFO L225 Difference]: With dead ends: 8743 [2022-01-10 13:41:28,103 INFO L226 Difference]: Without dead ends: 5449 [2022-01-10 13:41:28,109 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 13:41:28,110 INFO L933 BasicCegarLoop]: 6479 mSDtfsCounter, 6335 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6335 SdHoareTripleChecker+Valid, 6605 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:41:28,110 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6335 Valid, 6605 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:28,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2022-01-10 13:41:28,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5449. [2022-01-10 13:41:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5449 states, 5446 states have (on average 1.5925449871465296) internal successors, (8673), 5448 states have internal predecessors, (8673), 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 13:41:28,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8673 transitions. [2022-01-10 13:41:28,302 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8673 transitions. Word has length 165 [2022-01-10 13:41:28,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:28,302 INFO L470 AbstractCegarLoop]: Abstraction has 5449 states and 8673 transitions. [2022-01-10 13:41:28,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:28,302 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8673 transitions. [2022-01-10 13:41:28,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:28,304 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:28,304 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:28,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 13:41:28,305 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:28,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:28,305 INFO L85 PathProgramCache]: Analyzing trace with hash -191361709, now seen corresponding path program 1 times [2022-01-10 13:41:28,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:28,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579363834] [2022-01-10 13:41:28,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:28,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:28,357 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 13:41:28,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:28,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579363834] [2022-01-10 13:41:28,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579363834] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:28,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:28,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:41:28,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784597005] [2022-01-10 13:41:28,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:28,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:28,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:28,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:28,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:28,359 INFO L87 Difference]: Start difference. First operand 5449 states and 8673 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:28,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:28,627 INFO L93 Difference]: Finished difference Result 8742 states and 13339 transitions. [2022-01-10 13:41:28,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:28,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:28,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:28,644 INFO L225 Difference]: With dead ends: 8742 [2022-01-10 13:41:28,644 INFO L226 Difference]: Without dead ends: 5449 [2022-01-10 13:41:28,650 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 13:41:28,651 INFO L933 BasicCegarLoop]: 6459 mSDtfsCounter, 6315 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6315 SdHoareTripleChecker+Valid, 6584 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:41:28,651 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6315 Valid, 6584 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:28,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2022-01-10 13:41:28,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5449. [2022-01-10 13:41:28,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5449 states, 5446 states have (on average 1.5859346309217774) internal successors, (8637), 5448 states have internal predecessors, (8637), 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 13:41:28,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8637 transitions. [2022-01-10 13:41:28,853 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8637 transitions. Word has length 165 [2022-01-10 13:41:28,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:28,853 INFO L470 AbstractCegarLoop]: Abstraction has 5449 states and 8637 transitions. [2022-01-10 13:41:28,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:28,854 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8637 transitions. [2022-01-10 13:41:28,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:28,855 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:28,855 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:28,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 13:41:28,856 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:28,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:28,857 INFO L85 PathProgramCache]: Analyzing trace with hash -687065422, now seen corresponding path program 1 times [2022-01-10 13:41:28,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:28,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789134551] [2022-01-10 13:41:28,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:28,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:28,905 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 13:41:28,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:28,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789134551] [2022-01-10 13:41:28,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789134551] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:28,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:28,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:41:28,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994999679] [2022-01-10 13:41:28,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:28,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:28,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:28,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:28,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:28,907 INFO L87 Difference]: Start difference. First operand 5449 states and 8637 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:29,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:29,135 INFO L93 Difference]: Finished difference Result 8741 states and 13266 transitions. [2022-01-10 13:41:29,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:29,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:29,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:29,149 INFO L225 Difference]: With dead ends: 8741 [2022-01-10 13:41:29,149 INFO L226 Difference]: Without dead ends: 5449 [2022-01-10 13:41:29,157 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 13:41:29,157 INFO L933 BasicCegarLoop]: 6439 mSDtfsCounter, 6295 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6295 SdHoareTripleChecker+Valid, 6563 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:41:29,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6295 Valid, 6563 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:29,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2022-01-10 13:41:29,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5449. [2022-01-10 13:41:29,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5449 states, 5446 states have (on average 1.5793242746970253) internal successors, (8601), 5448 states have internal predecessors, (8601), 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 13:41:29,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8601 transitions. [2022-01-10 13:41:29,405 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8601 transitions. Word has length 165 [2022-01-10 13:41:29,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:29,405 INFO L470 AbstractCegarLoop]: Abstraction has 5449 states and 8601 transitions. [2022-01-10 13:41:29,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:29,406 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8601 transitions. [2022-01-10 13:41:29,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:29,408 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:29,408 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:29,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 13:41:29,408 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:29,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:29,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2123586833, now seen corresponding path program 1 times [2022-01-10 13:41:29,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:29,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392598520] [2022-01-10 13:41:29,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:29,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:29,486 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 13:41:29,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:29,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392598520] [2022-01-10 13:41:29,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392598520] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:29,487 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:29,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:41:29,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169604175] [2022-01-10 13:41:29,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:29,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:29,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:29,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:29,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:29,489 INFO L87 Difference]: Start difference. First operand 5449 states and 8601 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:29,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:29,713 INFO L93 Difference]: Finished difference Result 8740 states and 13193 transitions. [2022-01-10 13:41:29,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:29,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:29,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:29,728 INFO L225 Difference]: With dead ends: 8740 [2022-01-10 13:41:29,728 INFO L226 Difference]: Without dead ends: 5449 [2022-01-10 13:41:29,738 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 13:41:29,739 INFO L933 BasicCegarLoop]: 6419 mSDtfsCounter, 6275 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6275 SdHoareTripleChecker+Valid, 6542 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:41:29,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6275 Valid, 6542 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:29,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2022-01-10 13:41:29,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5449. [2022-01-10 13:41:29,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5449 states, 5446 states have (on average 1.5727139184722732) internal successors, (8565), 5448 states have internal predecessors, (8565), 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 13:41:29,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8565 transitions. [2022-01-10 13:41:29,972 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8565 transitions. Word has length 165 [2022-01-10 13:41:29,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:29,973 INFO L470 AbstractCegarLoop]: Abstraction has 5449 states and 8565 transitions. [2022-01-10 13:41:29,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:29,973 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8565 transitions. [2022-01-10 13:41:29,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:29,975 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:29,975 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:29,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 13:41:29,975 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:29,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:29,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1695905008, now seen corresponding path program 1 times [2022-01-10 13:41:29,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:29,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491243770] [2022-01-10 13:41:29,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:29,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:30,028 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 13:41:30,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:30,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491243770] [2022-01-10 13:41:30,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491243770] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:30,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:30,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:41:30,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111147557] [2022-01-10 13:41:30,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:30,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:30,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:30,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:30,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:30,030 INFO L87 Difference]: Start difference. First operand 5449 states and 8565 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:30,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:30,341 INFO L93 Difference]: Finished difference Result 8739 states and 13120 transitions. [2022-01-10 13:41:30,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:30,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:30,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:30,376 INFO L225 Difference]: With dead ends: 8739 [2022-01-10 13:41:30,376 INFO L226 Difference]: Without dead ends: 5449 [2022-01-10 13:41:30,382 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 13:41:30,383 INFO L933 BasicCegarLoop]: 6399 mSDtfsCounter, 6255 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6255 SdHoareTripleChecker+Valid, 6521 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:41:30,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6255 Valid, 6521 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:30,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2022-01-10 13:41:30,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5449. [2022-01-10 13:41:30,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5449 states, 5446 states have (on average 1.566103562247521) internal successors, (8529), 5448 states have internal predecessors, (8529), 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 13:41:30,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8529 transitions. [2022-01-10 13:41:30,649 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8529 transitions. Word has length 165 [2022-01-10 13:41:30,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:30,649 INFO L470 AbstractCegarLoop]: Abstraction has 5449 states and 8529 transitions. [2022-01-10 13:41:30,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:30,650 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8529 transitions. [2022-01-10 13:41:30,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:30,651 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:30,651 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:30,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 13:41:30,651 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:30,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:30,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1669781967, now seen corresponding path program 1 times [2022-01-10 13:41:30,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:30,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683480805] [2022-01-10 13:41:30,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:30,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:30,696 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 13:41:30,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:30,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683480805] [2022-01-10 13:41:30,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683480805] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:30,697 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:30,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:41:30,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643864651] [2022-01-10 13:41:30,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:30,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:30,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:30,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:30,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:30,698 INFO L87 Difference]: Start difference. First operand 5449 states and 8529 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:30,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:30,922 INFO L93 Difference]: Finished difference Result 8738 states and 13047 transitions. [2022-01-10 13:41:30,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:30,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:30,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:30,936 INFO L225 Difference]: With dead ends: 8738 [2022-01-10 13:41:30,936 INFO L226 Difference]: Without dead ends: 5449 [2022-01-10 13:41:30,943 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 13:41:30,944 INFO L933 BasicCegarLoop]: 6379 mSDtfsCounter, 6235 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6235 SdHoareTripleChecker+Valid, 6500 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:41:30,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6235 Valid, 6500 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:30,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2022-01-10 13:41:31,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5449. [2022-01-10 13:41:31,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5449 states, 5446 states have (on average 1.559493206022769) internal successors, (8493), 5448 states have internal predecessors, (8493), 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 13:41:31,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8493 transitions. [2022-01-10 13:41:31,159 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8493 transitions. Word has length 165 [2022-01-10 13:41:31,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:31,160 INFO L470 AbstractCegarLoop]: Abstraction has 5449 states and 8493 transitions. [2022-01-10 13:41:31,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:31,160 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8493 transitions. [2022-01-10 13:41:31,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:31,161 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:31,161 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:31,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 13:41:31,162 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:31,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:31,162 INFO L85 PathProgramCache]: Analyzing trace with hash -397500370, now seen corresponding path program 1 times [2022-01-10 13:41:31,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:31,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044332048] [2022-01-10 13:41:31,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:31,163 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:31,208 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 13:41:31,208 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:31,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044332048] [2022-01-10 13:41:31,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044332048] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:31,209 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:31,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:41:31,209 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292210310] [2022-01-10 13:41:31,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:31,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:31,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:31,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:31,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:31,210 INFO L87 Difference]: Start difference. First operand 5449 states and 8493 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:31,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:31,484 INFO L93 Difference]: Finished difference Result 8737 states and 12974 transitions. [2022-01-10 13:41:31,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:31,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:31,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:31,497 INFO L225 Difference]: With dead ends: 8737 [2022-01-10 13:41:31,497 INFO L226 Difference]: Without dead ends: 5449 [2022-01-10 13:41:31,503 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 13:41:31,504 INFO L933 BasicCegarLoop]: 6359 mSDtfsCounter, 6215 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6215 SdHoareTripleChecker+Valid, 6479 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:41:31,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6215 Valid, 6479 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:31,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2022-01-10 13:41:31,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5449. [2022-01-10 13:41:31,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5449 states, 5446 states have (on average 1.552882849798017) internal successors, (8457), 5448 states have internal predecessors, (8457), 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 13:41:31,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8457 transitions. [2022-01-10 13:41:31,725 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8457 transitions. Word has length 165 [2022-01-10 13:41:31,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:31,725 INFO L470 AbstractCegarLoop]: Abstraction has 5449 states and 8457 transitions. [2022-01-10 13:41:31,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:31,726 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8457 transitions. [2022-01-10 13:41:31,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:31,727 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:31,727 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:31,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 13:41:31,727 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:31,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:31,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1882324083, now seen corresponding path program 1 times [2022-01-10 13:41:31,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:31,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267773461] [2022-01-10 13:41:31,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:31,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:31,774 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 13:41:31,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:31,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267773461] [2022-01-10 13:41:31,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267773461] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:31,774 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:31,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:41:31,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493925704] [2022-01-10 13:41:31,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:31,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:31,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:31,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:31,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:31,777 INFO L87 Difference]: Start difference. First operand 5449 states and 8457 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:32,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:32,014 INFO L93 Difference]: Finished difference Result 8736 states and 12901 transitions. [2022-01-10 13:41:32,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:32,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:32,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:32,025 INFO L225 Difference]: With dead ends: 8736 [2022-01-10 13:41:32,026 INFO L226 Difference]: Without dead ends: 5449 [2022-01-10 13:41:32,031 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 13:41:32,032 INFO L933 BasicCegarLoop]: 6339 mSDtfsCounter, 6195 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6195 SdHoareTripleChecker+Valid, 6458 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:41:32,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6195 Valid, 6458 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:32,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2022-01-10 13:41:32,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5449. [2022-01-10 13:41:32,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5449 states, 5446 states have (on average 1.5462724935732648) internal successors, (8421), 5448 states have internal predecessors, (8421), 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 13:41:32,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8421 transitions. [2022-01-10 13:41:32,243 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8421 transitions. Word has length 165 [2022-01-10 13:41:32,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:32,244 INFO L470 AbstractCegarLoop]: Abstraction has 5449 states and 8421 transitions. [2022-01-10 13:41:32,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:32,244 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8421 transitions. [2022-01-10 13:41:32,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:32,245 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:32,246 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:32,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 13:41:32,246 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:32,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:32,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1003276180, now seen corresponding path program 1 times [2022-01-10 13:41:32,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:32,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296245041] [2022-01-10 13:41:32,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:32,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:32,293 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 13:41:32,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:32,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296245041] [2022-01-10 13:41:32,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296245041] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:32,294 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:32,294 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:41:32,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471579893] [2022-01-10 13:41:32,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:32,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:32,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:32,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:32,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:32,295 INFO L87 Difference]: Start difference. First operand 5449 states and 8421 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:32,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:32,528 INFO L93 Difference]: Finished difference Result 8735 states and 12828 transitions. [2022-01-10 13:41:32,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:32,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:32,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:32,539 INFO L225 Difference]: With dead ends: 8735 [2022-01-10 13:41:32,539 INFO L226 Difference]: Without dead ends: 5449 [2022-01-10 13:41:32,545 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 13:41:32,546 INFO L933 BasicCegarLoop]: 6319 mSDtfsCounter, 6175 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6175 SdHoareTripleChecker+Valid, 6437 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:41:32,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6175 Valid, 6437 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:32,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2022-01-10 13:41:32,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5449. [2022-01-10 13:41:32,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5449 states, 5446 states have (on average 1.5396621373485126) internal successors, (8385), 5448 states have internal predecessors, (8385), 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 13:41:32,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8385 transitions. [2022-01-10 13:41:32,766 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8385 transitions. Word has length 165 [2022-01-10 13:41:32,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:32,766 INFO L470 AbstractCegarLoop]: Abstraction has 5449 states and 8385 transitions. [2022-01-10 13:41:32,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:32,766 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8385 transitions. [2022-01-10 13:41:32,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:32,768 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:32,768 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:32,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 13:41:32,768 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:32,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:32,769 INFO L85 PathProgramCache]: Analyzing trace with hash -855352757, now seen corresponding path program 1 times [2022-01-10 13:41:32,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:32,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540384319] [2022-01-10 13:41:32,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:32,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:32,814 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 13:41:32,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:32,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540384319] [2022-01-10 13:41:32,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540384319] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:32,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:32,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:41:32,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697875947] [2022-01-10 13:41:32,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:32,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:32,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:32,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:32,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:32,816 INFO L87 Difference]: Start difference. First operand 5449 states and 8385 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:33,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:33,046 INFO L93 Difference]: Finished difference Result 8734 states and 12755 transitions. [2022-01-10 13:41:33,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:33,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:33,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:33,056 INFO L225 Difference]: With dead ends: 8734 [2022-01-10 13:41:33,056 INFO L226 Difference]: Without dead ends: 5449 [2022-01-10 13:41:33,062 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 13:41:33,063 INFO L933 BasicCegarLoop]: 6299 mSDtfsCounter, 6155 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6155 SdHoareTripleChecker+Valid, 6416 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:41:33,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6155 Valid, 6416 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:33,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2022-01-10 13:41:33,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5449. [2022-01-10 13:41:33,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5449 states, 5446 states have (on average 1.5330517811237605) internal successors, (8349), 5448 states have internal predecessors, (8349), 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 13:41:33,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8349 transitions. [2022-01-10 13:41:33,304 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8349 transitions. Word has length 165 [2022-01-10 13:41:33,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:33,304 INFO L470 AbstractCegarLoop]: Abstraction has 5449 states and 8349 transitions. [2022-01-10 13:41:33,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:33,304 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8349 transitions. [2022-01-10 13:41:33,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:33,306 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:33,306 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:33,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 13:41:33,306 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:33,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:33,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1233042858, now seen corresponding path program 1 times [2022-01-10 13:41:33,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:33,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192619504] [2022-01-10 13:41:33,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:33,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:33,391 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 13:41:33,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:33,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192619504] [2022-01-10 13:41:33,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192619504] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:33,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:33,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:41:33,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061905047] [2022-01-10 13:41:33,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:33,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:33,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:33,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:33,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:33,393 INFO L87 Difference]: Start difference. First operand 5449 states and 8349 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:33,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:33,685 INFO L93 Difference]: Finished difference Result 8733 states and 12682 transitions. [2022-01-10 13:41:33,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:33,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:33,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:33,693 INFO L225 Difference]: With dead ends: 8733 [2022-01-10 13:41:33,694 INFO L226 Difference]: Without dead ends: 5449 [2022-01-10 13:41:33,700 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 13:41:33,701 INFO L933 BasicCegarLoop]: 6279 mSDtfsCounter, 6135 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6135 SdHoareTripleChecker+Valid, 6395 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:41:33,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6135 Valid, 6395 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:33,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2022-01-10 13:41:33,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 5449. [2022-01-10 13:41:33,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5449 states, 5446 states have (on average 1.5264414248990084) internal successors, (8313), 5448 states have internal predecessors, (8313), 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 13:41:33,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5449 states to 5449 states and 8313 transitions. [2022-01-10 13:41:33,921 INFO L78 Accepts]: Start accepts. Automaton has 5449 states and 8313 transitions. Word has length 165 [2022-01-10 13:41:33,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:33,921 INFO L470 AbstractCegarLoop]: Abstraction has 5449 states and 8313 transitions. [2022-01-10 13:41:33,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:33,922 INFO L276 IsEmpty]: Start isEmpty. Operand 5449 states and 8313 transitions. [2022-01-10 13:41:33,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:33,923 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:33,923 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:33,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 13:41:33,923 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:33,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:33,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1576706551, now seen corresponding path program 1 times [2022-01-10 13:41:33,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:33,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597999028] [2022-01-10 13:41:33,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:33,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:34,027 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 13:41:34,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:34,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597999028] [2022-01-10 13:41:34,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597999028] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:34,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:34,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 13:41:34,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067128624] [2022-01-10 13:41:34,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:34,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 13:41:34,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:34,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 13:41:34,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 13:41:34,029 INFO L87 Difference]: Start difference. First operand 5449 states and 8313 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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 13:41:34,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:34,606 INFO L93 Difference]: Finished difference Result 9869 states and 14181 transitions. [2022-01-10 13:41:34,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 13:41:34,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:34,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:34,617 INFO L225 Difference]: With dead ends: 9869 [2022-01-10 13:41:34,618 INFO L226 Difference]: Without dead ends: 6599 [2022-01-10 13:41:34,623 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 13:41:34,624 INFO L933 BasicCegarLoop]: 6443 mSDtfsCounter, 6566 mSDsluCounter, 14269 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6566 SdHoareTripleChecker+Valid, 20712 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 13:41:34,624 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6566 Valid, 20712 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 13:41:34,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6599 states. [2022-01-10 13:41:34,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6599 to 5455. [2022-01-10 13:41:34,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5455 states, 5452 states have (on average 1.5207263389581804) internal successors, (8291), 5454 states have internal predecessors, (8291), 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 13:41:34,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5455 states to 5455 states and 8291 transitions. [2022-01-10 13:41:34,933 INFO L78 Accepts]: Start accepts. Automaton has 5455 states and 8291 transitions. Word has length 165 [2022-01-10 13:41:34,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:34,933 INFO L470 AbstractCegarLoop]: Abstraction has 5455 states and 8291 transitions. [2022-01-10 13:41:34,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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 13:41:34,933 INFO L276 IsEmpty]: Start isEmpty. Operand 5455 states and 8291 transitions. [2022-01-10 13:41:34,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:34,935 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:34,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:34,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-10 13:41:34,935 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:34,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:34,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2095998838, now seen corresponding path program 1 times [2022-01-10 13:41:34,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:34,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387348599] [2022-01-10 13:41:34,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:34,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:35,019 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 13:41:35,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:35,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387348599] [2022-01-10 13:41:35,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387348599] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:35,020 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:35,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 13:41:35,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466829549] [2022-01-10 13:41:35,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:35,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 13:41:35,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:35,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 13:41:35,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 13:41:35,022 INFO L87 Difference]: Start difference. First operand 5455 states and 8291 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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 13:41:35,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:35,623 INFO L93 Difference]: Finished difference Result 10688 states and 15159 transitions. [2022-01-10 13:41:35,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 13:41:35,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:35,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:35,637 INFO L225 Difference]: With dead ends: 10688 [2022-01-10 13:41:35,638 INFO L226 Difference]: Without dead ends: 7447 [2022-01-10 13:41:35,645 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 13:41:35,646 INFO L933 BasicCegarLoop]: 6336 mSDtfsCounter, 5723 mSDsluCounter, 16081 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5723 SdHoareTripleChecker+Valid, 22417 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 13:41:35,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5723 Valid, 22417 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 13:41:35,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7447 states. [2022-01-10 13:41:35,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7447 to 5461. [2022-01-10 13:41:36,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5461 states, 5458 states have (on average 1.5150238182484426) internal successors, (8269), 5460 states have internal predecessors, (8269), 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 13:41:36,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5461 states to 5461 states and 8269 transitions. [2022-01-10 13:41:36,009 INFO L78 Accepts]: Start accepts. Automaton has 5461 states and 8269 transitions. Word has length 165 [2022-01-10 13:41:36,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:36,009 INFO L470 AbstractCegarLoop]: Abstraction has 5461 states and 8269 transitions. [2022-01-10 13:41:36,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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 13:41:36,009 INFO L276 IsEmpty]: Start isEmpty. Operand 5461 states and 8269 transitions. [2022-01-10 13:41:36,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:36,011 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:36,011 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:36,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-10 13:41:36,011 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:36,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:36,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1975878965, now seen corresponding path program 1 times [2022-01-10 13:41:36,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:36,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724130926] [2022-01-10 13:41:36,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:36,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:36,080 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 13:41:36,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:36,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724130926] [2022-01-10 13:41:36,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724130926] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:36,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:36,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 13:41:36,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143849980] [2022-01-10 13:41:36,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:36,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 13:41:36,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:36,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 13:41:36,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 13:41:36,082 INFO L87 Difference]: Start difference. First operand 5461 states and 8269 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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 13:41:36,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:36,654 INFO L93 Difference]: Finished difference Result 10867 states and 15305 transitions. [2022-01-10 13:41:36,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 13:41:36,655 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:36,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:36,665 INFO L225 Difference]: With dead ends: 10867 [2022-01-10 13:41:36,665 INFO L226 Difference]: Without dead ends: 7627 [2022-01-10 13:41:36,669 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 13:41:36,670 INFO L933 BasicCegarLoop]: 6303 mSDtfsCounter, 5532 mSDsluCounter, 16410 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5532 SdHoareTripleChecker+Valid, 22713 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 13:41:36,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5532 Valid, 22713 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 13:41:36,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7627 states. [2022-01-10 13:41:36,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7627 to 5467. [2022-01-10 13:41:36,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5467 states, 5464 states have (on average 1.509333821376281) internal successors, (8247), 5466 states have internal predecessors, (8247), 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 13:41:36,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5467 states to 5467 states and 8247 transitions. [2022-01-10 13:41:36,913 INFO L78 Accepts]: Start accepts. Automaton has 5467 states and 8247 transitions. Word has length 165 [2022-01-10 13:41:36,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:36,913 INFO L470 AbstractCegarLoop]: Abstraction has 5467 states and 8247 transitions. [2022-01-10 13:41:36,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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 13:41:36,914 INFO L276 IsEmpty]: Start isEmpty. Operand 5467 states and 8247 transitions. [2022-01-10 13:41:36,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:36,914 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:36,915 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:36,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-10 13:41:36,915 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:36,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:36,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1363567052, now seen corresponding path program 1 times [2022-01-10 13:41:36,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:36,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381771027] [2022-01-10 13:41:36,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:36,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:36,990 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 13:41:36,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:36,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381771027] [2022-01-10 13:41:36,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381771027] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:36,990 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:36,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:41:36,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865741733] [2022-01-10 13:41:36,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:36,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:36,991 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:36,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:36,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:36,992 INFO L87 Difference]: Start difference. First operand 5467 states and 8247 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:37,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:37,356 INFO L93 Difference]: Finished difference Result 8783 states and 12493 transitions. [2022-01-10 13:41:37,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:37,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:37,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:37,365 INFO L225 Difference]: With dead ends: 8783 [2022-01-10 13:41:37,365 INFO L226 Difference]: Without dead ends: 5467 [2022-01-10 13:41:37,370 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 13:41:37,371 INFO L933 BasicCegarLoop]: 6244 mSDtfsCounter, 6114 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6114 SdHoareTripleChecker+Valid, 6244 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 13:41:37,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6114 Valid, 6244 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:37,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5467 states. [2022-01-10 13:41:37,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5467 to 5467. [2022-01-10 13:41:37,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5467 states, 5464 states have (on average 1.507869692532943) internal successors, (8239), 5466 states have internal predecessors, (8239), 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 13:41:37,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5467 states to 5467 states and 8239 transitions. [2022-01-10 13:41:37,678 INFO L78 Accepts]: Start accepts. Automaton has 5467 states and 8239 transitions. Word has length 165 [2022-01-10 13:41:37,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:37,678 INFO L470 AbstractCegarLoop]: Abstraction has 5467 states and 8239 transitions. [2022-01-10 13:41:37,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:37,678 INFO L276 IsEmpty]: Start isEmpty. Operand 5467 states and 8239 transitions. [2022-01-10 13:41:37,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 13:41:37,680 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:37,680 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:37,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-10 13:41:37,680 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:37,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:37,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1374883179, now seen corresponding path program 1 times [2022-01-10 13:41:37,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:37,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386683412] [2022-01-10 13:41:37,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:37,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:37,760 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 13:41:37,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:37,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386683412] [2022-01-10 13:41:37,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386683412] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:37,761 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:37,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 13:41:37,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438611010] [2022-01-10 13:41:37,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:37,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:37,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:37,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:37,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:37,762 INFO L87 Difference]: Start difference. First operand 5467 states and 8239 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:38,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:38,436 INFO L93 Difference]: Finished difference Result 11900 states and 16480 transitions. [2022-01-10 13:41:38,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:38,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 165 [2022-01-10 13:41:38,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:38,452 INFO L225 Difference]: With dead ends: 11900 [2022-01-10 13:41:38,452 INFO L226 Difference]: Without dead ends: 8600 [2022-01-10 13:41:38,460 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 13:41:38,460 INFO L933 BasicCegarLoop]: 6230 mSDtfsCounter, 6036 mSDsluCounter, 2058 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6036 SdHoareTripleChecker+Valid, 8288 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 13:41:38,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6036 Valid, 8288 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 13:41:38,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8600 states. [2022-01-10 13:41:38,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8600 to 8414. [2022-01-10 13:41:38,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8414 states, 8411 states have (on average 1.4257519914397812) internal successors, (11992), 8413 states have internal predecessors, (11992), 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 13:41:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8414 states to 8414 states and 11992 transitions. [2022-01-10 13:41:38,951 INFO L78 Accepts]: Start accepts. Automaton has 8414 states and 11992 transitions. Word has length 165 [2022-01-10 13:41:38,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:38,951 INFO L470 AbstractCegarLoop]: Abstraction has 8414 states and 11992 transitions. [2022-01-10 13:41:38,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 2 states have internal predecessors, (165), 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 13:41:38,951 INFO L276 IsEmpty]: Start isEmpty. Operand 8414 states and 11992 transitions. [2022-01-10 13:41:38,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-01-10 13:41:38,955 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:38,956 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:38,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-10 13:41:38,956 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:38,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:38,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1762438496, now seen corresponding path program 1 times [2022-01-10 13:41:38,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:38,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452953110] [2022-01-10 13:41:38,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:38,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:39,045 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 13:41:39,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:39,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452953110] [2022-01-10 13:41:39,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452953110] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:39,046 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:39,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:41:39,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429403463] [2022-01-10 13:41:39,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:39,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:39,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:39,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:39,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:39,047 INFO L87 Difference]: Start difference. First operand 8414 states and 11992 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 13:41:40,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:40,098 INFO L93 Difference]: Finished difference Result 20685 states and 27683 transitions. [2022-01-10 13:41:40,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:40,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 268 [2022-01-10 13:41:40,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:40,117 INFO L225 Difference]: With dead ends: 20685 [2022-01-10 13:41:40,118 INFO L226 Difference]: Without dead ends: 14444 [2022-01-10 13:41:40,128 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 13:41:40,128 INFO L933 BasicCegarLoop]: 6227 mSDtfsCounter, 6080 mSDsluCounter, 2058 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6080 SdHoareTripleChecker+Valid, 8285 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 13:41:40,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6080 Valid, 8285 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 13:41:40,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14444 states. [2022-01-10 13:41:40,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14444 to 14100. [2022-01-10 13:41:40,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14100 states, 14097 states have (on average 1.3642618996949705) internal successors, (19232), 14099 states have internal predecessors, (19232), 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 13:41:40,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14100 states to 14100 states and 19232 transitions. [2022-01-10 13:41:40,942 INFO L78 Accepts]: Start accepts. Automaton has 14100 states and 19232 transitions. Word has length 268 [2022-01-10 13:41:40,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:40,943 INFO L470 AbstractCegarLoop]: Abstraction has 14100 states and 19232 transitions. [2022-01-10 13:41:40,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 13:41:40,943 INFO L276 IsEmpty]: Start isEmpty. Operand 14100 states and 19232 transitions. [2022-01-10 13:41:40,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-01-10 13:41:40,952 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:40,952 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:40,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-10 13:41:40,953 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:40,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:40,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1600820512, now seen corresponding path program 1 times [2022-01-10 13:41:40,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:40,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689581313] [2022-01-10 13:41:40,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:40,954 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:41,067 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 13:41:41,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:41,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689581313] [2022-01-10 13:41:41,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689581313] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:41,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:41,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 13:41:41,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614059254] [2022-01-10 13:41:41,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:41,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 13:41:41,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:41,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 13:41:41,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 13:41:41,069 INFO L87 Difference]: Start difference. First operand 14100 states and 19232 transitions. Second operand has 5 states, 5 states have (on average 53.6) internal successors, (268), 5 states have internal predecessors, (268), 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 13:41:42,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:42,903 INFO L93 Difference]: Finished difference Result 35878 states and 47184 transitions. [2022-01-10 13:41:42,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 13:41:42,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.6) internal successors, (268), 5 states have internal predecessors, (268), 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 268 [2022-01-10 13:41:42,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:42,935 INFO L225 Difference]: With dead ends: 35878 [2022-01-10 13:41:42,935 INFO L226 Difference]: Without dead ends: 24018 [2022-01-10 13:41:42,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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 13:41:42,951 INFO L933 BasicCegarLoop]: 6225 mSDtfsCounter, 5002 mSDsluCounter, 17463 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5002 SdHoareTripleChecker+Valid, 23688 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 13:41:42,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5002 Valid, 23688 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 13:41:42,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24018 states. [2022-01-10 13:41:43,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24018 to 14124. [2022-01-10 13:41:43,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14124 states, 14121 states have (on average 1.356490333545783) internal successors, (19155), 14123 states have internal predecessors, (19155), 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 13:41:43,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14124 states to 14124 states and 19155 transitions. [2022-01-10 13:41:43,880 INFO L78 Accepts]: Start accepts. Automaton has 14124 states and 19155 transitions. Word has length 268 [2022-01-10 13:41:43,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:43,881 INFO L470 AbstractCegarLoop]: Abstraction has 14124 states and 19155 transitions. [2022-01-10 13:41:43,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.6) internal successors, (268), 5 states have internal predecessors, (268), 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 13:41:43,881 INFO L276 IsEmpty]: Start isEmpty. Operand 14124 states and 19155 transitions. [2022-01-10 13:41:43,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-01-10 13:41:43,889 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:43,889 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:43,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-10 13:41:43,889 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:43,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:43,890 INFO L85 PathProgramCache]: Analyzing trace with hash -182697570, now seen corresponding path program 1 times [2022-01-10 13:41:43,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:43,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914258894] [2022-01-10 13:41:43,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:43,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:43,979 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 13:41:43,979 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:43,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914258894] [2022-01-10 13:41:43,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914258894] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:43,980 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:43,980 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:41:43,980 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834381125] [2022-01-10 13:41:43,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:43,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:43,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:43,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:43,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:43,981 INFO L87 Difference]: Start difference. First operand 14124 states and 19155 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 13:41:45,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:45,783 INFO L93 Difference]: Finished difference Result 37293 states and 48304 transitions. [2022-01-10 13:41:45,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:45,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 268 [2022-01-10 13:41:45,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:45,820 INFO L225 Difference]: With dead ends: 37293 [2022-01-10 13:41:45,821 INFO L226 Difference]: Without dead ends: 25451 [2022-01-10 13:41:45,837 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 13:41:45,837 INFO L933 BasicCegarLoop]: 7657 mSDtfsCounter, 5795 mSDsluCounter, 2252 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5795 SdHoareTripleChecker+Valid, 9909 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 13:41:45,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5795 Valid, 9909 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:45,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25451 states. [2022-01-10 13:41:47,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25451 to 25447. [2022-01-10 13:41:47,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25447 states, 25444 states have (on average 1.3074202169470208) internal successors, (33266), 25446 states have internal predecessors, (33266), 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 13:41:47,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25447 states to 25447 states and 33266 transitions. [2022-01-10 13:41:47,760 INFO L78 Accepts]: Start accepts. Automaton has 25447 states and 33266 transitions. Word has length 268 [2022-01-10 13:41:47,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:47,761 INFO L470 AbstractCegarLoop]: Abstraction has 25447 states and 33266 transitions. [2022-01-10 13:41:47,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 13:41:47,761 INFO L276 IsEmpty]: Start isEmpty. Operand 25447 states and 33266 transitions. [2022-01-10 13:41:47,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-01-10 13:41:47,771 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:47,771 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:47,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-10 13:41:47,771 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:47,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:47,772 INFO L85 PathProgramCache]: Analyzing trace with hash 301939261, now seen corresponding path program 1 times [2022-01-10 13:41:47,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:47,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608285151] [2022-01-10 13:41:47,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:47,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:47,822 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 13:41:47,822 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:47,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608285151] [2022-01-10 13:41:47,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608285151] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:47,823 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:47,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:41:47,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946817046] [2022-01-10 13:41:47,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:47,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:47,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:47,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:47,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:47,824 INFO L87 Difference]: Start difference. First operand 25447 states and 33266 transitions. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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 13:41:49,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 13:41:49,605 INFO L93 Difference]: Finished difference Result 48457 states and 62196 transitions. [2022-01-10 13:41:49,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 13:41:49,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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 268 [2022-01-10 13:41:49,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 13:41:49,636 INFO L225 Difference]: With dead ends: 48457 [2022-01-10 13:41:49,636 INFO L226 Difference]: Without dead ends: 25292 [2022-01-10 13:41:49,653 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 13:41:49,653 INFO L933 BasicCegarLoop]: 6228 mSDtfsCounter, 2266 mSDsluCounter, 3958 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2266 SdHoareTripleChecker+Valid, 10186 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 13:41:49,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2266 Valid, 10186 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 13:41:49,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25292 states. [2022-01-10 13:41:51,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25292 to 25292. [2022-01-10 13:41:51,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25292 states, 25289 states have (on average 1.308078611253905) internal successors, (33080), 25291 states have internal predecessors, (33080), 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 13:41:51,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25292 states to 25292 states and 33080 transitions. [2022-01-10 13:41:51,527 INFO L78 Accepts]: Start accepts. Automaton has 25292 states and 33080 transitions. Word has length 268 [2022-01-10 13:41:51,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 13:41:51,528 INFO L470 AbstractCegarLoop]: Abstraction has 25292 states and 33080 transitions. [2022-01-10 13:41:51,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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 13:41:51,528 INFO L276 IsEmpty]: Start isEmpty. Operand 25292 states and 33080 transitions. [2022-01-10 13:41:51,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-01-10 13:41:51,537 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 13:41:51,537 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:41:51,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-10 13:41:51,537 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 13:41:51,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 13:41:51,538 INFO L85 PathProgramCache]: Analyzing trace with hash -333428232, now seen corresponding path program 1 times [2022-01-10 13:41:51,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 13:41:51,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776631762] [2022-01-10 13:41:51,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 13:41:51,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 13:41:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 13:41:51,617 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 13:41:51,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 13:41:51,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776631762] [2022-01-10 13:41:51,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776631762] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 13:41:51,618 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 13:41:51,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 13:41:51,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997685250] [2022-01-10 13:41:51,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 13:41:51,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 13:41:51,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 13:41:51,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 13:41:51,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 13:41:51,621 INFO L87 Difference]: Start difference. First operand 25292 states and 33080 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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)