/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 18:47:13,057 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 18:47:13,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 18:47:13,100 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 18:47:13,100 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 18:47:13,117 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 18:47:13,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 18:47:13,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 18:47:13,122 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 18:47:13,125 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 18:47:13,126 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 18:47:13,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 18:47:13,127 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 18:47:13,129 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 18:47:13,129 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 18:47:13,131 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 18:47:13,132 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 18:47:13,133 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 18:47:13,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 18:47:13,138 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 18:47:13,139 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 18:47:13,141 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 18:47:13,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 18:47:13,142 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 18:47:13,147 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 18:47:13,147 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 18:47:13,147 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 18:47:13,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 18:47:13,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 18:47:13,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 18:47:13,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 18:47:13,150 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 18:47:13,151 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 18:47:13,151 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 18:47:13,152 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 18:47:13,152 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 18:47:13,153 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 18:47:13,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 18:47:13,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 18:47:13,153 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 18:47:13,154 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 18:47:13,155 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 18:47:13,178 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 18:47:13,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 18:47:13,179 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 18:47:13,179 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 18:47:13,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 18:47:13,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 18:47:13,180 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 18:47:13,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 18:47:13,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 18:47:13,180 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 18:47:13,181 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 18:47:13,181 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 18:47:13,181 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 18:47:13,181 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 18:47:13,181 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 18:47:13,181 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 18:47:13,181 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 18:47:13,181 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 18:47:13,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 18:47:13,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 18:47:13,182 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 18:47:13,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 18:47:13,182 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 18:47:13,182 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 18:47:13,182 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 18:47:13,182 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 18:47:13,182 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 18:47:13,183 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 18:47:13,183 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 18:47:13,183 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 18:47:13,183 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 18:47:13,183 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 18:47:13,184 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 18:47:13,184 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 18:47:13,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 18:47:13,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 18:47:13,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 18:47:13,383 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 18:47:13,384 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 18:47:13,385 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-01-10 18:47:13,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e9cb2abf/af558008ead44033a97dbcc7802e6145/FLAG951d56d43 [2022-01-10 18:47:13,838 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 18:47:13,841 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-01-10 18:47:13,853 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e9cb2abf/af558008ead44033a97dbcc7802e6145/FLAG951d56d43 [2022-01-10 18:47:13,861 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e9cb2abf/af558008ead44033a97dbcc7802e6145 [2022-01-10 18:47:13,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 18:47:13,863 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 18:47:13,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 18:47:13,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 18:47:13,868 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 18:47:13,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:47:13" (1/1) ... [2022-01-10 18:47:13,869 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d73c5a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:13, skipping insertion in model container [2022-01-10 18:47:13,869 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:47:13" (1/1) ... [2022-01-10 18:47:13,873 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 18:47:13,914 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 18:47:14,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[14043,14056] [2022-01-10 18:47:14,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 18:47:14,267 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 18:47:14,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[14043,14056] [2022-01-10 18:47:14,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 18:47:14,375 INFO L208 MainTranslator]: Completed translation [2022-01-10 18:47:14,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:14 WrapperNode [2022-01-10 18:47:14,375 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 18:47:14,376 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 18:47:14,376 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 18:47:14,376 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 18:47:14,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:14" (1/1) ... [2022-01-10 18:47:14,413 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:14" (1/1) ... [2022-01-10 18:47:14,459 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1140 [2022-01-10 18:47:14,471 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 18:47:14,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 18:47:14,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 18:47:14,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 18:47:14,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:14" (1/1) ... [2022-01-10 18:47:14,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:14" (1/1) ... [2022-01-10 18:47:14,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:14" (1/1) ... [2022-01-10 18:47:14,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:14" (1/1) ... [2022-01-10 18:47:14,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:14" (1/1) ... [2022-01-10 18:47:14,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:14" (1/1) ... [2022-01-10 18:47:14,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:14" (1/1) ... [2022-01-10 18:47:14,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 18:47:14,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 18:47:14,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 18:47:14,520 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 18:47:14,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:14" (1/1) ... [2022-01-10 18:47:14,536 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 18:47:14,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 18:47:14,554 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 18:47:14,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 18:47:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 18:47:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 18:47:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 18:47:14,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 18:47:14,711 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 18:47:14,712 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 18:47:15,406 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 18:47:15,414 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 18:47:15,414 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-10 18:47:15,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:47:15 BoogieIcfgContainer [2022-01-10 18:47:15,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 18:47:15,416 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 18:47:15,416 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 18:47:15,420 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 18:47:15,422 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:47:15" (1/1) ... [2022-01-10 18:47:15,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 06:47:15 BasicIcfg [2022-01-10 18:47:15,966 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 18:47:15,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 18:47:15,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 18:47:15,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 18:47:15,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:47:13" (1/4) ... [2022-01-10 18:47:15,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448bb90f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:47:15, skipping insertion in model container [2022-01-10 18:47:15,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:47:14" (2/4) ... [2022-01-10 18:47:15,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448bb90f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:47:15, skipping insertion in model container [2022-01-10 18:47:15,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:47:15" (3/4) ... [2022-01-10 18:47:15,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@448bb90f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:47:15, skipping insertion in model container [2022-01-10 18:47:15,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 06:47:15" (4/4) ... [2022-01-10 18:47:15,973 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.UNBOUNDED.pals.c.v+nlh-reducer.cTransformedIcfg [2022-01-10 18:47:15,976 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 18:47:15,976 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 18:47:16,017 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 18:47:16,021 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 18:47:16,021 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 18:47:16,040 INFO L276 IsEmpty]: Start isEmpty. Operand has 301 states, 299 states have (on average 1.7892976588628762) internal successors, (535), 300 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:16,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-10 18:47:16,053 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:47:16,053 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] [2022-01-10 18:47:16,054 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:47:16,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:47:16,060 INFO L85 PathProgramCache]: Analyzing trace with hash 168118009, now seen corresponding path program 1 times [2022-01-10 18:47:16,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:47:16,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736649790] [2022-01-10 18:47:16,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:47:16,067 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:47:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:47:16,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:47:16,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:47:16,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736649790] [2022-01-10 18:47:16,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736649790] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:47:16,512 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:47:16,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 18:47:16,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263967118] [2022-01-10 18:47:16,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:47:16,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 18:47:16,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:47:16,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 18:47:16,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 18:47:16,543 INFO L87 Difference]: Start difference. First operand has 301 states, 299 states have (on average 1.7892976588628762) internal successors, (535), 300 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:16,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:47:16,735 INFO L93 Difference]: Finished difference Result 861 states and 1534 transitions. [2022-01-10 18:47:16,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 18:47:16,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 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 143 [2022-01-10 18:47:16,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:47:16,753 INFO L225 Difference]: With dead ends: 861 [2022-01-10 18:47:16,753 INFO L226 Difference]: Without dead ends: 579 [2022-01-10 18:47:16,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 18:47:16,760 INFO L933 BasicCegarLoop]: 918 mSDtfsCounter, 1103 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:47:16,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1103 Valid, 1414 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:47:16,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2022-01-10 18:47:16,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 577. [2022-01-10 18:47:16,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 576 states have (on average 1.453125) internal successors, (837), 576 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:16,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 837 transitions. [2022-01-10 18:47:16,834 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 837 transitions. Word has length 143 [2022-01-10 18:47:16,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:47:16,834 INFO L470 AbstractCegarLoop]: Abstraction has 577 states and 837 transitions. [2022-01-10 18:47:16,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:16,836 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 837 transitions. [2022-01-10 18:47:16,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-01-10 18:47:16,844 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:47:16,845 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] [2022-01-10 18:47:16,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 18:47:16,845 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:47:16,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:47:16,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1306082307, now seen corresponding path program 1 times [2022-01-10 18:47:16,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:47:16,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905348215] [2022-01-10 18:47:16,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:47:16,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:47:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:47:16,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:47:16,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:47:16,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905348215] [2022-01-10 18:47:16,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905348215] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:47:16,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:47:16,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:47:16,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189993691] [2022-01-10 18:47:16,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:47:16,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:47:16,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:47:16,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:47:16,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:47:16,981 INFO L87 Difference]: Start difference. First operand 577 states and 837 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:17,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:47:17,022 INFO L93 Difference]: Finished difference Result 1693 states and 2447 transitions. [2022-01-10 18:47:17,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:47:17,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 144 [2022-01-10 18:47:17,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:47:17,026 INFO L225 Difference]: With dead ends: 1693 [2022-01-10 18:47:17,026 INFO L226 Difference]: Without dead ends: 1144 [2022-01-10 18:47:17,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:47:17,031 INFO L933 BasicCegarLoop]: 858 mSDtfsCounter, 425 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:47:17,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [425 Valid, 1285 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:47:17,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2022-01-10 18:47:17,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 579. [2022-01-10 18:47:17,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 578 states have (on average 1.4515570934256055) internal successors, (839), 578 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 839 transitions. [2022-01-10 18:47:17,060 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 839 transitions. Word has length 144 [2022-01-10 18:47:17,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:47:17,061 INFO L470 AbstractCegarLoop]: Abstraction has 579 states and 839 transitions. [2022-01-10 18:47:17,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:17,062 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 839 transitions. [2022-01-10 18:47:17,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 18:47:17,064 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:47:17,064 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] [2022-01-10 18:47:17,066 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 18:47:17,066 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:47:17,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:47:17,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1765271426, now seen corresponding path program 1 times [2022-01-10 18:47:17,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:47:17,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912048050] [2022-01-10 18:47:17,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:47:17,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:47:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:47:17,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:47:17,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:47:17,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912048050] [2022-01-10 18:47:17,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912048050] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:47:17,244 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:47:17,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 18:47:17,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752505060] [2022-01-10 18:47:17,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:47:17,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 18:47:17,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:47:17,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 18:47:17,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 18:47:17,245 INFO L87 Difference]: Start difference. First operand 579 states and 839 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:17,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:47:17,418 INFO L93 Difference]: Finished difference Result 2238 states and 3230 transitions. [2022-01-10 18:47:17,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 18:47:17,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2022-01-10 18:47:17,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:47:17,423 INFO L225 Difference]: With dead ends: 2238 [2022-01-10 18:47:17,423 INFO L226 Difference]: Without dead ends: 1671 [2022-01-10 18:47:17,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-10 18:47:17,424 INFO L933 BasicCegarLoop]: 1011 mSDtfsCounter, 1285 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1285 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:47:17,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1285 Valid, 2204 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:47:17,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2022-01-10 18:47:17,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1120. [2022-01-10 18:47:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 1119 states have (on average 1.4352100089365505) internal successors, (1606), 1119 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:17,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1606 transitions. [2022-01-10 18:47:17,475 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1606 transitions. Word has length 145 [2022-01-10 18:47:17,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:47:17,475 INFO L470 AbstractCegarLoop]: Abstraction has 1120 states and 1606 transitions. [2022-01-10 18:47:17,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:17,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1606 transitions. [2022-01-10 18:47:17,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-01-10 18:47:17,477 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:47:17,477 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] [2022-01-10 18:47:17,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 18:47:17,477 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:47:17,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:47:17,477 INFO L85 PathProgramCache]: Analyzing trace with hash 254527386, now seen corresponding path program 1 times [2022-01-10 18:47:17,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:47:17,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438531678] [2022-01-10 18:47:17,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:47:17,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:47:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:47:17,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:47:17,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:47:17,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438531678] [2022-01-10 18:47:17,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438531678] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:47:17,553 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:47:17,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 18:47:17,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240573483] [2022-01-10 18:47:17,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:47:17,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 18:47:17,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:47:17,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 18:47:17,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 18:47:17,554 INFO L87 Difference]: Start difference. First operand 1120 states and 1606 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:17,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:47:17,601 INFO L93 Difference]: Finished difference Result 1956 states and 2798 transitions. [2022-01-10 18:47:17,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 18:47:17,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2022-01-10 18:47:17,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:47:17,604 INFO L225 Difference]: With dead ends: 1956 [2022-01-10 18:47:17,604 INFO L226 Difference]: Without dead ends: 852 [2022-01-10 18:47:17,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 18:47:17,611 INFO L933 BasicCegarLoop]: 480 mSDtfsCounter, 69 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:47:17,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 1343 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:47:17,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2022-01-10 18:47:17,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 852. [2022-01-10 18:47:17,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 851 states have (on average 1.4289071680376029) internal successors, (1216), 851 states have internal predecessors, (1216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:17,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1216 transitions. [2022-01-10 18:47:17,665 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1216 transitions. Word has length 145 [2022-01-10 18:47:17,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:47:17,666 INFO L470 AbstractCegarLoop]: Abstraction has 852 states and 1216 transitions. [2022-01-10 18:47:17,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:17,666 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1216 transitions. [2022-01-10 18:47:17,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-01-10 18:47:17,667 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:47:17,667 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] [2022-01-10 18:47:17,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 18:47:17,668 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:47:17,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:47:17,668 INFO L85 PathProgramCache]: Analyzing trace with hash 151461027, now seen corresponding path program 1 times [2022-01-10 18:47:17,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:47:17,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766778749] [2022-01-10 18:47:17,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:47:17,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:47:17,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:47:17,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:47:17,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:47:17,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766778749] [2022-01-10 18:47:17,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766778749] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:47:17,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:47:17,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:47:17,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776609238] [2022-01-10 18:47:17,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:47:17,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:47:17,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:47:17,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:47:17,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:47:17,737 INFO L87 Difference]: Start difference. First operand 852 states and 1216 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:17,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:47:17,798 INFO L93 Difference]: Finished difference Result 1682 states and 2391 transitions. [2022-01-10 18:47:17,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:47:17,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2022-01-10 18:47:17,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:47:17,803 INFO L225 Difference]: With dead ends: 1682 [2022-01-10 18:47:17,803 INFO L226 Difference]: Without dead ends: 1125 [2022-01-10 18:47:17,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:47:17,804 INFO L933 BasicCegarLoop]: 478 mSDtfsCounter, 419 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:47:17,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [419 Valid, 898 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:47:17,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2022-01-10 18:47:17,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 852. [2022-01-10 18:47:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 851 states have (on average 1.427732079905993) internal successors, (1215), 851 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:17,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1215 transitions. [2022-01-10 18:47:17,850 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1215 transitions. Word has length 149 [2022-01-10 18:47:17,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:47:17,851 INFO L470 AbstractCegarLoop]: Abstraction has 852 states and 1215 transitions. [2022-01-10 18:47:17,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:17,851 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1215 transitions. [2022-01-10 18:47:17,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-10 18:47:17,852 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:47:17,852 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-10 18:47:17,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 18:47:17,853 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:47:17,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:47:17,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1102832233, now seen corresponding path program 1 times [2022-01-10 18:47:17,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:47:17,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771381345] [2022-01-10 18:47:17,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:47:17,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:47:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:47:17,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:47:17,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:47:17,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771381345] [2022-01-10 18:47:17,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771381345] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:47:17,954 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:47:17,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:47:17,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018873081] [2022-01-10 18:47:17,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:47:17,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:47:17,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:47:17,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:47:17,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:47:17,956 INFO L87 Difference]: Start difference. First operand 852 states and 1215 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-10 18:47:18,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:47:18,053 INFO L93 Difference]: Finished difference Result 2173 states and 3130 transitions. [2022-01-10 18:47:18,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:47:18,054 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-10 18:47:18,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:47:18,058 INFO L225 Difference]: With dead ends: 2173 [2022-01-10 18:47:18,058 INFO L226 Difference]: Without dead ends: 1578 [2022-01-10 18:47:18,059 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:47:18,059 INFO L933 BasicCegarLoop]: 802 mSDtfsCounter, 360 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:47:18,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [360 Valid, 1195 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:47:18,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2022-01-10 18:47:18,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1576. [2022-01-10 18:47:18,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.4177777777777778) internal successors, (2233), 1575 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:18,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2233 transitions. [2022-01-10 18:47:18,152 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2233 transitions. Word has length 150 [2022-01-10 18:47:18,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:47:18,157 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 2233 transitions. [2022-01-10 18:47:18,158 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-10 18:47:18,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2233 transitions. [2022-01-10 18:47:18,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-10 18:47:18,160 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:47:18,160 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-10 18:47:18,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 18:47:18,161 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:47:18,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:47:18,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1271976008, now seen corresponding path program 1 times [2022-01-10 18:47:18,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:47:18,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149789084] [2022-01-10 18:47:18,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:47:18,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:47:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:47:18,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-10 18:47:18,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:47:18,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149789084] [2022-01-10 18:47:18,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149789084] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:47:18,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:47:18,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 18:47:18,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337067239] [2022-01-10 18:47:18,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:47:18,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 18:47:18,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:47:18,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 18:47:18,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 18:47:18,267 INFO L87 Difference]: Start difference. First operand 1576 states and 2233 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 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-10 18:47:18,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:47:18,404 INFO L93 Difference]: Finished difference Result 3904 states and 5525 transitions. [2022-01-10 18:47:18,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 18:47:18,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 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-10 18:47:18,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:47:18,411 INFO L225 Difference]: With dead ends: 3904 [2022-01-10 18:47:18,411 INFO L226 Difference]: Without dead ends: 2411 [2022-01-10 18:47:18,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 18:47:18,415 INFO L933 BasicCegarLoop]: 509 mSDtfsCounter, 826 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:47:18,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [826 Valid, 919 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:47:18,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2022-01-10 18:47:18,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 1581. [2022-01-10 18:47:18,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1580 states have (on average 1.4145569620253164) internal successors, (2235), 1580 states have internal predecessors, (2235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:18,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2235 transitions. [2022-01-10 18:47:18,512 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2235 transitions. Word has length 150 [2022-01-10 18:47:18,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:47:18,512 INFO L470 AbstractCegarLoop]: Abstraction has 1581 states and 2235 transitions. [2022-01-10 18:47:18,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 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-10 18:47:18,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2235 transitions. [2022-01-10 18:47:18,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-10 18:47:18,514 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:47:18,514 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:47:18,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 18:47:18,514 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:47:18,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:47:18,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1259389452, now seen corresponding path program 1 times [2022-01-10 18:47:18,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:47:18,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905146500] [2022-01-10 18:47:18,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:47:18,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:47:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:47:18,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:47:18,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:47:18,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905146500] [2022-01-10 18:47:18,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905146500] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:47:18,636 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:47:18,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 18:47:18,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647167943] [2022-01-10 18:47:18,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:47:18,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 18:47:18,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:47:18,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 18:47:18,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 18:47:18,637 INFO L87 Difference]: Start difference. First operand 1581 states and 2235 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 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-10 18:47:18,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:47:18,875 INFO L93 Difference]: Finished difference Result 4508 states and 6359 transitions. [2022-01-10 18:47:18,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 18:47:18,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 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-10 18:47:18,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:47:18,883 INFO L225 Difference]: With dead ends: 4508 [2022-01-10 18:47:18,883 INFO L226 Difference]: Without dead ends: 2995 [2022-01-10 18:47:18,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 18:47:18,885 INFO L933 BasicCegarLoop]: 722 mSDtfsCounter, 851 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:47:18,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [851 Valid, 1109 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:47:18,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2022-01-10 18:47:19,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2993. [2022-01-10 18:47:19,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2993 states, 2992 states have (on average 1.3997326203208555) internal successors, (4188), 2992 states have internal predecessors, (4188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:19,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2993 states to 2993 states and 4188 transitions. [2022-01-10 18:47:19,116 INFO L78 Accepts]: Start accepts. Automaton has 2993 states and 4188 transitions. Word has length 150 [2022-01-10 18:47:19,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:47:19,116 INFO L470 AbstractCegarLoop]: Abstraction has 2993 states and 4188 transitions. [2022-01-10 18:47:19,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 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-10 18:47:19,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2993 states and 4188 transitions. [2022-01-10 18:47:19,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-01-10 18:47:19,136 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:47:19,136 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-10 18:47:19,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 18:47:19,136 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:47:19,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:47:19,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1410028281, now seen corresponding path program 1 times [2022-01-10 18:47:19,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:47:19,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550322941] [2022-01-10 18:47:19,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:47:19,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:47:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:47:19,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:47:19,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:47:19,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550322941] [2022-01-10 18:47:19,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550322941] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:47:19,215 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:47:19,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 18:47:19,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249449311] [2022-01-10 18:47:19,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:47:19,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 18:47:19,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:47:19,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 18:47:19,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 18:47:19,216 INFO L87 Difference]: Start difference. First operand 2993 states and 4188 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 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-10 18:47:19,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:47:19,370 INFO L93 Difference]: Finished difference Result 4311 states and 6062 transitions. [2022-01-10 18:47:19,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 18:47:19,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 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-10 18:47:19,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:47:19,376 INFO L225 Difference]: With dead ends: 4311 [2022-01-10 18:47:19,376 INFO L226 Difference]: Without dead ends: 2492 [2022-01-10 18:47:19,378 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 18:47:19,379 INFO L933 BasicCegarLoop]: 466 mSDtfsCounter, 47 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:47:19,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 1324 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:47:19,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2022-01-10 18:47:19,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 2492. [2022-01-10 18:47:19,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2492 states, 2491 states have (on average 1.400240867121638) internal successors, (3488), 2491 states have internal predecessors, (3488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:19,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2492 states to 2492 states and 3488 transitions. [2022-01-10 18:47:19,586 INFO L78 Accepts]: Start accepts. Automaton has 2492 states and 3488 transitions. Word has length 152 [2022-01-10 18:47:19,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:47:19,586 INFO L470 AbstractCegarLoop]: Abstraction has 2492 states and 3488 transitions. [2022-01-10 18:47:19,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 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-10 18:47:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2492 states and 3488 transitions. [2022-01-10 18:47:19,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-01-10 18:47:19,589 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:47:19,589 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-10 18:47:19,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 18:47:19,590 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:47:19,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:47:19,590 INFO L85 PathProgramCache]: Analyzing trace with hash -974976497, now seen corresponding path program 1 times [2022-01-10 18:47:19,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:47:19,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203426846] [2022-01-10 18:47:19,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:47:19,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:47:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:47:19,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:47:19,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:47:19,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203426846] [2022-01-10 18:47:19,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203426846] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:47:19,704 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:47:19,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 18:47:19,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143536594] [2022-01-10 18:47:19,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:47:19,705 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 18:47:19,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:47:19,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 18:47:19,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 18:47:19,706 INFO L87 Difference]: Start difference. First operand 2492 states and 3488 transitions. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 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-10 18:47:20,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:47:20,009 INFO L93 Difference]: Finished difference Result 6551 states and 9138 transitions. [2022-01-10 18:47:20,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 18:47:20,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 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-10 18:47:20,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:47:20,039 INFO L225 Difference]: With dead ends: 6551 [2022-01-10 18:47:20,040 INFO L226 Difference]: Without dead ends: 4103 [2022-01-10 18:47:20,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-10 18:47:20,042 INFO L933 BasicCegarLoop]: 972 mSDtfsCounter, 1198 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 2124 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:47:20,042 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1198 Valid, 2124 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:47:20,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2022-01-10 18:47:20,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 2641. [2022-01-10 18:47:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2641 states, 2640 states have (on average 1.3867424242424242) internal successors, (3661), 2640 states have internal predecessors, (3661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:20,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2641 states to 2641 states and 3661 transitions. [2022-01-10 18:47:20,208 INFO L78 Accepts]: Start accepts. Automaton has 2641 states and 3661 transitions. Word has length 152 [2022-01-10 18:47:20,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:47:20,209 INFO L470 AbstractCegarLoop]: Abstraction has 2641 states and 3661 transitions. [2022-01-10 18:47:20,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 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-10 18:47:20,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2641 states and 3661 transitions. [2022-01-10 18:47:20,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-01-10 18:47:20,228 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:47:20,228 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-10 18:47:20,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 18:47:20,228 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:47:20,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:47:20,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1509244531, now seen corresponding path program 1 times [2022-01-10 18:47:20,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:47:20,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245237709] [2022-01-10 18:47:20,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:47:20,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:47:20,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:47:20,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:47:20,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:47:20,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245237709] [2022-01-10 18:47:20,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245237709] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:47:20,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:47:20,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 18:47:20,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604473498] [2022-01-10 18:47:20,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:47:20,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 18:47:20,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:47:20,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 18:47:20,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 18:47:20,294 INFO L87 Difference]: Start difference. First operand 2641 states and 3661 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 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-10 18:47:20,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:47:20,428 INFO L93 Difference]: Finished difference Result 4750 states and 6573 transitions. [2022-01-10 18:47:20,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 18:47:20,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 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-10 18:47:20,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:47:20,435 INFO L225 Difference]: With dead ends: 4750 [2022-01-10 18:47:20,435 INFO L226 Difference]: Without dead ends: 2145 [2022-01-10 18:47:20,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 18:47:20,439 INFO L933 BasicCegarLoop]: 464 mSDtfsCounter, 47 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:47:20,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 1319 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:47:20,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2022-01-10 18:47:20,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 2145. [2022-01-10 18:47:20,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2145 states, 2144 states have (on average 1.381063432835821) internal successors, (2961), 2144 states have internal predecessors, (2961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:20,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 2961 transitions. [2022-01-10 18:47:20,580 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 2961 transitions. Word has length 152 [2022-01-10 18:47:20,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:47:20,580 INFO L470 AbstractCegarLoop]: Abstraction has 2145 states and 2961 transitions. [2022-01-10 18:47:20,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 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-10 18:47:20,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 2961 transitions. [2022-01-10 18:47:20,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-01-10 18:47:20,582 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:47:20,582 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:47:20,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 18:47:20,583 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:47:20,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:47:20,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1771160545, now seen corresponding path program 1 times [2022-01-10 18:47:20,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:47:20,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086118453] [2022-01-10 18:47:20,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:47:20,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:47:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:47:20,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:47:20,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:47:20,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086118453] [2022-01-10 18:47:20,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086118453] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:47:20,632 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:47:20,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:47:20,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031910149] [2022-01-10 18:47:20,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:47:20,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:47:20,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:47:20,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:47:20,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:47:20,633 INFO L87 Difference]: Start difference. First operand 2145 states and 2961 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:20,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:47:20,769 INFO L93 Difference]: Finished difference Result 4185 states and 5788 transitions. [2022-01-10 18:47:20,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:47:20,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2022-01-10 18:47:20,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:47:20,777 INFO L225 Difference]: With dead ends: 4185 [2022-01-10 18:47:20,778 INFO L226 Difference]: Without dead ends: 2950 [2022-01-10 18:47:20,779 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:47:20,780 INFO L933 BasicCegarLoop]: 734 mSDtfsCounter, 404 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:47:20,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [404 Valid, 1150 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:47:20,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2022-01-10 18:47:20,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2145. [2022-01-10 18:47:20,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2145 states, 2144 states have (on average 1.3796641791044777) internal successors, (2958), 2144 states have internal predecessors, (2958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 2958 transitions. [2022-01-10 18:47:20,909 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 2958 transitions. Word has length 159 [2022-01-10 18:47:20,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:47:20,909 INFO L470 AbstractCegarLoop]: Abstraction has 2145 states and 2958 transitions. [2022-01-10 18:47:20,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:20,909 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 2958 transitions. [2022-01-10 18:47:20,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-10 18:47:20,911 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:47:20,911 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:47:20,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 18:47:20,912 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:47:20,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:47:20,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1456261610, now seen corresponding path program 1 times [2022-01-10 18:47:20,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:47:20,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239141339] [2022-01-10 18:47:20,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:47:20,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:47:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:47:21,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:47:21,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:47:21,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239141339] [2022-01-10 18:47:21,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239141339] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:47:21,014 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:47:21,014 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:47:21,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846068046] [2022-01-10 18:47:21,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:47:21,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:47:21,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:47:21,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:47:21,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:47:21,015 INFO L87 Difference]: Start difference. First operand 2145 states and 2958 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:21,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:47:21,239 INFO L93 Difference]: Finished difference Result 4810 states and 6728 transitions. [2022-01-10 18:47:21,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:47:21,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2022-01-10 18:47:21,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:47:21,258 INFO L225 Difference]: With dead ends: 4810 [2022-01-10 18:47:21,258 INFO L226 Difference]: Without dead ends: 3272 [2022-01-10 18:47:21,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:47:21,260 INFO L933 BasicCegarLoop]: 783 mSDtfsCounter, 344 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:47:21,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [344 Valid, 1166 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:47:21,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3272 states. [2022-01-10 18:47:21,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3272 to 3270. [2022-01-10 18:47:21,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3270 states, 3269 states have (on average 1.3664729275007648) internal successors, (4467), 3269 states have internal predecessors, (4467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:21,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 3270 states and 4467 transitions. [2022-01-10 18:47:21,482 INFO L78 Accepts]: Start accepts. Automaton has 3270 states and 4467 transitions. Word has length 160 [2022-01-10 18:47:21,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:47:21,483 INFO L470 AbstractCegarLoop]: Abstraction has 3270 states and 4467 transitions. [2022-01-10 18:47:21,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:21,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3270 states and 4467 transitions. [2022-01-10 18:47:21,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-10 18:47:21,486 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:47:21,486 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:47:21,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 18:47:21,487 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:47:21,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:47:21,487 INFO L85 PathProgramCache]: Analyzing trace with hash -411260865, now seen corresponding path program 1 times [2022-01-10 18:47:21,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:47:21,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179573455] [2022-01-10 18:47:21,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:47:21,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:47:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:47:21,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:47:21,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:47:21,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179573455] [2022-01-10 18:47:21,583 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179573455] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:47:21,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:47:21,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:47:21,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080306549] [2022-01-10 18:47:21,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:47:21,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:47:21,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:47:21,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:47:21,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:47:21,584 INFO L87 Difference]: Start difference. First operand 3270 states and 4467 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:21,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:47:21,840 INFO L93 Difference]: Finished difference Result 7352 states and 10150 transitions. [2022-01-10 18:47:21,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:47:21,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2022-01-10 18:47:21,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:47:21,852 INFO L225 Difference]: With dead ends: 7352 [2022-01-10 18:47:21,852 INFO L226 Difference]: Without dead ends: 4959 [2022-01-10 18:47:21,854 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:47:21,854 INFO L933 BasicCegarLoop]: 795 mSDtfsCounter, 347 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:47:21,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 1179 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:47:21,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4959 states. [2022-01-10 18:47:22,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4959 to 4957. [2022-01-10 18:47:22,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4957 states, 4956 states have (on average 1.349677158999193) internal successors, (6689), 4956 states have internal predecessors, (6689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:22,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4957 states to 4957 states and 6689 transitions. [2022-01-10 18:47:22,098 INFO L78 Accepts]: Start accepts. Automaton has 4957 states and 6689 transitions. Word has length 160 [2022-01-10 18:47:22,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:47:22,098 INFO L470 AbstractCegarLoop]: Abstraction has 4957 states and 6689 transitions. [2022-01-10 18:47:22,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:22,098 INFO L276 IsEmpty]: Start isEmpty. Operand 4957 states and 6689 transitions. [2022-01-10 18:47:22,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-01-10 18:47:22,103 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:47:22,103 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:47:22,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 18:47:22,103 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:47:22,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:47:22,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1777002831, now seen corresponding path program 1 times [2022-01-10 18:47:22,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:47:22,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921789557] [2022-01-10 18:47:22,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:47:22,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:47:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:47:22,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:47:22,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:47:22,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921789557] [2022-01-10 18:47:22,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921789557] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:47:22,237 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:47:22,237 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 18:47:22,237 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433908233] [2022-01-10 18:47:22,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:47:22,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 18:47:22,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:47:22,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 18:47:22,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 18:47:22,238 INFO L87 Difference]: Start difference. First operand 4957 states and 6689 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:47:22,554 INFO L93 Difference]: Finished difference Result 9908 states and 13377 transitions. [2022-01-10 18:47:22,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 18:47:22,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2022-01-10 18:47:22,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:47:22,562 INFO L225 Difference]: With dead ends: 9908 [2022-01-10 18:47:22,563 INFO L226 Difference]: Without dead ends: 5102 [2022-01-10 18:47:22,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 18:47:22,570 INFO L933 BasicCegarLoop]: 690 mSDtfsCounter, 835 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:47:22,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [835 Valid, 1067 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:47:22,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5102 states. [2022-01-10 18:47:22,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5102 to 5048. [2022-01-10 18:47:22,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5048 states, 5047 states have (on average 1.3445611254210421) internal successors, (6786), 5047 states have internal predecessors, (6786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:22,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5048 states to 5048 states and 6786 transitions. [2022-01-10 18:47:22,876 INFO L78 Accepts]: Start accepts. Automaton has 5048 states and 6786 transitions. Word has length 163 [2022-01-10 18:47:22,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:47:22,876 INFO L470 AbstractCegarLoop]: Abstraction has 5048 states and 6786 transitions. [2022-01-10 18:47:22,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:22,876 INFO L276 IsEmpty]: Start isEmpty. Operand 5048 states and 6786 transitions. [2022-01-10 18:47:22,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-01-10 18:47:22,880 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:47:22,881 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:47:22,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 18:47:22,881 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:47:22,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:47:22,881 INFO L85 PathProgramCache]: Analyzing trace with hash 734837525, now seen corresponding path program 1 times [2022-01-10 18:47:22,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:47:22,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030651385] [2022-01-10 18:47:22,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:47:22,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:47:22,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:47:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:47:22,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:47:22,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030651385] [2022-01-10 18:47:22,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030651385] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:47:22,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:47:22,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 18:47:22,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636172174] [2022-01-10 18:47:22,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:47:22,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 18:47:22,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:47:22,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 18:47:22,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:47:22,937 INFO L87 Difference]: Start difference. First operand 5048 states and 6786 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:23,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:47:23,516 INFO L93 Difference]: Finished difference Result 13286 states and 17975 transitions. [2022-01-10 18:47:23,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 18:47:23,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2022-01-10 18:47:23,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:47:23,529 INFO L225 Difference]: With dead ends: 13286 [2022-01-10 18:47:23,529 INFO L226 Difference]: Without dead ends: 9896 [2022-01-10 18:47:23,533 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 18:47:23,533 INFO L933 BasicCegarLoop]: 822 mSDtfsCounter, 397 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:47:23,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [397 Valid, 1241 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:47:23,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9896 states. [2022-01-10 18:47:23,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9896 to 5058. [2022-01-10 18:47:23,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5058 states, 5057 states have (on average 1.3438797706149892) internal successors, (6796), 5057 states have internal predecessors, (6796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:23,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5058 states to 5058 states and 6796 transitions. [2022-01-10 18:47:23,870 INFO L78 Accepts]: Start accepts. Automaton has 5058 states and 6796 transitions. Word has length 164 [2022-01-10 18:47:23,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:47:23,871 INFO L470 AbstractCegarLoop]: Abstraction has 5058 states and 6796 transitions. [2022-01-10 18:47:23,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:23,871 INFO L276 IsEmpty]: Start isEmpty. Operand 5058 states and 6796 transitions. [2022-01-10 18:47:23,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 18:47:23,875 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:47:23,875 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:47:23,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 18:47:23,876 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:47:23,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:47:23,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1568014646, now seen corresponding path program 1 times [2022-01-10 18:47:23,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:47:23,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542908171] [2022-01-10 18:47:23,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:47:23,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:47:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:47:24,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:47:24,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:47:24,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542908171] [2022-01-10 18:47:24,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542908171] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:47:24,011 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:47:24,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 18:47:24,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692039394] [2022-01-10 18:47:24,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:47:24,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 18:47:24,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:47:24,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 18:47:24,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 18:47:24,012 INFO L87 Difference]: Start difference. First operand 5058 states and 6796 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:24,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:47:24,555 INFO L93 Difference]: Finished difference Result 12924 states and 17377 transitions. [2022-01-10 18:47:24,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 18:47:24,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 18:47:24,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:47:24,568 INFO L225 Difference]: With dead ends: 12924 [2022-01-10 18:47:24,568 INFO L226 Difference]: Without dead ends: 8452 [2022-01-10 18:47:24,572 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-10 18:47:24,573 INFO L933 BasicCegarLoop]: 972 mSDtfsCounter, 1230 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:47:24,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1230 Valid, 1750 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:47:24,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8452 states. [2022-01-10 18:47:24,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8452 to 5291. [2022-01-10 18:47:24,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5291 states, 5290 states have (on average 1.332514177693762) internal successors, (7049), 5290 states have internal predecessors, (7049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:24,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5291 states to 5291 states and 7049 transitions. [2022-01-10 18:47:24,927 INFO L78 Accepts]: Start accepts. Automaton has 5291 states and 7049 transitions. Word has length 165 [2022-01-10 18:47:24,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:47:24,927 INFO L470 AbstractCegarLoop]: Abstraction has 5291 states and 7049 transitions. [2022-01-10 18:47:24,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:24,927 INFO L276 IsEmpty]: Start isEmpty. Operand 5291 states and 7049 transitions. [2022-01-10 18:47:24,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-01-10 18:47:24,933 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:47:24,933 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:47:24,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 18:47:24,933 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:47:24,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:47:24,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1790018222, now seen corresponding path program 1 times [2022-01-10 18:47:24,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:47:24,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372612327] [2022-01-10 18:47:24,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:47:24,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:47:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:47:25,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:47:25,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:47:25,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372612327] [2022-01-10 18:47:25,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372612327] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:47:25,064 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:47:25,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 18:47:25,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087477024] [2022-01-10 18:47:25,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:47:25,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 18:47:25,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:47:25,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 18:47:25,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 18:47:25,065 INFO L87 Difference]: Start difference. First operand 5291 states and 7049 transitions. Second operand has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:25,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 18:47:25,333 INFO L93 Difference]: Finished difference Result 8371 states and 11191 transitions. [2022-01-10 18:47:25,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 18:47:25,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2022-01-10 18:47:25,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 18:47:25,343 INFO L225 Difference]: With dead ends: 8371 [2022-01-10 18:47:25,343 INFO L226 Difference]: Without dead ends: 4579 [2022-01-10 18:47:25,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 18:47:25,347 INFO L933 BasicCegarLoop]: 446 mSDtfsCounter, 23 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 18:47:25,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 1292 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 18:47:25,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4579 states. [2022-01-10 18:47:25,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4579 to 4579. [2022-01-10 18:47:25,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4579 states, 4578 states have (on average 1.3300567933595457) internal successors, (6089), 4578 states have internal predecessors, (6089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:25,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4579 states to 4579 states and 6089 transitions. [2022-01-10 18:47:25,688 INFO L78 Accepts]: Start accepts. Automaton has 4579 states and 6089 transitions. Word has length 165 [2022-01-10 18:47:25,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 18:47:25,688 INFO L470 AbstractCegarLoop]: Abstraction has 4579 states and 6089 transitions. [2022-01-10 18:47:25,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 18:47:25,688 INFO L276 IsEmpty]: Start isEmpty. Operand 4579 states and 6089 transitions. [2022-01-10 18:47:25,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-01-10 18:47:25,692 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 18:47:25,692 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 18:47:25,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 18:47:25,693 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 18:47:25,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 18:47:25,693 INFO L85 PathProgramCache]: Analyzing trace with hash -520350485, now seen corresponding path program 1 times [2022-01-10 18:47:25,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 18:47:25,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245991133] [2022-01-10 18:47:25,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 18:47:25,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 18:47:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 18:47:31,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 18:47:31,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 18:47:31,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245991133] [2022-01-10 18:47:31,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245991133] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 18:47:31,889 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 18:47:31,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-10 18:47:31,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191529722] [2022-01-10 18:47:31,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 18:47:31,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-10 18:47:31,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 18:47:31,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-10 18:47:31,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=209, Unknown=1, NotChecked=0, Total=240 [2022-01-10 18:47:31,890 INFO L87 Difference]: Start difference. First operand 4579 states and 6089 transitions. Second operand has 16 states, 16 states have (on average 10.625) internal successors, (170), 15 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)