/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/systemc/transmitter.10.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 00:19:36,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 00:19:36,934 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 00:19:36,984 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 00:19:36,985 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 00:19:36,987 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 00:19:36,989 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 00:19:36,997 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 00:19:36,998 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 00:19:37,001 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 00:19:37,002 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 00:19:37,003 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 00:19:37,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 00:19:37,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 00:19:37,006 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 00:19:37,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 00:19:37,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 00:19:37,009 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 00:19:37,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 00:19:37,015 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 00:19:37,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 00:19:37,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 00:19:37,017 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 00:19:37,018 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 00:19:37,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 00:19:37,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 00:19:37,023 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 00:19:37,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 00:19:37,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 00:19:37,024 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 00:19:37,024 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 00:19:37,025 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 00:19:37,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 00:19:37,026 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 00:19:37,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 00:19:37,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 00:19:37,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 00:19:37,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 00:19:37,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 00:19:37,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 00:19:37,029 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 00:19:37,030 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:19:37,054 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 00:19:37,054 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 00:19:37,055 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 00:19:37,055 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 00:19:37,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 00:19:37,056 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 00:19:37,056 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 00:19:37,056 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 00:19:37,056 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 00:19:37,056 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 00:19:37,057 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 00:19:37,057 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 00:19:37,057 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 00:19:37,057 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 00:19:37,057 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 00:19:37,057 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 00:19:37,058 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 00:19:37,058 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 00:19:37,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 00:19:37,058 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 00:19:37,058 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 00:19:37,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:19:37,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 00:19:37,059 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 00:19:37,059 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 00:19:37,059 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 00:19:37,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 00:19:37,059 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 00:19:37,059 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 00:19:37,060 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 00:19:37,060 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 00:19:37,060 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 00:19:37,060 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 00:19:37,060 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:19:37,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 00:19:37,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 00:19:37,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 00:19:37,279 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 00:19:37,280 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 00:19:37,280 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.10.cil.c [2022-01-11 00:19:37,329 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d5e75821/4b8b9743492749dbbd9dd3f3771330e9/FLAG53d25bc13 [2022-01-11 00:19:37,713 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 00:19:37,713 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.10.cil.c [2022-01-11 00:19:37,725 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d5e75821/4b8b9743492749dbbd9dd3f3771330e9/FLAG53d25bc13 [2022-01-11 00:19:37,740 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d5e75821/4b8b9743492749dbbd9dd3f3771330e9 [2022-01-11 00:19:37,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 00:19:37,744 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 00:19:37,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 00:19:37,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 00:19:37,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 00:19:37,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:19:37" (1/1) ... [2022-01-11 00:19:37,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58eeabd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:37, skipping insertion in model container [2022-01-11 00:19:37,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:19:37" (1/1) ... [2022-01-11 00:19:37,755 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 00:19:37,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 00:19:37,958 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.10.cil.c[706,719] [2022-01-11 00:19:38,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:19:38,093 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 00:19:38,101 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.10.cil.c[706,719] [2022-01-11 00:19:38,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:19:38,159 INFO L208 MainTranslator]: Completed translation [2022-01-11 00:19:38,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:38 WrapperNode [2022-01-11 00:19:38,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 00:19:38,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 00:19:38,160 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 00:19:38,161 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 00:19:38,165 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:19:38" (1/1) ... [2022-01-11 00:19:38,174 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:19:38" (1/1) ... [2022-01-11 00:19:38,239 INFO L137 Inliner]: procedures = 48, calls = 60, calls flagged for inlining = 55, calls inlined = 196, statements flattened = 2994 [2022-01-11 00:19:38,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 00:19:38,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 00:19:38,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 00:19:38,240 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 00:19:38,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:38" (1/1) ... [2022-01-11 00:19:38,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:38" (1/1) ... [2022-01-11 00:19:38,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:38" (1/1) ... [2022-01-11 00:19:38,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:38" (1/1) ... [2022-01-11 00:19:38,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:38" (1/1) ... [2022-01-11 00:19:38,313 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:38" (1/1) ... [2022-01-11 00:19:38,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:38" (1/1) ... [2022-01-11 00:19:38,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 00:19:38,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 00:19:38,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 00:19:38,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 00:19:38,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:38" (1/1) ... [2022-01-11 00:19:38,341 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:19:38,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:19:38,375 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:19:38,387 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:19:38,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 00:19:38,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 00:19:38,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 00:19:38,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 00:19:38,540 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 00:19:38,541 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 00:19:39,888 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 00:19:39,902 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 00:19:39,902 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-01-11 00:19:39,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:19:39 BoogieIcfgContainer [2022-01-11 00:19:39,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 00:19:39,905 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 00:19:39,905 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 00:19:39,906 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 00:19:39,908 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:19:39" (1/1) ... [2022-01-11 00:19:40,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:19:40 BasicIcfg [2022-01-11 00:19:40,186 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 00:19:40,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 00:19:40,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 00:19:40,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 00:19:40,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 12:19:37" (1/4) ... [2022-01-11 00:19:40,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397f1e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:19:40, skipping insertion in model container [2022-01-11 00:19:40,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:19:38" (2/4) ... [2022-01-11 00:19:40,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397f1e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:19:40, skipping insertion in model container [2022-01-11 00:19:40,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:19:39" (3/4) ... [2022-01-11 00:19:40,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397f1e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 12:19:40, skipping insertion in model container [2022-01-11 00:19:40,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:19:40" (4/4) ... [2022-01-11 00:19:40,191 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.10.cil.cTransformedIcfg [2022-01-11 00:19:40,194 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 00:19:40,194 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 00:19:40,225 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 00:19:40,229 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:19:40,229 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 00:19:40,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 1286 states, 1284 states have (on average 1.5101246105919004) internal successors, (1939), 1285 states have internal predecessors, (1939), 0 states have call successors, (0), 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:19:40,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:19:40,260 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:40,260 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] [2022-01-11 00:19:40,261 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:40,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:40,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1173440667, now seen corresponding path program 1 times [2022-01-11 00:19:40,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:40,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435258885] [2022-01-11 00:19:40,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:40,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:40,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:40,525 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:19:40,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:40,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435258885] [2022-01-11 00:19:40,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435258885] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:40,526 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:40,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:40,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766921611] [2022-01-11 00:19:40,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:40,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:40,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:40,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:40,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:40,560 INFO L87 Difference]: Start difference. First operand has 1286 states, 1284 states have (on average 1.5101246105919004) internal successors, (1939), 1285 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:40,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:40,805 INFO L93 Difference]: Finished difference Result 3623 states and 5450 transitions. [2022-01-11 00:19:40,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:40,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2022-01-11 00:19:40,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:40,828 INFO L225 Difference]: With dead ends: 3623 [2022-01-11 00:19:40,828 INFO L226 Difference]: Without dead ends: 2346 [2022-01-11 00:19:40,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:40,839 INFO L933 BasicCegarLoop]: 1890 mSDtfsCounter, 1763 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1763 SdHoareTripleChecker+Valid, 3545 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:40,840 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1763 Valid, 3545 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:19:40,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2022-01-11 00:19:40,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2343. [2022-01-11 00:19:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 2342 states have (on average 1.475661827497865) internal successors, (3456), 2342 states have internal predecessors, (3456), 0 states have call successors, (0), 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:19:40,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3456 transitions. [2022-01-11 00:19:40,950 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3456 transitions. Word has length 150 [2022-01-11 00:19:40,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:40,951 INFO L470 AbstractCegarLoop]: Abstraction has 2343 states and 3456 transitions. [2022-01-11 00:19:40,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:40,953 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3456 transitions. [2022-01-11 00:19:40,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:19:40,962 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:40,962 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] [2022-01-11 00:19:40,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 00:19:40,963 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:40,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:40,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1865257988, now seen corresponding path program 1 times [2022-01-11 00:19:40,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:40,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110528240] [2022-01-11 00:19:40,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:40,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:41,081 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:19:41,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:41,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110528240] [2022-01-11 00:19:41,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110528240] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:41,082 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:41,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:41,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029384038] [2022-01-11 00:19:41,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:41,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:41,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:41,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:41,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:41,084 INFO L87 Difference]: Start difference. First operand 2343 states and 3456 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:41,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:41,142 INFO L93 Difference]: Finished difference Result 4667 states and 6880 transitions. [2022-01-11 00:19:41,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:41,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2022-01-11 00:19:41,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:41,149 INFO L225 Difference]: With dead ends: 4667 [2022-01-11 00:19:41,149 INFO L226 Difference]: Without dead ends: 2343 [2022-01-11 00:19:41,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:41,157 INFO L933 BasicCegarLoop]: 1892 mSDtfsCounter, 1879 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1879 SdHoareTripleChecker+Valid, 1892 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:41,157 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1879 Valid, 1892 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:41,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2022-01-11 00:19:41,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2343. [2022-01-11 00:19:41,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 2342 states have (on average 1.4722459436379163) internal successors, (3448), 2342 states have internal predecessors, (3448), 0 states have call successors, (0), 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:19:41,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3448 transitions. [2022-01-11 00:19:41,216 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3448 transitions. Word has length 150 [2022-01-11 00:19:41,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:41,218 INFO L470 AbstractCegarLoop]: Abstraction has 2343 states and 3448 transitions. [2022-01-11 00:19:41,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:41,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3448 transitions. [2022-01-11 00:19:41,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:19:41,220 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:41,221 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] [2022-01-11 00:19:41,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 00:19:41,223 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:41,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:41,229 INFO L85 PathProgramCache]: Analyzing trace with hash 984973762, now seen corresponding path program 1 times [2022-01-11 00:19:41,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:41,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608830055] [2022-01-11 00:19:41,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:41,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:41,307 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:19:41,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:41,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608830055] [2022-01-11 00:19:41,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608830055] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:41,308 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:41,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:41,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871487972] [2022-01-11 00:19:41,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:41,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:41,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:41,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:41,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:41,309 INFO L87 Difference]: Start difference. First operand 2343 states and 3448 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:41,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:41,374 INFO L93 Difference]: Finished difference Result 4666 states and 6863 transitions. [2022-01-11 00:19:41,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:41,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2022-01-11 00:19:41,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:41,381 INFO L225 Difference]: With dead ends: 4666 [2022-01-11 00:19:41,382 INFO L226 Difference]: Without dead ends: 2343 [2022-01-11 00:19:41,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:41,390 INFO L933 BasicCegarLoop]: 1887 mSDtfsCounter, 1873 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1873 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:41,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1873 Valid, 1887 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:41,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2022-01-11 00:19:41,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2343. [2022-01-11 00:19:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 2342 states have (on average 1.4688300597779675) internal successors, (3440), 2342 states have internal predecessors, (3440), 0 states have call successors, (0), 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:19:41,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3440 transitions. [2022-01-11 00:19:41,482 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3440 transitions. Word has length 150 [2022-01-11 00:19:41,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:41,483 INFO L470 AbstractCegarLoop]: Abstraction has 2343 states and 3440 transitions. [2022-01-11 00:19:41,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:41,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3440 transitions. [2022-01-11 00:19:41,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:19:41,484 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:41,484 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] [2022-01-11 00:19:41,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 00:19:41,485 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:41,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:41,485 INFO L85 PathProgramCache]: Analyzing trace with hash 263840836, now seen corresponding path program 1 times [2022-01-11 00:19:41,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:41,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306309599] [2022-01-11 00:19:41,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:41,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:41,539 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:19:41,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:41,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306309599] [2022-01-11 00:19:41,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306309599] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:41,539 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:41,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:41,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535552979] [2022-01-11 00:19:41,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:41,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:41,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:41,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:41,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:41,541 INFO L87 Difference]: Start difference. First operand 2343 states and 3440 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:41,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:41,622 INFO L93 Difference]: Finished difference Result 4665 states and 6846 transitions. [2022-01-11 00:19:41,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:41,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2022-01-11 00:19:41,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:41,629 INFO L225 Difference]: With dead ends: 4665 [2022-01-11 00:19:41,629 INFO L226 Difference]: Without dead ends: 2343 [2022-01-11 00:19:41,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:41,635 INFO L933 BasicCegarLoop]: 1882 mSDtfsCounter, 1867 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1867 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:41,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1867 Valid, 1882 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:41,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2022-01-11 00:19:41,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2343. [2022-01-11 00:19:41,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 2342 states have (on average 1.4654141759180188) internal successors, (3432), 2342 states have internal predecessors, (3432), 0 states have call successors, (0), 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:19:41,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3432 transitions. [2022-01-11 00:19:41,697 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3432 transitions. Word has length 150 [2022-01-11 00:19:41,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:41,697 INFO L470 AbstractCegarLoop]: Abstraction has 2343 states and 3432 transitions. [2022-01-11 00:19:41,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:41,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3432 transitions. [2022-01-11 00:19:41,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:19:41,699 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:41,699 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] [2022-01-11 00:19:41,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 00:19:41,699 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:41,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:41,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1421989502, now seen corresponding path program 1 times [2022-01-11 00:19:41,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:41,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35025246] [2022-01-11 00:19:41,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:41,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:41,770 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:19:41,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:41,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35025246] [2022-01-11 00:19:41,770 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35025246] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:41,771 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:41,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:41,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864657693] [2022-01-11 00:19:41,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:41,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:41,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:41,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:41,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:41,773 INFO L87 Difference]: Start difference. First operand 2343 states and 3432 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:41,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:41,861 INFO L93 Difference]: Finished difference Result 4664 states and 6829 transitions. [2022-01-11 00:19:41,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:41,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2022-01-11 00:19:41,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:41,869 INFO L225 Difference]: With dead ends: 4664 [2022-01-11 00:19:41,869 INFO L226 Difference]: Without dead ends: 2343 [2022-01-11 00:19:41,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:41,873 INFO L933 BasicCegarLoop]: 1877 mSDtfsCounter, 1861 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1861 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:41,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1861 Valid, 1877 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:41,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2022-01-11 00:19:41,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2343. [2022-01-11 00:19:41,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 2342 states have (on average 1.46199829205807) internal successors, (3424), 2342 states have internal predecessors, (3424), 0 states have call successors, (0), 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:19:41,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3424 transitions. [2022-01-11 00:19:41,966 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3424 transitions. Word has length 150 [2022-01-11 00:19:41,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:41,967 INFO L470 AbstractCegarLoop]: Abstraction has 2343 states and 3424 transitions. [2022-01-11 00:19:41,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:41,970 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3424 transitions. [2022-01-11 00:19:41,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:19:41,972 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:41,972 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] [2022-01-11 00:19:41,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 00:19:41,972 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:41,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:41,973 INFO L85 PathProgramCache]: Analyzing trace with hash 463291524, now seen corresponding path program 1 times [2022-01-11 00:19:41,973 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:41,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133605222] [2022-01-11 00:19:41,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:41,973 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:42,042 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:19:42,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:42,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133605222] [2022-01-11 00:19:42,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133605222] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:42,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:42,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:42,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445408079] [2022-01-11 00:19:42,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:42,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:42,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:42,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:42,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:42,044 INFO L87 Difference]: Start difference. First operand 2343 states and 3424 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:42,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:42,135 INFO L93 Difference]: Finished difference Result 4663 states and 6812 transitions. [2022-01-11 00:19:42,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:42,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2022-01-11 00:19:42,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:42,143 INFO L225 Difference]: With dead ends: 4663 [2022-01-11 00:19:42,143 INFO L226 Difference]: Without dead ends: 2343 [2022-01-11 00:19:42,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:42,147 INFO L933 BasicCegarLoop]: 1872 mSDtfsCounter, 1855 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1855 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:42,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1855 Valid, 1872 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:42,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2022-01-11 00:19:42,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2343. [2022-01-11 00:19:42,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 2342 states have (on average 1.4585824081981213) internal successors, (3416), 2342 states have internal predecessors, (3416), 0 states have call successors, (0), 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:19:42,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3416 transitions. [2022-01-11 00:19:42,232 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3416 transitions. Word has length 150 [2022-01-11 00:19:42,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:42,232 INFO L470 AbstractCegarLoop]: Abstraction has 2343 states and 3416 transitions. [2022-01-11 00:19:42,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:42,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3416 transitions. [2022-01-11 00:19:42,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:19:42,233 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:42,234 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] [2022-01-11 00:19:42,234 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 00:19:42,234 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:42,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:42,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1632485698, now seen corresponding path program 1 times [2022-01-11 00:19:42,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:42,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007505970] [2022-01-11 00:19:42,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:42,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:42,266 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:19:42,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:42,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007505970] [2022-01-11 00:19:42,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007505970] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:42,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:42,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:42,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447459015] [2022-01-11 00:19:42,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:42,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:42,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:42,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:42,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:42,267 INFO L87 Difference]: Start difference. First operand 2343 states and 3416 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:42,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:42,338 INFO L93 Difference]: Finished difference Result 4662 states and 6795 transitions. [2022-01-11 00:19:42,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:42,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2022-01-11 00:19:42,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:42,345 INFO L225 Difference]: With dead ends: 4662 [2022-01-11 00:19:42,346 INFO L226 Difference]: Without dead ends: 2343 [2022-01-11 00:19:42,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:42,350 INFO L933 BasicCegarLoop]: 1867 mSDtfsCounter, 1849 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1849 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:42,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1849 Valid, 1867 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:42,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2022-01-11 00:19:42,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2343. [2022-01-11 00:19:42,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 2342 states have (on average 1.4551665243381724) internal successors, (3408), 2342 states have internal predecessors, (3408), 0 states have call successors, (0), 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:19:42,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3408 transitions. [2022-01-11 00:19:42,417 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3408 transitions. Word has length 150 [2022-01-11 00:19:42,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:42,417 INFO L470 AbstractCegarLoop]: Abstraction has 2343 states and 3408 transitions. [2022-01-11 00:19:42,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:42,417 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3408 transitions. [2022-01-11 00:19:42,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:19:42,418 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:42,418 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] [2022-01-11 00:19:42,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 00:19:42,418 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:42,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:42,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1654934332, now seen corresponding path program 1 times [2022-01-11 00:19:42,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:42,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750165495] [2022-01-11 00:19:42,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:42,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:42,449 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:19:42,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:42,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750165495] [2022-01-11 00:19:42,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750165495] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:42,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:42,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:42,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912015972] [2022-01-11 00:19:42,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:42,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:42,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:42,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:42,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:42,450 INFO L87 Difference]: Start difference. First operand 2343 states and 3408 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:42,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:42,531 INFO L93 Difference]: Finished difference Result 4661 states and 6778 transitions. [2022-01-11 00:19:42,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:42,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2022-01-11 00:19:42,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:42,538 INFO L225 Difference]: With dead ends: 4661 [2022-01-11 00:19:42,538 INFO L226 Difference]: Without dead ends: 2343 [2022-01-11 00:19:42,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:42,542 INFO L933 BasicCegarLoop]: 1862 mSDtfsCounter, 1843 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1843 SdHoareTripleChecker+Valid, 1862 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:42,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1843 Valid, 1862 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:42,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2022-01-11 00:19:42,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2343. [2022-01-11 00:19:42,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 2342 states have (on average 1.4517506404782237) internal successors, (3400), 2342 states have internal predecessors, (3400), 0 states have call successors, (0), 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:19:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3400 transitions. [2022-01-11 00:19:42,635 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3400 transitions. Word has length 150 [2022-01-11 00:19:42,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:42,635 INFO L470 AbstractCegarLoop]: Abstraction has 2343 states and 3400 transitions. [2022-01-11 00:19:42,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:42,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3400 transitions. [2022-01-11 00:19:42,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:19:42,636 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:42,636 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] [2022-01-11 00:19:42,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 00:19:42,637 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:42,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:42,637 INFO L85 PathProgramCache]: Analyzing trace with hash -236959486, now seen corresponding path program 1 times [2022-01-11 00:19:42,637 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:42,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355803881] [2022-01-11 00:19:42,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:42,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:42,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:19:42,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:42,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355803881] [2022-01-11 00:19:42,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355803881] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:42,674 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:42,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:42,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255285987] [2022-01-11 00:19:42,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:42,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:42,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:42,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:42,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:42,675 INFO L87 Difference]: Start difference. First operand 2343 states and 3400 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:42,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:42,765 INFO L93 Difference]: Finished difference Result 4659 states and 6759 transitions. [2022-01-11 00:19:42,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:42,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2022-01-11 00:19:42,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:42,774 INFO L225 Difference]: With dead ends: 4659 [2022-01-11 00:19:42,774 INFO L226 Difference]: Without dead ends: 2343 [2022-01-11 00:19:42,779 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:42,779 INFO L933 BasicCegarLoop]: 1857 mSDtfsCounter, 1836 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1836 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:42,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1836 Valid, 1857 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:42,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2022-01-11 00:19:42,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2343. [2022-01-11 00:19:42,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 2342 states have (on average 1.448334756618275) internal successors, (3392), 2342 states have internal predecessors, (3392), 0 states have call successors, (0), 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:19:42,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3392 transitions. [2022-01-11 00:19:42,859 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3392 transitions. Word has length 150 [2022-01-11 00:19:42,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:42,859 INFO L470 AbstractCegarLoop]: Abstraction has 2343 states and 3392 transitions. [2022-01-11 00:19:42,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:42,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3392 transitions. [2022-01-11 00:19:42,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:19:42,861 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:42,861 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] [2022-01-11 00:19:42,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 00:19:42,861 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:42,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:42,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2108107584, now seen corresponding path program 1 times [2022-01-11 00:19:42,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:42,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767755904] [2022-01-11 00:19:42,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:42,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:42,903 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:19:42,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:42,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767755904] [2022-01-11 00:19:42,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767755904] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:42,904 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:42,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:42,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055397021] [2022-01-11 00:19:42,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:42,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:42,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:42,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:42,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:42,905 INFO L87 Difference]: Start difference. First operand 2343 states and 3392 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:43,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:43,018 INFO L93 Difference]: Finished difference Result 4658 states and 6742 transitions. [2022-01-11 00:19:43,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:43,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2022-01-11 00:19:43,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:43,025 INFO L225 Difference]: With dead ends: 4658 [2022-01-11 00:19:43,025 INFO L226 Difference]: Without dead ends: 2343 [2022-01-11 00:19:43,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:43,028 INFO L933 BasicCegarLoop]: 1828 mSDtfsCounter, 1706 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1706 SdHoareTripleChecker+Valid, 1936 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:43,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1706 Valid, 1936 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:43,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2022-01-11 00:19:43,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2343. [2022-01-11 00:19:43,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 2342 states have (on average 1.435525192143467) internal successors, (3362), 2342 states have internal predecessors, (3362), 0 states have call successors, (0), 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:19:43,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3362 transitions. [2022-01-11 00:19:43,099 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3362 transitions. Word has length 150 [2022-01-11 00:19:43,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:43,100 INFO L470 AbstractCegarLoop]: Abstraction has 2343 states and 3362 transitions. [2022-01-11 00:19:43,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:43,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3362 transitions. [2022-01-11 00:19:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:19:43,101 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:43,101 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] [2022-01-11 00:19:43,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 00:19:43,101 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:43,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:43,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2002574435, now seen corresponding path program 1 times [2022-01-11 00:19:43,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:43,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954209586] [2022-01-11 00:19:43,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:43,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:43,133 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:19:43,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:43,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954209586] [2022-01-11 00:19:43,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954209586] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:43,134 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:43,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:43,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896220737] [2022-01-11 00:19:43,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:43,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:43,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:43,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:43,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:43,135 INFO L87 Difference]: Start difference. First operand 2343 states and 3362 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:43,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:43,230 INFO L93 Difference]: Finished difference Result 4657 states and 6681 transitions. [2022-01-11 00:19:43,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:43,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2022-01-11 00:19:43,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:43,237 INFO L225 Difference]: With dead ends: 4657 [2022-01-11 00:19:43,237 INFO L226 Difference]: Without dead ends: 2343 [2022-01-11 00:19:43,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:43,241 INFO L933 BasicCegarLoop]: 1811 mSDtfsCounter, 1689 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:43,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1689 Valid, 1918 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:43,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2022-01-11 00:19:43,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2343. [2022-01-11 00:19:43,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 2342 states have (on average 1.4227156276686592) internal successors, (3332), 2342 states have internal predecessors, (3332), 0 states have call successors, (0), 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:19:43,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3332 transitions. [2022-01-11 00:19:43,359 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3332 transitions. Word has length 150 [2022-01-11 00:19:43,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:43,359 INFO L470 AbstractCegarLoop]: Abstraction has 2343 states and 3332 transitions. [2022-01-11 00:19:43,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:43,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3332 transitions. [2022-01-11 00:19:43,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:19:43,361 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:43,361 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] [2022-01-11 00:19:43,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 00:19:43,362 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:43,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:43,362 INFO L85 PathProgramCache]: Analyzing trace with hash -312316030, now seen corresponding path program 1 times [2022-01-11 00:19:43,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:43,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676847738] [2022-01-11 00:19:43,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:43,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:43,406 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:19:43,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:43,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676847738] [2022-01-11 00:19:43,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676847738] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:43,407 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:43,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:43,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987343528] [2022-01-11 00:19:43,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:43,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:43,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:43,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:43,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:43,408 INFO L87 Difference]: Start difference. First operand 2343 states and 3332 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:43,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:43,552 INFO L93 Difference]: Finished difference Result 4656 states and 6620 transitions. [2022-01-11 00:19:43,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:43,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2022-01-11 00:19:43,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:43,567 INFO L225 Difference]: With dead ends: 4656 [2022-01-11 00:19:43,567 INFO L226 Difference]: Without dead ends: 2343 [2022-01-11 00:19:43,570 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:43,572 INFO L933 BasicCegarLoop]: 1794 mSDtfsCounter, 1672 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1672 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:43,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1672 Valid, 1900 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:43,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2022-01-11 00:19:43,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2343. [2022-01-11 00:19:43,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 2342 states have (on average 1.4099060631938514) internal successors, (3302), 2342 states have internal predecessors, (3302), 0 states have call successors, (0), 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:19:43,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3302 transitions. [2022-01-11 00:19:43,661 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3302 transitions. Word has length 150 [2022-01-11 00:19:43,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:43,662 INFO L470 AbstractCegarLoop]: Abstraction has 2343 states and 3302 transitions. [2022-01-11 00:19:43,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:43,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3302 transitions. [2022-01-11 00:19:43,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:19:43,664 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:43,664 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] [2022-01-11 00:19:43,664 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 00:19:43,664 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:43,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:43,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1797482203, now seen corresponding path program 1 times [2022-01-11 00:19:43,665 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:43,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801368341] [2022-01-11 00:19:43,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:43,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:43,697 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:19:43,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:43,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801368341] [2022-01-11 00:19:43,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801368341] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:43,698 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:43,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:43,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941414542] [2022-01-11 00:19:43,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:43,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:43,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:43,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:43,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:43,699 INFO L87 Difference]: Start difference. First operand 2343 states and 3302 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:43,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:43,818 INFO L93 Difference]: Finished difference Result 4655 states and 6559 transitions. [2022-01-11 00:19:43,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:43,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2022-01-11 00:19:43,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:43,828 INFO L225 Difference]: With dead ends: 4655 [2022-01-11 00:19:43,828 INFO L226 Difference]: Without dead ends: 2343 [2022-01-11 00:19:43,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:43,850 INFO L933 BasicCegarLoop]: 1777 mSDtfsCounter, 1655 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1655 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:43,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1655 Valid, 1882 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:43,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2022-01-11 00:19:43,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2343. [2022-01-11 00:19:43,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 2342 states have (on average 1.3970964987190435) internal successors, (3272), 2342 states have internal predecessors, (3272), 0 states have call successors, (0), 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:19:43,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3272 transitions. [2022-01-11 00:19:43,956 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3272 transitions. Word has length 150 [2022-01-11 00:19:43,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:43,956 INFO L470 AbstractCegarLoop]: Abstraction has 2343 states and 3272 transitions. [2022-01-11 00:19:43,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:43,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3272 transitions. [2022-01-11 00:19:43,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:19:43,958 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:43,958 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] [2022-01-11 00:19:43,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 00:19:43,958 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:43,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:43,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1142559420, now seen corresponding path program 1 times [2022-01-11 00:19:43,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:43,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399283626] [2022-01-11 00:19:43,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:43,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:43,994 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:19:43,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:43,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399283626] [2022-01-11 00:19:43,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399283626] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:43,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:43,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:43,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378353043] [2022-01-11 00:19:43,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:43,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:43,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:43,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:43,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:43,996 INFO L87 Difference]: Start difference. First operand 2343 states and 3272 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:44,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:44,124 INFO L93 Difference]: Finished difference Result 4654 states and 6498 transitions. [2022-01-11 00:19:44,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:44,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2022-01-11 00:19:44,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:44,129 INFO L225 Difference]: With dead ends: 4654 [2022-01-11 00:19:44,130 INFO L226 Difference]: Without dead ends: 2343 [2022-01-11 00:19:44,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:44,133 INFO L933 BasicCegarLoop]: 1760 mSDtfsCounter, 1638 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1638 SdHoareTripleChecker+Valid, 1864 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:44,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1638 Valid, 1864 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:44,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2022-01-11 00:19:44,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2343. [2022-01-11 00:19:44,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 2342 states have (on average 1.3842869342442357) internal successors, (3242), 2342 states have internal predecessors, (3242), 0 states have call successors, (0), 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:19:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3242 transitions. [2022-01-11 00:19:44,237 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3242 transitions. Word has length 150 [2022-01-11 00:19:44,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:44,237 INFO L470 AbstractCegarLoop]: Abstraction has 2343 states and 3242 transitions. [2022-01-11 00:19:44,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:44,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3242 transitions. [2022-01-11 00:19:44,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:19:44,239 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:44,239 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] [2022-01-11 00:19:44,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 00:19:44,239 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:44,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:44,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1707304729, now seen corresponding path program 1 times [2022-01-11 00:19:44,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:44,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902447354] [2022-01-11 00:19:44,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:44,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:44,290 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:19:44,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:44,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902447354] [2022-01-11 00:19:44,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902447354] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:44,290 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:44,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:44,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108468887] [2022-01-11 00:19:44,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:44,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:44,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:44,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:44,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:44,292 INFO L87 Difference]: Start difference. First operand 2343 states and 3242 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:44,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:44,431 INFO L93 Difference]: Finished difference Result 4653 states and 6437 transitions. [2022-01-11 00:19:44,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:44,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2022-01-11 00:19:44,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:44,438 INFO L225 Difference]: With dead ends: 4653 [2022-01-11 00:19:44,438 INFO L226 Difference]: Without dead ends: 2343 [2022-01-11 00:19:44,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:44,443 INFO L933 BasicCegarLoop]: 1743 mSDtfsCounter, 1621 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1621 SdHoareTripleChecker+Valid, 1846 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:44,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1621 Valid, 1846 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:44,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2022-01-11 00:19:44,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2343. [2022-01-11 00:19:44,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 2342 states have (on average 1.3714773697694278) internal successors, (3212), 2342 states have internal predecessors, (3212), 0 states have call successors, (0), 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:19:44,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3212 transitions. [2022-01-11 00:19:44,558 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3212 transitions. Word has length 150 [2022-01-11 00:19:44,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:44,558 INFO L470 AbstractCegarLoop]: Abstraction has 2343 states and 3212 transitions. [2022-01-11 00:19:44,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:44,559 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3212 transitions. [2022-01-11 00:19:44,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:19:44,560 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:44,560 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] [2022-01-11 00:19:44,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 00:19:44,561 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:44,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:44,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1921790458, now seen corresponding path program 1 times [2022-01-11 00:19:44,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:44,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097028319] [2022-01-11 00:19:44,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:44,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:44,600 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:19:44,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:44,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097028319] [2022-01-11 00:19:44,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097028319] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:44,601 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:44,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:44,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924751063] [2022-01-11 00:19:44,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:44,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:44,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:44,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:44,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:44,602 INFO L87 Difference]: Start difference. First operand 2343 states and 3212 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:44,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:44,758 INFO L93 Difference]: Finished difference Result 4651 states and 6374 transitions. [2022-01-11 00:19:44,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:44,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2022-01-11 00:19:44,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:44,765 INFO L225 Difference]: With dead ends: 4651 [2022-01-11 00:19:44,765 INFO L226 Difference]: Without dead ends: 2343 [2022-01-11 00:19:44,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:44,768 INFO L933 BasicCegarLoop]: 1726 mSDtfsCounter, 1603 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1603 SdHoareTripleChecker+Valid, 1828 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:44,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1603 Valid, 1828 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:44,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2022-01-11 00:19:44,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2343. [2022-01-11 00:19:44,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 2342 states have (on average 1.35866780529462) internal successors, (3182), 2342 states have internal predecessors, (3182), 0 states have call successors, (0), 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:19:44,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3182 transitions. [2022-01-11 00:19:44,857 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3182 transitions. Word has length 150 [2022-01-11 00:19:44,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:44,857 INFO L470 AbstractCegarLoop]: Abstraction has 2343 states and 3182 transitions. [2022-01-11 00:19:44,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:44,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3182 transitions. [2022-01-11 00:19:44,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:19:44,859 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:44,859 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] [2022-01-11 00:19:44,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 00:19:44,859 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:44,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:44,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1507525669, now seen corresponding path program 1 times [2022-01-11 00:19:44,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:44,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368981409] [2022-01-11 00:19:44,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:44,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:44,892 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:19:44,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:44,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368981409] [2022-01-11 00:19:44,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368981409] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:44,892 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:44,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:44,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72970297] [2022-01-11 00:19:44,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:44,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:44,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:44,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:44,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:44,894 INFO L87 Difference]: Start difference. First operand 2343 states and 3182 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:44,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:44,997 INFO L93 Difference]: Finished difference Result 4650 states and 6313 transitions. [2022-01-11 00:19:44,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:44,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2022-01-11 00:19:44,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:45,001 INFO L225 Difference]: With dead ends: 4650 [2022-01-11 00:19:45,001 INFO L226 Difference]: Without dead ends: 2343 [2022-01-11 00:19:45,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:45,005 INFO L933 BasicCegarLoop]: 1709 mSDtfsCounter, 1586 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1586 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:45,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1586 Valid, 1810 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:45,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2022-01-11 00:19:45,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2343. [2022-01-11 00:19:45,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 2342 states have (on average 1.345858240819812) internal successors, (3152), 2342 states have internal predecessors, (3152), 0 states have call successors, (0), 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:19:45,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3152 transitions. [2022-01-11 00:19:45,114 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3152 transitions. Word has length 150 [2022-01-11 00:19:45,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:45,114 INFO L470 AbstractCegarLoop]: Abstraction has 2343 states and 3152 transitions. [2022-01-11 00:19:45,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:45,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3152 transitions. [2022-01-11 00:19:45,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:19:45,116 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:45,116 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] [2022-01-11 00:19:45,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 00:19:45,116 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:45,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:45,117 INFO L85 PathProgramCache]: Analyzing trace with hash 616420296, now seen corresponding path program 1 times [2022-01-11 00:19:45,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:45,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405468390] [2022-01-11 00:19:45,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:45,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:45,149 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:19:45,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:45,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405468390] [2022-01-11 00:19:45,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405468390] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:45,150 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:45,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:45,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243696627] [2022-01-11 00:19:45,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:45,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:45,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:45,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:45,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:45,151 INFO L87 Difference]: Start difference. First operand 2343 states and 3152 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:45,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:45,278 INFO L93 Difference]: Finished difference Result 4649 states and 6252 transitions. [2022-01-11 00:19:45,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:45,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2022-01-11 00:19:45,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:45,283 INFO L225 Difference]: With dead ends: 4649 [2022-01-11 00:19:45,283 INFO L226 Difference]: Without dead ends: 2343 [2022-01-11 00:19:45,286 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:45,286 INFO L933 BasicCegarLoop]: 1692 mSDtfsCounter, 1569 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1569 SdHoareTripleChecker+Valid, 1792 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:45,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1569 Valid, 1792 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:45,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2022-01-11 00:19:45,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2343. [2022-01-11 00:19:45,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2343 states, 2342 states have (on average 1.3330486763450042) internal successors, (3122), 2342 states have internal predecessors, (3122), 0 states have call successors, (0), 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:19:45,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2343 states to 2343 states and 3122 transitions. [2022-01-11 00:19:45,369 INFO L78 Accepts]: Start accepts. Automaton has 2343 states and 3122 transitions. Word has length 150 [2022-01-11 00:19:45,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:45,369 INFO L470 AbstractCegarLoop]: Abstraction has 2343 states and 3122 transitions. [2022-01-11 00:19:45,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:45,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2343 states and 3122 transitions. [2022-01-11 00:19:45,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:19:45,370 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:45,371 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] [2022-01-11 00:19:45,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 00:19:45,371 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:45,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:45,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1758516505, now seen corresponding path program 1 times [2022-01-11 00:19:45,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:45,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083783909] [2022-01-11 00:19:45,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:45,372 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:45,422 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:19:45,422 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:45,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083783909] [2022-01-11 00:19:45,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083783909] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:45,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:45,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:19:45,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361980789] [2022-01-11 00:19:45,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:45,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:19:45,423 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:45,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:19:45,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:19:45,423 INFO L87 Difference]: Start difference. First operand 2343 states and 3122 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:45,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:45,702 INFO L93 Difference]: Finished difference Result 5573 states and 7482 transitions. [2022-01-11 00:19:45,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 00:19:45,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2022-01-11 00:19:45,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:45,707 INFO L225 Difference]: With dead ends: 5573 [2022-01-11 00:19:45,708 INFO L226 Difference]: Without dead ends: 3281 [2022-01-11 00:19:45,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 00:19:45,711 INFO L933 BasicCegarLoop]: 1829 mSDtfsCounter, 4729 mSDsluCounter, 2008 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4729 SdHoareTripleChecker+Valid, 3837 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:45,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4729 Valid, 3837 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:19:45,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3281 states. [2022-01-11 00:19:45,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3281 to 2349. [2022-01-11 00:19:45,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2349 states, 2348 states have (on average 1.3228279386712096) internal successors, (3106), 2348 states have internal predecessors, (3106), 0 states have call successors, (0), 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:19:45,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 3106 transitions. [2022-01-11 00:19:45,819 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 3106 transitions. Word has length 150 [2022-01-11 00:19:45,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:45,819 INFO L470 AbstractCegarLoop]: Abstraction has 2349 states and 3106 transitions. [2022-01-11 00:19:45,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 3106 transitions. [2022-01-11 00:19:45,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:19:45,820 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:45,820 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] [2022-01-11 00:19:45,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 00:19:45,821 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:45,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:45,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1603096454, now seen corresponding path program 1 times [2022-01-11 00:19:45,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:45,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038891196] [2022-01-11 00:19:45,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:45,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:45,859 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:19:45,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:45,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038891196] [2022-01-11 00:19:45,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038891196] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:45,860 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:45,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:19:45,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888901246] [2022-01-11 00:19:45,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:45,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:19:45,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:45,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:19:45,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:19:45,861 INFO L87 Difference]: Start difference. First operand 2349 states and 3106 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:46,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:46,141 INFO L93 Difference]: Finished difference Result 6186 states and 8212 transitions. [2022-01-11 00:19:46,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 00:19:46,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2022-01-11 00:19:46,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:46,147 INFO L225 Difference]: With dead ends: 6186 [2022-01-11 00:19:46,147 INFO L226 Difference]: Without dead ends: 3923 [2022-01-11 00:19:46,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 00:19:46,150 INFO L933 BasicCegarLoop]: 1727 mSDtfsCounter, 4027 mSDsluCounter, 3429 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4027 SdHoareTripleChecker+Valid, 5156 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:46,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4027 Valid, 5156 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 00:19:46,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3923 states. [2022-01-11 00:19:46,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3923 to 2355. [2022-01-11 00:19:46,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2355 states, 2354 states have (on average 1.312659303313509) internal successors, (3090), 2354 states have internal predecessors, (3090), 0 states have call successors, (0), 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:19:46,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2355 states and 3090 transitions. [2022-01-11 00:19:46,265 INFO L78 Accepts]: Start accepts. Automaton has 2355 states and 3090 transitions. Word has length 150 [2022-01-11 00:19:46,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:46,266 INFO L470 AbstractCegarLoop]: Abstraction has 2355 states and 3090 transitions. [2022-01-11 00:19:46,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:46,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 3090 transitions. [2022-01-11 00:19:46,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:19:46,267 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:46,267 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] [2022-01-11 00:19:46,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 00:19:46,267 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:46,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:46,268 INFO L85 PathProgramCache]: Analyzing trace with hash -505936795, now seen corresponding path program 1 times [2022-01-11 00:19:46,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:46,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963439773] [2022-01-11 00:19:46,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:46,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:46,301 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:19:46,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:46,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963439773] [2022-01-11 00:19:46,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963439773] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:46,301 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:46,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:46,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340253994] [2022-01-11 00:19:46,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:46,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:46,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:46,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:46,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:46,302 INFO L87 Difference]: Start difference. First operand 2355 states and 3090 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:46,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:46,555 INFO L93 Difference]: Finished difference Result 6656 states and 8727 transitions. [2022-01-11 00:19:46,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:46,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2022-01-11 00:19:46,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:46,562 INFO L225 Difference]: With dead ends: 6656 [2022-01-11 00:19:46,563 INFO L226 Difference]: Without dead ends: 4389 [2022-01-11 00:19:46,565 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:46,566 INFO L933 BasicCegarLoop]: 1669 mSDtfsCounter, 1462 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1462 SdHoareTripleChecker+Valid, 3150 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:46,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1462 Valid, 3150 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:46,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4389 states. [2022-01-11 00:19:46,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4389 to 4382. [2022-01-11 00:19:46,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4382 states, 4381 states have (on average 1.3060944989728374) internal successors, (5722), 4381 states have internal predecessors, (5722), 0 states have call successors, (0), 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:19:46,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4382 states to 4382 states and 5722 transitions. [2022-01-11 00:19:46,766 INFO L78 Accepts]: Start accepts. Automaton has 4382 states and 5722 transitions. Word has length 150 [2022-01-11 00:19:46,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:46,766 INFO L470 AbstractCegarLoop]: Abstraction has 4382 states and 5722 transitions. [2022-01-11 00:19:46,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:46,766 INFO L276 IsEmpty]: Start isEmpty. Operand 4382 states and 5722 transitions. [2022-01-11 00:19:46,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:19:46,767 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:46,767 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] [2022-01-11 00:19:46,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 00:19:46,767 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:46,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:46,768 INFO L85 PathProgramCache]: Analyzing trace with hash -44334074, now seen corresponding path program 1 times [2022-01-11 00:19:46,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:46,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543739102] [2022-01-11 00:19:46,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:46,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:46,842 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:19:46,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:46,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543739102] [2022-01-11 00:19:46,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543739102] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:46,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:46,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:46,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001279930] [2022-01-11 00:19:46,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:46,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:46,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:46,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:46,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:46,844 INFO L87 Difference]: Start difference. First operand 4382 states and 5722 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:47,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:47,121 INFO L93 Difference]: Finished difference Result 8746 states and 11414 transitions. [2022-01-11 00:19:47,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:47,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2022-01-11 00:19:47,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:47,129 INFO L225 Difference]: With dead ends: 8746 [2022-01-11 00:19:47,129 INFO L226 Difference]: Without dead ends: 4382 [2022-01-11 00:19:47,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:47,136 INFO L933 BasicCegarLoop]: 1672 mSDtfsCounter, 1572 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1572 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:47,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1572 Valid, 1672 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:47,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4382 states. [2022-01-11 00:19:47,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4382 to 4382. [2022-01-11 00:19:47,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4382 states, 4381 states have (on average 1.3028988815338964) internal successors, (5708), 4381 states have internal predecessors, (5708), 0 states have call successors, (0), 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:19:47,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4382 states to 4382 states and 5708 transitions. [2022-01-11 00:19:47,377 INFO L78 Accepts]: Start accepts. Automaton has 4382 states and 5708 transitions. Word has length 150 [2022-01-11 00:19:47,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:47,377 INFO L470 AbstractCegarLoop]: Abstraction has 4382 states and 5708 transitions. [2022-01-11 00:19:47,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:47,377 INFO L276 IsEmpty]: Start isEmpty. Operand 4382 states and 5708 transitions. [2022-01-11 00:19:47,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:19:47,378 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:47,378 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] [2022-01-11 00:19:47,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 00:19:47,378 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:47,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:47,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1745074553, now seen corresponding path program 1 times [2022-01-11 00:19:47,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:47,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752426560] [2022-01-11 00:19:47,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:47,379 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:47,437 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:19:47,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:47,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752426560] [2022-01-11 00:19:47,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752426560] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:47,438 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:47,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:47,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155884439] [2022-01-11 00:19:47,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:47,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:47,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:47,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:47,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:47,439 INFO L87 Difference]: Start difference. First operand 4382 states and 5708 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:47,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:47,643 INFO L93 Difference]: Finished difference Result 8738 states and 11378 transitions. [2022-01-11 00:19:47,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:47,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2022-01-11 00:19:47,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:47,650 INFO L225 Difference]: With dead ends: 8738 [2022-01-11 00:19:47,650 INFO L226 Difference]: Without dead ends: 4382 [2022-01-11 00:19:47,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:47,657 INFO L933 BasicCegarLoop]: 1667 mSDtfsCounter, 1559 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:47,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1559 Valid, 1667 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:47,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4382 states. [2022-01-11 00:19:47,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4382 to 4382. [2022-01-11 00:19:47,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4382 states, 4381 states have (on average 1.2997032640949555) internal successors, (5694), 4381 states have internal predecessors, (5694), 0 states have call successors, (0), 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:19:47,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4382 states to 4382 states and 5694 transitions. [2022-01-11 00:19:47,895 INFO L78 Accepts]: Start accepts. Automaton has 4382 states and 5694 transitions. Word has length 150 [2022-01-11 00:19:47,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:47,895 INFO L470 AbstractCegarLoop]: Abstraction has 4382 states and 5694 transitions. [2022-01-11 00:19:47,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:47,896 INFO L276 IsEmpty]: Start isEmpty. Operand 4382 states and 5694 transitions. [2022-01-11 00:19:47,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:19:47,896 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:47,897 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] [2022-01-11 00:19:47,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 00:19:47,897 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:47,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:47,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1415308792, now seen corresponding path program 1 times [2022-01-11 00:19:47,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:47,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114611855] [2022-01-11 00:19:47,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:47,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:47,946 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:19:47,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:47,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114611855] [2022-01-11 00:19:47,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114611855] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:47,948 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:47,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 00:19:47,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775748756] [2022-01-11 00:19:47,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:47,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:47,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:47,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:47,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:47,949 INFO L87 Difference]: Start difference. First operand 4382 states and 5694 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:48,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:48,210 INFO L93 Difference]: Finished difference Result 8730 states and 11342 transitions. [2022-01-11 00:19:48,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:48,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2022-01-11 00:19:48,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:48,220 INFO L225 Difference]: With dead ends: 8730 [2022-01-11 00:19:48,220 INFO L226 Difference]: Without dead ends: 4382 [2022-01-11 00:19:48,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:48,228 INFO L933 BasicCegarLoop]: 1640 mSDtfsCounter, 1434 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1434 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:48,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1434 Valid, 1737 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:48,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4382 states. [2022-01-11 00:19:48,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4382 to 4382. [2022-01-11 00:19:48,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4382 states, 4381 states have (on average 1.2917142204976033) internal successors, (5659), 4381 states have internal predecessors, (5659), 0 states have call successors, (0), 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:19:48,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4382 states to 4382 states and 5659 transitions. [2022-01-11 00:19:48,484 INFO L78 Accepts]: Start accepts. Automaton has 4382 states and 5659 transitions. Word has length 150 [2022-01-11 00:19:48,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:48,484 INFO L470 AbstractCegarLoop]: Abstraction has 4382 states and 5659 transitions. [2022-01-11 00:19:48,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:48,484 INFO L276 IsEmpty]: Start isEmpty. Operand 4382 states and 5659 transitions. [2022-01-11 00:19:48,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:19:48,485 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:48,485 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] [2022-01-11 00:19:48,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 00:19:48,485 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:48,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:48,486 INFO L85 PathProgramCache]: Analyzing trace with hash -722207095, now seen corresponding path program 1 times [2022-01-11 00:19:48,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:48,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631773531] [2022-01-11 00:19:48,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:48,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:48,531 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:19:48,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:48,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631773531] [2022-01-11 00:19:48,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631773531] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:48,532 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:48,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:19:48,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333231253] [2022-01-11 00:19:48,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:48,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:48,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:48,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:48,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:48,533 INFO L87 Difference]: Start difference. First operand 4382 states and 5659 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:49,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:49,086 INFO L93 Difference]: Finished difference Result 12837 states and 16495 transitions. [2022-01-11 00:19:49,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:49,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2022-01-11 00:19:49,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:49,100 INFO L225 Difference]: With dead ends: 12837 [2022-01-11 00:19:49,101 INFO L226 Difference]: Without dead ends: 8591 [2022-01-11 00:19:49,109 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:19:49,110 INFO L933 BasicCegarLoop]: 1654 mSDtfsCounter, 1430 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1430 SdHoareTripleChecker+Valid, 3280 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:49,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1430 Valid, 3280 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:49,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8591 states. [2022-01-11 00:19:49,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8591 to 8282. [2022-01-11 00:19:49,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8282 states, 8281 states have (on average 1.2800386426760053) internal successors, (10600), 8281 states have internal predecessors, (10600), 0 states have call successors, (0), 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:19:49,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8282 states to 8282 states and 10600 transitions. [2022-01-11 00:19:49,652 INFO L78 Accepts]: Start accepts. Automaton has 8282 states and 10600 transitions. Word has length 150 [2022-01-11 00:19:49,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:49,653 INFO L470 AbstractCegarLoop]: Abstraction has 8282 states and 10600 transitions. [2022-01-11 00:19:49,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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:19:49,653 INFO L276 IsEmpty]: Start isEmpty. Operand 8282 states and 10600 transitions. [2022-01-11 00:19:49,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-01-11 00:19:49,654 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:49,654 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] [2022-01-11 00:19:49,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 00:19:49,655 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:49,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:49,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1671680741, now seen corresponding path program 1 times [2022-01-11 00:19:49,655 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:49,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286001573] [2022-01-11 00:19:49,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:49,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:49,692 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:19:49,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:49,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286001573] [2022-01-11 00:19:49,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286001573] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:49,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:49,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:19:49,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983377639] [2022-01-11 00:19:49,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:49,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:49,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:49,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:49,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:49,694 INFO L87 Difference]: Start difference. First operand 8282 states and 10600 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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:19:50,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:50,450 INFO L93 Difference]: Finished difference Result 23788 states and 30380 transitions. [2022-01-11 00:19:50,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:50,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 151 [2022-01-11 00:19:50,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:50,470 INFO L225 Difference]: With dead ends: 23788 [2022-01-11 00:19:50,471 INFO L226 Difference]: Without dead ends: 15773 [2022-01-11 00:19:50,478 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:19:50,480 INFO L933 BasicCegarLoop]: 2566 mSDtfsCounter, 1355 mSDsluCounter, 1636 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 4202 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:50,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1355 Valid, 4202 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:50,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15773 states. [2022-01-11 00:19:51,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15773 to 15770. [2022-01-11 00:19:51,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15770 states, 15769 states have (on average 1.2736381508022068) internal successors, (20084), 15769 states have internal predecessors, (20084), 0 states have call successors, (0), 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:19:51,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15770 states to 15770 states and 20084 transitions. [2022-01-11 00:19:51,317 INFO L78 Accepts]: Start accepts. Automaton has 15770 states and 20084 transitions. Word has length 151 [2022-01-11 00:19:51,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:51,317 INFO L470 AbstractCegarLoop]: Abstraction has 15770 states and 20084 transitions. [2022-01-11 00:19:51,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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:19:51,317 INFO L276 IsEmpty]: Start isEmpty. Operand 15770 states and 20084 transitions. [2022-01-11 00:19:51,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-01-11 00:19:51,319 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:51,319 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] [2022-01-11 00:19:51,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-11 00:19:51,320 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:51,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:51,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1961697082, now seen corresponding path program 1 times [2022-01-11 00:19:51,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:51,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812803207] [2022-01-11 00:19:51,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:51,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:51,344 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:19:51,344 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:51,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812803207] [2022-01-11 00:19:51,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812803207] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:51,344 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:51,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:19:51,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178350866] [2022-01-11 00:19:51,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:51,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:51,345 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:51,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:51,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:51,345 INFO L87 Difference]: Start difference. First operand 15770 states and 20084 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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:19:52,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:52,242 INFO L93 Difference]: Finished difference Result 31013 states and 39526 transitions. [2022-01-11 00:19:52,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:52,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 151 [2022-01-11 00:19:52,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:52,260 INFO L225 Difference]: With dead ends: 31013 [2022-01-11 00:19:52,260 INFO L226 Difference]: Without dead ends: 15510 [2022-01-11 00:19:52,274 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:19:52,275 INFO L933 BasicCegarLoop]: 1654 mSDtfsCounter, 1650 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1650 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:52,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1650 Valid, 1654 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:52,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15510 states. [2022-01-11 00:19:53,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15510 to 15510. [2022-01-11 00:19:53,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15510 states, 15509 states have (on average 1.2744857824489007) internal successors, (19766), 15509 states have internal predecessors, (19766), 0 states have call successors, (0), 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:19:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15510 states to 15510 states and 19766 transitions. [2022-01-11 00:19:53,182 INFO L78 Accepts]: Start accepts. Automaton has 15510 states and 19766 transitions. Word has length 151 [2022-01-11 00:19:53,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:53,182 INFO L470 AbstractCegarLoop]: Abstraction has 15510 states and 19766 transitions. [2022-01-11 00:19:53,182 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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:19:53,182 INFO L276 IsEmpty]: Start isEmpty. Operand 15510 states and 19766 transitions. [2022-01-11 00:19:53,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-01-11 00:19:53,184 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:53,184 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] [2022-01-11 00:19:53,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-11 00:19:53,184 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:53,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:53,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1022304591, now seen corresponding path program 1 times [2022-01-11 00:19:53,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:53,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920803793] [2022-01-11 00:19:53,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:53,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:53,222 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:19:53,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:53,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920803793] [2022-01-11 00:19:53,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920803793] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:53,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:53,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:19:53,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455794525] [2022-01-11 00:19:53,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:53,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:53,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:53,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:53,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:53,223 INFO L87 Difference]: Start difference. First operand 15510 states and 19766 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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:19:54,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:54,783 INFO L93 Difference]: Finished difference Result 45758 states and 58234 transitions. [2022-01-11 00:19:54,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:54,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2022-01-11 00:19:54,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:54,827 INFO L225 Difference]: With dead ends: 45758 [2022-01-11 00:19:54,828 INFO L226 Difference]: Without dead ends: 30515 [2022-01-11 00:19:54,850 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:19:54,850 INFO L933 BasicCegarLoop]: 2009 mSDtfsCounter, 1470 mSDsluCounter, 1622 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 3631 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:54,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1470 Valid, 3631 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:54,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30515 states. [2022-01-11 00:19:56,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30515 to 29560. [2022-01-11 00:19:56,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29560 states, 29559 states have (on average 1.2707466423086031) internal successors, (37562), 29559 states have internal predecessors, (37562), 0 states have call successors, (0), 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:19:56,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29560 states to 29560 states and 37562 transitions. [2022-01-11 00:19:56,660 INFO L78 Accepts]: Start accepts. Automaton has 29560 states and 37562 transitions. Word has length 152 [2022-01-11 00:19:56,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:19:56,661 INFO L470 AbstractCegarLoop]: Abstraction has 29560 states and 37562 transitions. [2022-01-11 00:19:56,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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:19:56,661 INFO L276 IsEmpty]: Start isEmpty. Operand 29560 states and 37562 transitions. [2022-01-11 00:19:56,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-01-11 00:19:56,665 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:19:56,665 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] [2022-01-11 00:19:56,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-11 00:19:56,665 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:19:56,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:19:56,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1657871599, now seen corresponding path program 1 times [2022-01-11 00:19:56,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:19:56,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091985584] [2022-01-11 00:19:56,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:19:56,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:19:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:19:56,734 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:19:56,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:19:56,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091985584] [2022-01-11 00:19:56,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091985584] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:19:56,735 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:19:56,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:19:56,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618964359] [2022-01-11 00:19:56,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:19:56,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:19:56,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:19:56,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:19:56,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:19:56,736 INFO L87 Difference]: Start difference. First operand 29560 states and 37562 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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:19:58,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:19:58,479 INFO L93 Difference]: Finished difference Result 58751 states and 74672 transitions. [2022-01-11 00:19:58,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:19:58,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2022-01-11 00:19:58,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:19:58,525 INFO L225 Difference]: With dead ends: 58751 [2022-01-11 00:19:58,525 INFO L226 Difference]: Without dead ends: 29302 [2022-01-11 00:19:58,548 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:19:58,548 INFO L933 BasicCegarLoop]: 1653 mSDtfsCounter, 1648 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1648 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:19:58,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1648 Valid, 1653 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:19:58,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29302 states. [2022-01-11 00:20:00,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29302 to 29302. [2022-01-11 00:20:00,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29302 states, 29301 states have (on average 1.2712194123067473) internal successors, (37248), 29301 states have internal predecessors, (37248), 0 states have call successors, (0), 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:20:00,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29302 states to 29302 states and 37248 transitions. [2022-01-11 00:20:00,310 INFO L78 Accepts]: Start accepts. Automaton has 29302 states and 37248 transitions. Word has length 152 [2022-01-11 00:20:00,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:20:00,310 INFO L470 AbstractCegarLoop]: Abstraction has 29302 states and 37248 transitions. [2022-01-11 00:20:00,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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:20:00,310 INFO L276 IsEmpty]: Start isEmpty. Operand 29302 states and 37248 transitions. [2022-01-11 00:20:00,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-01-11 00:20:00,312 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:20:00,312 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] [2022-01-11 00:20:00,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-11 00:20:00,313 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:20:00,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:20:00,313 INFO L85 PathProgramCache]: Analyzing trace with hash 648209678, now seen corresponding path program 1 times [2022-01-11 00:20:00,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:20:00,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176697934] [2022-01-11 00:20:00,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:20:00,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:20:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:20:00,354 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:20:00,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:20:00,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176697934] [2022-01-11 00:20:00,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176697934] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:20:00,354 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:20:00,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:20:00,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963350241] [2022-01-11 00:20:00,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:20:00,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:20:00,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:20:00,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:20:00,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:20:00,356 INFO L87 Difference]: Start difference. First operand 29302 states and 37248 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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:20:03,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:20:03,678 INFO L93 Difference]: Finished difference Result 86520 states and 109880 transitions. [2022-01-11 00:20:03,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:20:03,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2022-01-11 00:20:03,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:20:03,764 INFO L225 Difference]: With dead ends: 86520 [2022-01-11 00:20:03,764 INFO L226 Difference]: Without dead ends: 57485 [2022-01-11 00:20:03,788 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:20:03,789 INFO L933 BasicCegarLoop]: 1953 mSDtfsCounter, 1470 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 3573 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:20:03,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1470 Valid, 3573 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:20:03,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57485 states. [2022-01-11 00:20:07,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57485 to 55802. [2022-01-11 00:20:07,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55802 states, 55801 states have (on average 1.268722782745829) internal successors, (70796), 55801 states have internal predecessors, (70796), 0 states have call successors, (0), 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:20:07,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55802 states to 55802 states and 70796 transitions. [2022-01-11 00:20:07,432 INFO L78 Accepts]: Start accepts. Automaton has 55802 states and 70796 transitions. Word has length 153 [2022-01-11 00:20:07,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:20:07,432 INFO L470 AbstractCegarLoop]: Abstraction has 55802 states and 70796 transitions. [2022-01-11 00:20:07,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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:20:07,433 INFO L276 IsEmpty]: Start isEmpty. Operand 55802 states and 70796 transitions. [2022-01-11 00:20:07,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-01-11 00:20:07,436 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:20:07,436 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] [2022-01-11 00:20:07,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-11 00:20:07,437 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:20:07,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:20:07,437 INFO L85 PathProgramCache]: Analyzing trace with hash -455134290, now seen corresponding path program 1 times [2022-01-11 00:20:07,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:20:07,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043475501] [2022-01-11 00:20:07,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:20:07,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:20:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:20:07,465 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:20:07,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:20:07,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043475501] [2022-01-11 00:20:07,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043475501] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:20:07,465 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:20:07,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:20:07,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814280982] [2022-01-11 00:20:07,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:20:07,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:20:07,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:20:07,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:20:07,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:20:07,466 INFO L87 Difference]: Start difference. First operand 55802 states and 70796 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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:20:10,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:20:10,874 INFO L93 Difference]: Finished difference Result 111223 states and 141128 transitions. [2022-01-11 00:20:10,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:20:10,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 153 [2022-01-11 00:20:10,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:20:10,968 INFO L225 Difference]: With dead ends: 111223 [2022-01-11 00:20:10,968 INFO L226 Difference]: Without dead ends: 55546 [2022-01-11 00:20:11,010 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:20:11,010 INFO L933 BasicCegarLoop]: 1652 mSDtfsCounter, 1646 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1646 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:20:11,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1646 Valid, 1652 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:20:11,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55546 states. [2022-01-11 00:20:14,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55546 to 55546. [2022-01-11 00:20:14,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55546 states, 55545 states have (on average 1.268989107930507) internal successors, (70486), 55545 states have internal predecessors, (70486), 0 states have call successors, (0), 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:20:14,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55546 states to 55546 states and 70486 transitions. [2022-01-11 00:20:14,431 INFO L78 Accepts]: Start accepts. Automaton has 55546 states and 70486 transitions. Word has length 153 [2022-01-11 00:20:14,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:20:14,431 INFO L470 AbstractCegarLoop]: Abstraction has 55546 states and 70486 transitions. [2022-01-11 00:20:14,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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:20:14,431 INFO L276 IsEmpty]: Start isEmpty. Operand 55546 states and 70486 transitions. [2022-01-11 00:20:14,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 00:20:14,433 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:20:14,433 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] [2022-01-11 00:20:14,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-11 00:20:14,434 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:20:14,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:20:14,434 INFO L85 PathProgramCache]: Analyzing trace with hash 910250819, now seen corresponding path program 1 times [2022-01-11 00:20:14,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:20:14,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959622914] [2022-01-11 00:20:14,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:20:14,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:20:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:20:14,496 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:20:14,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:20:14,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959622914] [2022-01-11 00:20:14,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959622914] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:20:14,497 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:20:14,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:20:14,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629315101] [2022-01-11 00:20:14,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:20:14,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:20:14,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:20:14,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:20:14,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:20:14,498 INFO L87 Difference]: Start difference. First operand 55546 states and 70486 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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:20:20,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:20:20,629 INFO L93 Difference]: Finished difference Result 163790 states and 207682 transitions. [2022-01-11 00:20:20,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:20:20,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2022-01-11 00:20:20,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:20:20,808 INFO L225 Difference]: With dead ends: 163790 [2022-01-11 00:20:20,808 INFO L226 Difference]: Without dead ends: 108511 [2022-01-11 00:20:20,869 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:20:20,870 INFO L933 BasicCegarLoop]: 1955 mSDtfsCounter, 1470 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 3573 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:20:20,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1470 Valid, 3573 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:20:20,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108511 states. [2022-01-11 00:20:27,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108511 to 105596. [2022-01-11 00:20:27,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105596 states, 105595 states have (on average 1.2670107486149913) internal successors, (133790), 105595 states have internal predecessors, (133790), 0 states have call successors, (0), 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:20:27,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105596 states to 105596 states and 133790 transitions. [2022-01-11 00:20:27,403 INFO L78 Accepts]: Start accepts. Automaton has 105596 states and 133790 transitions. Word has length 154 [2022-01-11 00:20:27,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:20:27,403 INFO L470 AbstractCegarLoop]: Abstraction has 105596 states and 133790 transitions. [2022-01-11 00:20:27,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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:20:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand 105596 states and 133790 transitions. [2022-01-11 00:20:27,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-01-11 00:20:27,407 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:20:27,407 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] [2022-01-11 00:20:27,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-11 00:20:27,408 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:20:27,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:20:27,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1898798145, now seen corresponding path program 1 times [2022-01-11 00:20:27,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:20:27,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020377424] [2022-01-11 00:20:27,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:20:27,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:20:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:20:27,437 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:20:27,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:20:27,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020377424] [2022-01-11 00:20:27,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020377424] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:20:27,438 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:20:27,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:20:27,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678280810] [2022-01-11 00:20:27,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:20:27,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:20:27,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:20:27,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:20:27,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:20:27,439 INFO L87 Difference]: Start difference. First operand 105596 states and 133790 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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:20:34,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:20:34,014 INFO L93 Difference]: Finished difference Result 210799 states and 267104 transitions. [2022-01-11 00:20:34,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:20:34,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 154 [2022-01-11 00:20:34,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:20:34,193 INFO L225 Difference]: With dead ends: 210799 [2022-01-11 00:20:34,193 INFO L226 Difference]: Without dead ends: 105342 [2022-01-11 00:20:34,276 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:20:34,277 INFO L933 BasicCegarLoop]: 1651 mSDtfsCounter, 1644 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1644 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:20:34,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1644 Valid, 1651 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:20:34,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105342 states. [2022-01-11 00:20:40,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105342 to 105342. [2022-01-11 00:20:40,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105342 states, 105341 states have (on average 1.2671609344889454) internal successors, (133484), 105341 states have internal predecessors, (133484), 0 states have call successors, (0), 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:20:41,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105342 states to 105342 states and 133484 transitions. [2022-01-11 00:20:41,140 INFO L78 Accepts]: Start accepts. Automaton has 105342 states and 133484 transitions. Word has length 154 [2022-01-11 00:20:41,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:20:41,140 INFO L470 AbstractCegarLoop]: Abstraction has 105342 states and 133484 transitions. [2022-01-11 00:20:41,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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:20:41,140 INFO L276 IsEmpty]: Start isEmpty. Operand 105342 states and 133484 transitions. [2022-01-11 00:20:41,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-01-11 00:20:41,143 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:20:41,143 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] [2022-01-11 00:20:41,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-11 00:20:41,143 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:20:41,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:20:41,144 INFO L85 PathProgramCache]: Analyzing trace with hash 2097201627, now seen corresponding path program 1 times [2022-01-11 00:20:41,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:20:41,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616060695] [2022-01-11 00:20:41,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:20:41,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:20:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:20:41,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:20:41,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:20:41,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616060695] [2022-01-11 00:20:41,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616060695] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:20:41,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:20:41,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:20:41,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170197203] [2022-01-11 00:20:41,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:20:41,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:20:41,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:20:41,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:20:41,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:20:41,184 INFO L87 Difference]: Start difference. First operand 105342 states and 133484 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)