/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_NONE.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 00:58:54,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 00:58:54,159 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 00:58:54,190 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 00:58:54,190 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 00:58:54,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 00:58:54,192 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 00:58:54,193 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 00:58:54,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 00:58:54,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 00:58:54,196 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 00:58:54,196 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 00:58:54,197 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 00:58:54,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 00:58:54,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 00:58:54,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 00:58:54,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 00:58:54,200 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 00:58:54,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 00:58:54,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 00:58:54,203 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 00:58:54,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 00:58:54,204 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 00:58:54,205 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 00:58:54,207 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 00:58:54,207 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 00:58:54,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 00:58:54,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 00:58:54,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 00:58:54,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 00:58:54,209 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 00:58:54,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 00:58:54,210 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 00:58:54,210 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 00:58:54,211 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 00:58:54,211 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 00:58:54,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 00:58:54,212 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 00:58:54,212 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 00:58:54,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 00:58:54,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 00:58:54,227 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-11 00:58:54,255 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 00:58:54,255 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 00:58:54,255 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 00:58:54,255 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 00:58:54,256 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 00:58:54,256 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 00:58:54,256 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 00:58:54,256 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 00:58:54,256 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 00:58:54,257 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 00:58:54,257 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 00:58:54,257 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 00:58:54,257 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 00:58:54,257 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 00:58:54,257 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 00:58:54,257 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 00:58:54,257 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 00:58:54,257 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 00:58:54,258 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 00:58:54,258 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 00:58:54,258 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 00:58:54,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:58:54,258 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 00:58:54,258 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 00:58:54,258 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 00:58:54,258 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 00:58:54,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 00:58:54,258 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 00:58:54,259 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 00:58:54,259 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 00:58:54,259 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 00:58:54,263 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 00:58:54,264 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 00:58:54,264 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE 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-11 00:58:54,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 00:58:54,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 00:58:54,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 00:58:54,452 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 00:58:54,456 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 00:58:54,457 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2022-01-11 00:58:54,524 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b192e4ce9/e851ae84fe2b44b2b0b50c9e7ddd085c/FLAG33fbd26f5 [2022-01-11 00:58:54,949 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 00:58:54,949 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c [2022-01-11 00:58:54,958 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b192e4ce9/e851ae84fe2b44b2b0b50c9e7ddd085c/FLAG33fbd26f5 [2022-01-11 00:58:55,311 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b192e4ce9/e851ae84fe2b44b2b0b50c9e7ddd085c [2022-01-11 00:58:55,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 00:58:55,314 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 00:58:55,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 00:58:55,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 00:58:55,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 00:58:55,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:58:55" (1/1) ... [2022-01-11 00:58:55,318 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c7795a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:58:55, skipping insertion in model container [2022-01-11 00:58:55,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:58:55" (1/1) ... [2022-01-11 00:58:55,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 00:58:55,373 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 00:58:55,694 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[26802,26815] [2022-01-11 00:58:55,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:58:55,841 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 00:58:55,953 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.c[26802,26815] [2022-01-11 00:58:56,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:58:56,048 INFO L208 MainTranslator]: Completed translation [2022-01-11 00:58:56,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:58:56 WrapperNode [2022-01-11 00:58:56,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 00:58:56,049 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 00:58:56,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 00:58:56,050 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 00:58:56,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:58:56" (1/1) ... [2022-01-11 00:58:56,090 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:58:56" (1/1) ... [2022-01-11 00:58:56,145 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2370 [2022-01-11 00:58:56,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 00:58:56,146 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 00:58:56,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 00:58:56,147 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 00:58:56,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:58:56" (1/1) ... [2022-01-11 00:58:56,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:58:56" (1/1) ... [2022-01-11 00:58:56,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:58:56" (1/1) ... [2022-01-11 00:58:56,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:58:56" (1/1) ... [2022-01-11 00:58:56,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:58:56" (1/1) ... [2022-01-11 00:58:56,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:58:56" (1/1) ... [2022-01-11 00:58:56,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:58:56" (1/1) ... [2022-01-11 00:58:56,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 00:58:56,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 00:58:56,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 00:58:56,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 00:58:56,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:58:56" (1/1) ... [2022-01-11 00:58:56,247 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:58:56,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:58:56,268 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-11 00:58:56,286 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-11 00:58:56,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 00:58:56,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 00:58:56,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 00:58:56,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 00:58:56,466 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 00:58:56,467 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 00:58:57,455 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 00:58:57,470 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 00:58:57,471 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-11 00:58:57,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:58:57 BoogieIcfgContainer [2022-01-11 00:58:57,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 00:58:57,474 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 00:58:57,474 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 00:58:57,475 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 00:58:57,477 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:58:57" (1/1) ... [2022-01-11 00:58:58,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:58:58 BasicIcfg [2022-01-11 00:58:58,233 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 00:58:58,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 00:58:58,235 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 00:58:58,237 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 00:58:58,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 12:58:55" (1/4) ... [2022-01-11 00:58:58,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c1bf182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:58:58, skipping insertion in model container [2022-01-11 00:58:58,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:58:56" (2/4) ... [2022-01-11 00:58:58,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c1bf182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:58:58, skipping insertion in model container [2022-01-11 00:58:58,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:58:57" (3/4) ... [2022-01-11 00:58:58,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c1bf182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 12:58:58, skipping insertion in model container [2022-01-11 00:58:58,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:58:58" (4/4) ... [2022-01-11 00:58:58,240 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+nlh-reducer.cTransformedIcfg [2022-01-11 00:58:58,246 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 00:58:58,246 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 00:58:58,287 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 00:58:58,293 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-11 00:58:58,294 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 00:58:58,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 636 states, 634 states have (on average 1.7854889589905363) internal successors, (1132), 635 states have internal predecessors, (1132), 0 states have call successors, (0), 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-11 00:58:58,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2022-01-11 00:58:58,338 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:58:58,339 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:58:58,339 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:58:58,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:58:58,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1496199358, now seen corresponding path program 1 times [2022-01-11 00:58:58,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:58:58,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040526377] [2022-01-11 00:58:58,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:58:58,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:58:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:58:58,984 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-11 00:58:58,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:58:58,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040526377] [2022-01-11 00:58:58,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040526377] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:58:58,985 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:58:58,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:58:58,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156824128] [2022-01-11 00:58:58,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:58:58,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:58:58,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:58:59,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:58:59,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:58:59,034 INFO L87 Difference]: Start difference. First operand has 636 states, 634 states have (on average 1.7854889589905363) internal successors, (1132), 635 states have internal predecessors, (1132), 0 states have call successors, (0), 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 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 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-11 00:58:59,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:58:59,222 INFO L93 Difference]: Finished difference Result 1834 states and 3265 transitions. [2022-01-11 00:58:59,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:58:59,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 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 246 [2022-01-11 00:58:59,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:58:59,243 INFO L225 Difference]: With dead ends: 1834 [2022-01-11 00:58:59,243 INFO L226 Difference]: Without dead ends: 1239 [2022-01-11 00:58:59,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:58:59,255 INFO L933 BasicCegarLoop]: 1580 mSDtfsCounter, 2735 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2735 SdHoareTripleChecker+Valid, 2649 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:58:59,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2735 Valid, 2649 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:58:59,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2022-01-11 00:58:59,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1237. [2022-01-11 00:58:59,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1236 states have (on average 1.5720064724919094) internal successors, (1943), 1236 states have internal predecessors, (1943), 0 states have call successors, (0), 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-11 00:58:59,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1943 transitions. [2022-01-11 00:58:59,357 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1943 transitions. Word has length 246 [2022-01-11 00:58:59,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:58:59,359 INFO L470 AbstractCegarLoop]: Abstraction has 1237 states and 1943 transitions. [2022-01-11 00:58:59,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 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-11 00:58:59,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1943 transitions. [2022-01-11 00:58:59,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-01-11 00:58:59,363 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:58:59,363 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:58:59,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 00:58:59,364 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:58:59,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:58:59,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1997606979, now seen corresponding path program 1 times [2022-01-11 00:58:59,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:58:59,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986762080] [2022-01-11 00:58:59,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:58:59,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:58:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:58:59,659 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-11 00:58:59,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:58:59,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986762080] [2022-01-11 00:58:59,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986762080] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:58:59,660 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:58:59,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:58:59,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879107103] [2022-01-11 00:58:59,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:58:59,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:58:59,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:58:59,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:58:59,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:58:59,663 INFO L87 Difference]: Start difference. First operand 1237 states and 1943 transitions. Second operand has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 0 states have call successors, (0), 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-11 00:58:59,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:58:59,922 INFO L93 Difference]: Finished difference Result 4831 states and 7567 transitions. [2022-01-11 00:58:59,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 00:58:59,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 0 states have call successors, (0), 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 248 [2022-01-11 00:58:59,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:58:59,936 INFO L225 Difference]: With dead ends: 4831 [2022-01-11 00:58:59,936 INFO L226 Difference]: Without dead ends: 3606 [2022-01-11 00:58:59,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-11 00:58:59,942 INFO L933 BasicCegarLoop]: 1739 mSDtfsCounter, 2801 mSDsluCounter, 2802 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2801 SdHoareTripleChecker+Valid, 4541 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:58:59,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2801 Valid, 4541 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:58:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3606 states. [2022-01-11 00:59:00,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3606 to 2420. [2022-01-11 00:59:00,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2420 states, 2419 states have (on average 1.559735427862753) internal successors, (3773), 2419 states have internal predecessors, (3773), 0 states have call successors, (0), 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-11 00:59:00,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 3773 transitions. [2022-01-11 00:59:00,054 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 3773 transitions. Word has length 248 [2022-01-11 00:59:00,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:59:00,055 INFO L470 AbstractCegarLoop]: Abstraction has 2420 states and 3773 transitions. [2022-01-11 00:59:00,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 0 states have call successors, (0), 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-11 00:59:00,056 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3773 transitions. [2022-01-11 00:59:00,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2022-01-11 00:59:00,061 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:59:00,061 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:59:00,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 00:59:00,064 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:59:00,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:59:00,068 INFO L85 PathProgramCache]: Analyzing trace with hash -133227182, now seen corresponding path program 1 times [2022-01-11 00:59:00,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:59:00,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450018628] [2022-01-11 00:59:00,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:59:00,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:59:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:59:00,218 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-11 00:59:00,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:59:00,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450018628] [2022-01-11 00:59:00,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450018628] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:59:00,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:59:00,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:59:00,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052917176] [2022-01-11 00:59:00,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:59:00,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:59:00,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:59:00,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:59:00,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:59:00,222 INFO L87 Difference]: Start difference. First operand 2420 states and 3773 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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-11 00:59:00,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:59:00,390 INFO L93 Difference]: Finished difference Result 7203 states and 11221 transitions. [2022-01-11 00:59:00,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:59:00,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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 250 [2022-01-11 00:59:00,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:59:00,406 INFO L225 Difference]: With dead ends: 7203 [2022-01-11 00:59:00,406 INFO L226 Difference]: Without dead ends: 4812 [2022-01-11 00:59:00,413 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-11 00:59:00,414 INFO L933 BasicCegarLoop]: 1974 mSDtfsCounter, 978 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 2959 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:59:00,414 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [978 Valid, 2959 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:59:00,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4812 states. [2022-01-11 00:59:00,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4812 to 2434. [2022-01-11 00:59:00,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2434 states, 2433 states have (on average 1.5577476366625564) internal successors, (3790), 2433 states have internal predecessors, (3790), 0 states have call successors, (0), 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-11 00:59:00,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 3790 transitions. [2022-01-11 00:59:00,528 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 3790 transitions. Word has length 250 [2022-01-11 00:59:00,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:59:00,528 INFO L470 AbstractCegarLoop]: Abstraction has 2434 states and 3790 transitions. [2022-01-11 00:59:00,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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-11 00:59:00,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 3790 transitions. [2022-01-11 00:59:00,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-01-11 00:59:00,555 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:59:00,555 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:59:00,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 00:59:00,555 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:59:00,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:59:00,556 INFO L85 PathProgramCache]: Analyzing trace with hash -440183781, now seen corresponding path program 1 times [2022-01-11 00:59:00,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:59:00,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826692934] [2022-01-11 00:59:00,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:59:00,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:59:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:59:00,694 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-11 00:59:00,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:59:00,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826692934] [2022-01-11 00:59:00,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826692934] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:59:00,694 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:59:00,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:59:00,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514621167] [2022-01-11 00:59:00,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:59:00,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:59:00,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:59:00,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:59:00,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:59:00,696 INFO L87 Difference]: Start difference. First operand 2434 states and 3790 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 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-11 00:59:00,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:59:00,846 INFO L93 Difference]: Finished difference Result 4940 states and 7734 transitions. [2022-01-11 00:59:00,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:59:00,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 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 252 [2022-01-11 00:59:00,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:59:00,857 INFO L225 Difference]: With dead ends: 4940 [2022-01-11 00:59:00,857 INFO L226 Difference]: Without dead ends: 3297 [2022-01-11 00:59:00,860 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-11 00:59:00,861 INFO L933 BasicCegarLoop]: 1344 mSDtfsCounter, 536 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 2127 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:59:00,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [536 Valid, 2127 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:59:00,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3297 states. [2022-01-11 00:59:01,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3297 to 2927. [2022-01-11 00:59:01,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2927 states, 2926 states have (on average 1.5745044429254955) internal successors, (4607), 2926 states have internal predecessors, (4607), 0 states have call successors, (0), 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-11 00:59:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2927 states to 2927 states and 4607 transitions. [2022-01-11 00:59:01,033 INFO L78 Accepts]: Start accepts. Automaton has 2927 states and 4607 transitions. Word has length 252 [2022-01-11 00:59:01,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:59:01,033 INFO L470 AbstractCegarLoop]: Abstraction has 2927 states and 4607 transitions. [2022-01-11 00:59:01,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 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-11 00:59:01,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2927 states and 4607 transitions. [2022-01-11 00:59:01,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-01-11 00:59:01,037 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:59:01,038 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:59:01,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 00:59:01,038 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:59:01,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:59:01,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1248328479, now seen corresponding path program 1 times [2022-01-11 00:59:01,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:59:01,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335818762] [2022-01-11 00:59:01,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:59:01,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:59:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:59:01,214 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-11 00:59:01,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:59:01,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335818762] [2022-01-11 00:59:01,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335818762] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:59:01,215 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:59:01,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:59:01,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804445703] [2022-01-11 00:59:01,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:59:01,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:59:01,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:59:01,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:59:01,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:59:01,216 INFO L87 Difference]: Start difference. First operand 2927 states and 4607 transitions. Second operand has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 0 states have call successors, (0), 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-11 00:59:01,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:59:01,762 INFO L93 Difference]: Finished difference Result 11291 states and 17737 transitions. [2022-01-11 00:59:01,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 00:59:01,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 0 states have call successors, (0), 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 252 [2022-01-11 00:59:01,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:59:01,788 INFO L225 Difference]: With dead ends: 11291 [2022-01-11 00:59:01,789 INFO L226 Difference]: Without dead ends: 8405 [2022-01-11 00:59:01,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-11 00:59:01,795 INFO L933 BasicCegarLoop]: 2086 mSDtfsCounter, 3459 mSDsluCounter, 1848 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3459 SdHoareTripleChecker+Valid, 3934 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:59:01,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3459 Valid, 3934 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:59:01,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8405 states. [2022-01-11 00:59:02,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8405 to 5604. [2022-01-11 00:59:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5604 states, 5603 states have (on average 1.5616633946100302) internal successors, (8750), 5603 states have internal predecessors, (8750), 0 states have call successors, (0), 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-11 00:59:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5604 states to 5604 states and 8750 transitions. [2022-01-11 00:59:02,134 INFO L78 Accepts]: Start accepts. Automaton has 5604 states and 8750 transitions. Word has length 252 [2022-01-11 00:59:02,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:59:02,134 INFO L470 AbstractCegarLoop]: Abstraction has 5604 states and 8750 transitions. [2022-01-11 00:59:02,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 0 states have call successors, (0), 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-11 00:59:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 5604 states and 8750 transitions. [2022-01-11 00:59:02,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-01-11 00:59:02,141 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:59:02,141 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:59:02,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 00:59:02,142 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:59:02,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:59:02,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1039514153, now seen corresponding path program 1 times [2022-01-11 00:59:02,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:59:02,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890001734] [2022-01-11 00:59:02,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:59:02,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:59:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:59:02,249 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-11 00:59:02,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:59:02,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890001734] [2022-01-11 00:59:02,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890001734] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:59:02,249 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:59:02,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:59:02,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758831569] [2022-01-11 00:59:02,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:59:02,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:59:02,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:59:02,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:59:02,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:59:02,251 INFO L87 Difference]: Start difference. First operand 5604 states and 8750 transitions. Second operand has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 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-11 00:59:03,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:59:03,063 INFO L93 Difference]: Finished difference Result 20193 states and 31318 transitions. [2022-01-11 00:59:03,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 00:59:03,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 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 252 [2022-01-11 00:59:03,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:59:03,106 INFO L225 Difference]: With dead ends: 20193 [2022-01-11 00:59:03,106 INFO L226 Difference]: Without dead ends: 15133 [2022-01-11 00:59:03,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:59:03,116 INFO L933 BasicCegarLoop]: 1631 mSDtfsCounter, 2581 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2581 SdHoareTripleChecker+Valid, 4439 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:59:03,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2581 Valid, 4439 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:59:03,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15133 states. [2022-01-11 00:59:03,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15133 to 6065. [2022-01-11 00:59:03,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6065 states, 6064 states have (on average 1.571240105540897) internal successors, (9528), 6064 states have internal predecessors, (9528), 0 states have call successors, (0), 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-11 00:59:03,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6065 states to 6065 states and 9528 transitions. [2022-01-11 00:59:03,624 INFO L78 Accepts]: Start accepts. Automaton has 6065 states and 9528 transitions. Word has length 252 [2022-01-11 00:59:03,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:59:03,625 INFO L470 AbstractCegarLoop]: Abstraction has 6065 states and 9528 transitions. [2022-01-11 00:59:03,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 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-11 00:59:03,625 INFO L276 IsEmpty]: Start isEmpty. Operand 6065 states and 9528 transitions. [2022-01-11 00:59:03,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-01-11 00:59:03,633 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:59:03,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:59:03,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 00:59:03,634 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:59:03,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:59:03,634 INFO L85 PathProgramCache]: Analyzing trace with hash 22701440, now seen corresponding path program 1 times [2022-01-11 00:59:03,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:59:03,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537454595] [2022-01-11 00:59:03,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:59:03,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:59:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:59:03,744 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-11 00:59:03,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:59:03,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537454595] [2022-01-11 00:59:03,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537454595] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:59:03,744 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:59:03,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:59:03,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857710705] [2022-01-11 00:59:03,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:59:03,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:59:03,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:59:03,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:59:03,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:59:03,746 INFO L87 Difference]: Start difference. First operand 6065 states and 9528 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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-11 00:59:04,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:59:04,275 INFO L93 Difference]: Finished difference Result 16125 states and 24989 transitions. [2022-01-11 00:59:04,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:59:04,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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 254 [2022-01-11 00:59:04,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:59:04,295 INFO L225 Difference]: With dead ends: 16125 [2022-01-11 00:59:04,296 INFO L226 Difference]: Without dead ends: 11121 [2022-01-11 00:59:04,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:59:04,304 INFO L933 BasicCegarLoop]: 1836 mSDtfsCounter, 849 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 2817 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:59:04,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [849 Valid, 2817 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:59:04,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11121 states. [2022-01-11 00:59:04,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11121 to 6157. [2022-01-11 00:59:04,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6157 states, 6156 states have (on average 1.570012995451592) internal successors, (9665), 6156 states have internal predecessors, (9665), 0 states have call successors, (0), 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-11 00:59:04,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6157 states to 6157 states and 9665 transitions. [2022-01-11 00:59:04,722 INFO L78 Accepts]: Start accepts. Automaton has 6157 states and 9665 transitions. Word has length 254 [2022-01-11 00:59:04,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:59:04,722 INFO L470 AbstractCegarLoop]: Abstraction has 6157 states and 9665 transitions. [2022-01-11 00:59:04,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 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-11 00:59:04,723 INFO L276 IsEmpty]: Start isEmpty. Operand 6157 states and 9665 transitions. [2022-01-11 00:59:04,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2022-01-11 00:59:04,730 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:59:04,730 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:59:04,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 00:59:04,731 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:59:04,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:59:04,731 INFO L85 PathProgramCache]: Analyzing trace with hash 151206626, now seen corresponding path program 1 times [2022-01-11 00:59:04,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:59:04,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100319619] [2022-01-11 00:59:04,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:59:04,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:59:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:59:04,858 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-11 00:59:04,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:59:04,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100319619] [2022-01-11 00:59:04,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100319619] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:59:04,859 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:59:04,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:59:04,859 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747584841] [2022-01-11 00:59:04,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:59:04,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:59:04,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:59:04,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:59:04,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:59:04,860 INFO L87 Difference]: Start difference. First operand 6157 states and 9665 transitions. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 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-11 00:59:05,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:59:05,797 INFO L93 Difference]: Finished difference Result 21070 states and 32737 transitions. [2022-01-11 00:59:05,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 00:59:05,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 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 254 [2022-01-11 00:59:05,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:59:05,831 INFO L225 Difference]: With dead ends: 21070 [2022-01-11 00:59:05,831 INFO L226 Difference]: Without dead ends: 15946 [2022-01-11 00:59:05,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:59:05,840 INFO L933 BasicCegarLoop]: 1976 mSDtfsCounter, 2429 mSDsluCounter, 2810 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2429 SdHoareTripleChecker+Valid, 4786 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:59:05,841 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2429 Valid, 4786 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:59:05,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15946 states. [2022-01-11 00:59:06,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15946 to 6865. [2022-01-11 00:59:06,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6865 states, 6864 states have (on average 1.585518648018648) internal successors, (10883), 6864 states have internal predecessors, (10883), 0 states have call successors, (0), 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-11 00:59:06,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6865 states to 6865 states and 10883 transitions. [2022-01-11 00:59:06,393 INFO L78 Accepts]: Start accepts. Automaton has 6865 states and 10883 transitions. Word has length 254 [2022-01-11 00:59:06,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:59:06,394 INFO L470 AbstractCegarLoop]: Abstraction has 6865 states and 10883 transitions. [2022-01-11 00:59:06,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 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-11 00:59:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 6865 states and 10883 transitions. [2022-01-11 00:59:06,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2022-01-11 00:59:06,403 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:59:06,404 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:59:06,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 00:59:06,404 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:59:06,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:59:06,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1131605833, now seen corresponding path program 1 times [2022-01-11 00:59:06,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:59:06,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125974577] [2022-01-11 00:59:06,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:59:06,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:59:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:59:06,506 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-11 00:59:06,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:59:06,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125974577] [2022-01-11 00:59:06,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125974577] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:59:06,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:59:06,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:59:06,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010695499] [2022-01-11 00:59:06,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:59:06,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:59:06,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:59:06,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:59:06,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:59:06,509 INFO L87 Difference]: Start difference. First operand 6865 states and 10883 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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-11 00:59:07,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:59:07,153 INFO L93 Difference]: Finished difference Result 16923 states and 26310 transitions. [2022-01-11 00:59:07,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:59:07,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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 256 [2022-01-11 00:59:07,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:59:07,180 INFO L225 Difference]: With dead ends: 16923 [2022-01-11 00:59:07,180 INFO L226 Difference]: Without dead ends: 11919 [2022-01-11 00:59:07,189 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-11 00:59:07,191 INFO L933 BasicCegarLoop]: 1833 mSDtfsCounter, 840 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 2814 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:59:07,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [840 Valid, 2814 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:59:07,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11919 states. [2022-01-11 00:59:07,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11919 to 6955. [2022-01-11 00:59:07,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6955 states, 6954 states have (on average 1.5789473684210527) internal successors, (10980), 6954 states have internal predecessors, (10980), 0 states have call successors, (0), 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-11 00:59:07,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6955 states to 6955 states and 10980 transitions. [2022-01-11 00:59:07,663 INFO L78 Accepts]: Start accepts. Automaton has 6955 states and 10980 transitions. Word has length 256 [2022-01-11 00:59:07,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:59:07,663 INFO L470 AbstractCegarLoop]: Abstraction has 6955 states and 10980 transitions. [2022-01-11 00:59:07,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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-11 00:59:07,664 INFO L276 IsEmpty]: Start isEmpty. Operand 6955 states and 10980 transitions. [2022-01-11 00:59:07,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-01-11 00:59:07,672 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:59:07,672 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:59:07,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 00:59:07,672 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:59:07,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:59:07,673 INFO L85 PathProgramCache]: Analyzing trace with hash 894789257, now seen corresponding path program 1 times [2022-01-11 00:59:07,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:59:07,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431689071] [2022-01-11 00:59:07,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:59:07,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:59:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:59:07,811 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-11 00:59:07,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:59:07,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431689071] [2022-01-11 00:59:07,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431689071] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:59:07,812 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:59:07,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:59:07,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197455235] [2022-01-11 00:59:07,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:59:07,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:59:07,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:59:07,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:59:07,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:59:07,813 INFO L87 Difference]: Start difference. First operand 6955 states and 10980 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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-11 00:59:08,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:59:08,553 INFO L93 Difference]: Finished difference Result 17560 states and 27242 transitions. [2022-01-11 00:59:08,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:59:08,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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 257 [2022-01-11 00:59:08,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:59:08,575 INFO L225 Difference]: With dead ends: 17560 [2022-01-11 00:59:08,575 INFO L226 Difference]: Without dead ends: 12415 [2022-01-11 00:59:08,584 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-11 00:59:08,585 INFO L933 BasicCegarLoop]: 1781 mSDtfsCounter, 848 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 2726 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:59:08,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [848 Valid, 2726 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:59:08,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12415 states. [2022-01-11 00:59:09,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12415 to 12413. [2022-01-11 00:59:09,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12413 states, 12412 states have (on average 1.5532549145987753) internal successors, (19279), 12412 states have internal predecessors, (19279), 0 states have call successors, (0), 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-11 00:59:09,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12413 states to 12413 states and 19279 transitions. [2022-01-11 00:59:09,497 INFO L78 Accepts]: Start accepts. Automaton has 12413 states and 19279 transitions. Word has length 257 [2022-01-11 00:59:09,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:59:09,497 INFO L470 AbstractCegarLoop]: Abstraction has 12413 states and 19279 transitions. [2022-01-11 00:59:09,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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-11 00:59:09,498 INFO L276 IsEmpty]: Start isEmpty. Operand 12413 states and 19279 transitions. [2022-01-11 00:59:09,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2022-01-11 00:59:09,514 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:59:09,514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:59:09,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 00:59:09,515 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:59:09,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:59:09,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1626941731, now seen corresponding path program 1 times [2022-01-11 00:59:09,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:59:09,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546225566] [2022-01-11 00:59:09,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:59:09,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:59:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:59:09,693 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-11 00:59:09,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:59:09,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546225566] [2022-01-11 00:59:09,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546225566] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:59:09,694 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:59:09,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:59:09,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406068568] [2022-01-11 00:59:09,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:59:09,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:59:09,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:59:09,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:59:09,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:59:09,695 INFO L87 Difference]: Start difference. First operand 12413 states and 19279 transitions. Second operand has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 0 states have call successors, (0), 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-11 00:59:11,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:59:11,328 INFO L93 Difference]: Finished difference Result 35585 states and 55033 transitions. [2022-01-11 00:59:11,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:59:11,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 0 states have call successors, (0), 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 258 [2022-01-11 00:59:11,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:59:11,365 INFO L225 Difference]: With dead ends: 35585 [2022-01-11 00:59:11,365 INFO L226 Difference]: Without dead ends: 23952 [2022-01-11 00:59:11,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:59:11,381 INFO L933 BasicCegarLoop]: 1376 mSDtfsCounter, 2322 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2322 SdHoareTripleChecker+Valid, 2311 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:59:11,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2322 Valid, 2311 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:59:11,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23952 states. [2022-01-11 00:59:13,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23952 to 23950. [2022-01-11 00:59:13,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23950 states, 23949 states have (on average 1.5402730802956281) internal successors, (36888), 23949 states have internal predecessors, (36888), 0 states have call successors, (0), 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-11 00:59:13,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23950 states to 23950 states and 36888 transitions. [2022-01-11 00:59:13,245 INFO L78 Accepts]: Start accepts. Automaton has 23950 states and 36888 transitions. Word has length 258 [2022-01-11 00:59:13,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:59:13,246 INFO L470 AbstractCegarLoop]: Abstraction has 23950 states and 36888 transitions. [2022-01-11 00:59:13,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 0 states have call successors, (0), 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-11 00:59:13,246 INFO L276 IsEmpty]: Start isEmpty. Operand 23950 states and 36888 transitions. [2022-01-11 00:59:13,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-01-11 00:59:13,274 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:59:13,274 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:59:13,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 00:59:13,274 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:59:13,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:59:13,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1764787050, now seen corresponding path program 1 times [2022-01-11 00:59:13,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:59:13,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412454167] [2022-01-11 00:59:13,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:59:13,275 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:59:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:59:13,440 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-11 00:59:13,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:59:13,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412454167] [2022-01-11 00:59:13,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412454167] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:59:13,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:59:13,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:59:13,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455603353] [2022-01-11 00:59:13,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:59:13,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:59:13,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:59:13,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:59:13,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:59:13,442 INFO L87 Difference]: Start difference. First operand 23950 states and 36888 transitions. Second operand has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 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-11 00:59:16,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:59:16,419 INFO L93 Difference]: Finished difference Result 63335 states and 97255 transitions. [2022-01-11 00:59:16,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 00:59:16,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 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 260 [2022-01-11 00:59:16,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:59:16,477 INFO L225 Difference]: With dead ends: 63335 [2022-01-11 00:59:16,477 INFO L226 Difference]: Without dead ends: 39822 [2022-01-11 00:59:16,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-11 00:59:16,501 INFO L933 BasicCegarLoop]: 1345 mSDtfsCounter, 2904 mSDsluCounter, 2676 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2904 SdHoareTripleChecker+Valid, 4021 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:59:16,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2904 Valid, 4021 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:59:16,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39822 states. [2022-01-11 00:59:18,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39822 to 25610. [2022-01-11 00:59:18,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25610 states, 25609 states have (on average 1.5493381233160217) internal successors, (39677), 25609 states have internal predecessors, (39677), 0 states have call successors, (0), 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-11 00:59:19,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25610 states to 25610 states and 39677 transitions. [2022-01-11 00:59:19,012 INFO L78 Accepts]: Start accepts. Automaton has 25610 states and 39677 transitions. Word has length 260 [2022-01-11 00:59:19,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:59:19,013 INFO L470 AbstractCegarLoop]: Abstraction has 25610 states and 39677 transitions. [2022-01-11 00:59:19,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.0) internal successors, (260), 5 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-11 00:59:19,013 INFO L276 IsEmpty]: Start isEmpty. Operand 25610 states and 39677 transitions. [2022-01-11 00:59:19,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2022-01-11 00:59:19,037 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:59:19,037 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:59:19,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 00:59:19,037 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:59:19,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:59:19,038 INFO L85 PathProgramCache]: Analyzing trace with hash -2047113195, now seen corresponding path program 1 times [2022-01-11 00:59:19,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:59:19,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129970127] [2022-01-11 00:59:19,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:59:19,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:59:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:59:19,180 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-11 00:59:19,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:59:19,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129970127] [2022-01-11 00:59:19,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129970127] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:59:19,180 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:59:19,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:59:19,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979492414] [2022-01-11 00:59:19,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:59:19,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:59:19,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:59:19,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:59:19,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:59:19,181 INFO L87 Difference]: Start difference. First operand 25610 states and 39677 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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-11 00:59:23,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:59:23,174 INFO L93 Difference]: Finished difference Result 74899 states and 115767 transitions. [2022-01-11 00:59:23,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:59:23,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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 262 [2022-01-11 00:59:23,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:59:23,249 INFO L225 Difference]: With dead ends: 74899 [2022-01-11 00:59:23,249 INFO L226 Difference]: Without dead ends: 50298 [2022-01-11 00:59:23,272 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-11 00:59:23,273 INFO L933 BasicCegarLoop]: 1935 mSDtfsCounter, 942 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 2917 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:59:23,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [942 Valid, 2917 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:59:23,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50298 states. [2022-01-11 00:59:25,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50298 to 25974. [2022-01-11 00:59:25,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25974 states, 25973 states have (on average 1.5442959996919878) internal successors, (40110), 25973 states have internal predecessors, (40110), 0 states have call successors, (0), 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-11 00:59:25,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25974 states to 25974 states and 40110 transitions. [2022-01-11 00:59:25,730 INFO L78 Accepts]: Start accepts. Automaton has 25974 states and 40110 transitions. Word has length 262 [2022-01-11 00:59:25,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:59:25,730 INFO L470 AbstractCegarLoop]: Abstraction has 25974 states and 40110 transitions. [2022-01-11 00:59:25,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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-11 00:59:25,730 INFO L276 IsEmpty]: Start isEmpty. Operand 25974 states and 40110 transitions. [2022-01-11 00:59:25,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-01-11 00:59:25,754 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:59:25,755 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:59:25,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 00:59:25,755 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:59:25,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:59:25,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1463851587, now seen corresponding path program 1 times [2022-01-11 00:59:25,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:59:25,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678358194] [2022-01-11 00:59:25,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:59:25,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:59:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:59:25,908 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-11 00:59:25,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:59:25,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678358194] [2022-01-11 00:59:25,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678358194] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:59:25,908 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:59:25,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:59:25,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044843820] [2022-01-11 00:59:25,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:59:25,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:59:25,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:59:25,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:59:25,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:59:25,910 INFO L87 Difference]: Start difference. First operand 25974 states and 40110 transitions. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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-11 00:59:29,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:59:29,083 INFO L93 Difference]: Finished difference Result 50246 states and 78400 transitions. [2022-01-11 00:59:29,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:59:29,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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 263 [2022-01-11 00:59:29,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:59:29,135 INFO L225 Difference]: With dead ends: 50246 [2022-01-11 00:59:29,135 INFO L226 Difference]: Without dead ends: 35134 [2022-01-11 00:59:29,147 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-11 00:59:29,148 INFO L933 BasicCegarLoop]: 1326 mSDtfsCounter, 522 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 2095 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:59:29,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [522 Valid, 2095 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:59:29,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35134 states. [2022-01-11 00:59:32,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35134 to 32372. [2022-01-11 00:59:32,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32372 states, 32371 states have (on average 1.5627567884835192) internal successors, (50588), 32371 states have internal predecessors, (50588), 0 states have call successors, (0), 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-11 00:59:32,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32372 states to 32372 states and 50588 transitions. [2022-01-11 00:59:32,267 INFO L78 Accepts]: Start accepts. Automaton has 32372 states and 50588 transitions. Word has length 263 [2022-01-11 00:59:32,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:59:32,267 INFO L470 AbstractCegarLoop]: Abstraction has 32372 states and 50588 transitions. [2022-01-11 00:59:32,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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-11 00:59:32,267 INFO L276 IsEmpty]: Start isEmpty. Operand 32372 states and 50588 transitions. [2022-01-11 00:59:32,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2022-01-11 00:59:32,302 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:59:32,303 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:59:32,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 00:59:32,303 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:59:32,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:59:32,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1835084092, now seen corresponding path program 1 times [2022-01-11 00:59:32,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:59:32,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798093415] [2022-01-11 00:59:32,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:59:32,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:59:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:59:32,501 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-11 00:59:32,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:59:32,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798093415] [2022-01-11 00:59:32,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798093415] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:59:32,502 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:59:32,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:59:32,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389696188] [2022-01-11 00:59:32,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:59:32,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:59:32,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:59:32,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:59:32,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:59:32,503 INFO L87 Difference]: Start difference. First operand 32372 states and 50588 transitions. Second operand has 5 states, 5 states have (on average 52.8) internal successors, (264), 5 states have internal predecessors, (264), 0 states have call successors, (0), 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-11 00:59:38,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:59:38,322 INFO L93 Difference]: Finished difference Result 92196 states and 143840 transitions. [2022-01-11 00:59:38,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:59:38,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 52.8) internal successors, (264), 5 states have internal predecessors, (264), 0 states have call successors, (0), 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 264 [2022-01-11 00:59:38,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:59:38,427 INFO L225 Difference]: With dead ends: 92196 [2022-01-11 00:59:38,427 INFO L226 Difference]: Without dead ends: 60939 [2022-01-11 00:59:38,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:59:38,457 INFO L933 BasicCegarLoop]: 1572 mSDtfsCounter, 1868 mSDsluCounter, 1866 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1868 SdHoareTripleChecker+Valid, 3438 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:59:38,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1868 Valid, 3438 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:59:38,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60939 states. [2022-01-11 00:59:44,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60939 to 60891. [2022-01-11 00:59:44,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60891 states, 60890 states have (on average 1.5477089834127113) internal successors, (94240), 60890 states have internal predecessors, (94240), 0 states have call successors, (0), 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-11 00:59:44,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60891 states to 60891 states and 94240 transitions. [2022-01-11 00:59:44,847 INFO L78 Accepts]: Start accepts. Automaton has 60891 states and 94240 transitions. Word has length 264 [2022-01-11 00:59:44,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:59:44,848 INFO L470 AbstractCegarLoop]: Abstraction has 60891 states and 94240 transitions. [2022-01-11 00:59:44,848 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.8) internal successors, (264), 5 states have internal predecessors, (264), 0 states have call successors, (0), 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-11 00:59:44,848 INFO L276 IsEmpty]: Start isEmpty. Operand 60891 states and 94240 transitions. [2022-01-11 00:59:44,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2022-01-11 00:59:44,898 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:59:44,898 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 00:59:44,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 00:59:44,898 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:59:44,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:59:44,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1097637310, now seen corresponding path program 1 times [2022-01-11 00:59:44,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:59:44,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714536750] [2022-01-11 00:59:44,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:59:44,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:59:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:59:45,041 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-11 00:59:45,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:59:45,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714536750] [2022-01-11 00:59:45,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714536750] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:59:45,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:59:45,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:59:45,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665877080] [2022-01-11 00:59:45,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:59:45,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:59:45,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:59:45,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:59:45,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:59:45,043 INFO L87 Difference]: Start difference. First operand 60891 states and 94240 transitions. Second operand has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 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-11 01:00:01,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:00:01,355 INFO L93 Difference]: Finished difference Result 206695 states and 318359 transitions. [2022-01-11 01:00:01,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 01:00:01,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 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 264 [2022-01-11 01:00:01,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted.