/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 00:36:36,803 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 00:36:36,805 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 00:36:36,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 00:36:36,857 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 00:36:36,859 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 00:36:36,861 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 00:36:36,863 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 00:36:36,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 00:36:36,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 00:36:36,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 00:36:36,869 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 00:36:36,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 00:36:36,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 00:36:36,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 00:36:36,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 00:36:36,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 00:36:36,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 00:36:36,876 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 00:36:36,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 00:36:36,880 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 00:36:36,881 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 00:36:36,882 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 00:36:36,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 00:36:36,886 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 00:36:36,887 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 00:36:36,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 00:36:36,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 00:36:36,888 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 00:36:36,889 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 00:36:36,889 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 00:36:36,889 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 00:36:36,890 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 00:36:36,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 00:36:36,892 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 00:36:36,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 00:36:36,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 00:36:36,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 00:36:36,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 00:36:36,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 00:36:36,893 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 00:36:36,894 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-11 00:36:36,915 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 00:36:36,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 00:36:36,916 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 00:36:36,916 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 00:36:36,917 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 00:36:36,917 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 00:36:36,917 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 00:36:36,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 00:36:36,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 00:36:36,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 00:36:36,918 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 00:36:36,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 00:36:36,918 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 00:36:36,918 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 00:36:36,918 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 00:36:36,918 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 00:36:36,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 00:36:36,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 00:36:36,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 00:36:36,919 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 00:36:36,919 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 00:36:36,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:36:36,920 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 00:36:36,920 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 00:36:36,920 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 00:36:36,920 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 00:36:36,920 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 00:36:36,920 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 00:36:36,920 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 00:36:36,920 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 00:36:36,920 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 00:36:36,920 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 00:36:36,921 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 00:36:36,921 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 00:36:37,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 00:36:37,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 00:36:37,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 00:36:37,100 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 00:36:37,104 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 00:36:37,105 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.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-01-11 00:36:37,152 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92e2e7b3a/e9bc6530c3b04d578f54c51e8ffeaab4/FLAG784816189 [2022-01-11 00:36:37,547 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 00:36:37,548 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2022-01-11 00:36:37,556 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92e2e7b3a/e9bc6530c3b04d578f54c51e8ffeaab4/FLAG784816189 [2022-01-11 00:36:37,572 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92e2e7b3a/e9bc6530c3b04d578f54c51e8ffeaab4 [2022-01-11 00:36:37,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 00:36:37,574 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 00:36:37,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 00:36:37,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 00:36:37,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 00:36:37,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:36:37" (1/1) ... [2022-01-11 00:36:37,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2374bad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:36:37, skipping insertion in model container [2022-01-11 00:36:37,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 12:36:37" (1/1) ... [2022-01-11 00:36:37,584 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 00:36:37,624 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 00:36:37,851 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.BOUNDED-6.pals.c.v+nlh-reducer.c[14145,14158] [2022-01-11 00:36:37,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:36:37,910 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 00:36:37,984 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.BOUNDED-6.pals.c.v+nlh-reducer.c[14145,14158] [2022-01-11 00:36:38,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 00:36:38,037 INFO L208 MainTranslator]: Completed translation [2022-01-11 00:36:38,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:36:38 WrapperNode [2022-01-11 00:36:38,037 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 00:36:38,038 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 00:36:38,038 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 00:36:38,038 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 00:36:38,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:36:38" (1/1) ... [2022-01-11 00:36:38,074 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:36:38" (1/1) ... [2022-01-11 00:36:38,107 INFO L137 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1139 [2022-01-11 00:36:38,107 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 00:36:38,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 00:36:38,108 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 00:36:38,108 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 00:36:38,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:36:38" (1/1) ... [2022-01-11 00:36:38,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:36:38" (1/1) ... [2022-01-11 00:36:38,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:36:38" (1/1) ... [2022-01-11 00:36:38,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:36:38" (1/1) ... [2022-01-11 00:36:38,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:36:38" (1/1) ... [2022-01-11 00:36:38,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:36:38" (1/1) ... [2022-01-11 00:36:38,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:36:38" (1/1) ... [2022-01-11 00:36:38,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 00:36:38,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 00:36:38,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 00:36:38,144 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 00:36:38,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:36:38" (1/1) ... [2022-01-11 00:36:38,149 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 00:36:38,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 00:36:38,179 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 00:36:38,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 00:36:38,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 00:36:38,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 00:36:38,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 00:36:38,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 00:36:38,278 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 00:36:38,279 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 00:36:39,083 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 00:36:39,111 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 00:36:39,111 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-11 00:36:39,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:36:39 BoogieIcfgContainer [2022-01-11 00:36:39,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 00:36:39,115 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 00:36:39,115 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 00:36:39,116 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 00:36:39,118 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:36:39" (1/1) ... [2022-01-11 00:36:39,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:36:39 BasicIcfg [2022-01-11 00:36:39,696 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 00:36:39,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 00:36:39,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 00:36:39,699 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 00:36:39,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 12:36:37" (1/4) ... [2022-01-11 00:36:39,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@183d9fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:36:39, skipping insertion in model container [2022-01-11 00:36:39,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 12:36:38" (2/4) ... [2022-01-11 00:36:39,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@183d9fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 12:36:39, skipping insertion in model container [2022-01-11 00:36:39,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 12:36:39" (3/4) ... [2022-01-11 00:36:39,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@183d9fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 12:36:39, skipping insertion in model container [2022-01-11 00:36:39,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 12:36:39" (4/4) ... [2022-01-11 00:36:39,704 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+nlh-reducer.cTransformedIcfg [2022-01-11 00:36:39,708 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 00:36:39,708 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 00:36:39,749 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 00:36:39,754 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 00:36:39,754 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 00:36:39,773 INFO L276 IsEmpty]: Start isEmpty. Operand has 294 states, 292 states have (on average 1.7945205479452055) internal successors, (524), 293 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:39,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-01-11 00:36:39,785 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:36:39,786 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] [2022-01-11 00:36:39,786 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:36:39,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:36:39,791 INFO L85 PathProgramCache]: Analyzing trace with hash -880518631, now seen corresponding path program 1 times [2022-01-11 00:36:39,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:36:39,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670391393] [2022-01-11 00:36:39,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:36:39,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:36:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:36:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:36:40,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:36:40,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670391393] [2022-01-11 00:36:40,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670391393] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:36:40,310 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:36:40,310 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:36:40,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715538977] [2022-01-11 00:36:40,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:36:40,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:36:40,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:36:40,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:36:40,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:36:40,339 INFO L87 Difference]: Start difference. First operand has 294 states, 292 states have (on average 1.7945205479452055) internal successors, (524), 293 states have internal predecessors, (524), 0 states have call successors, (0), 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.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:40,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:36:40,487 INFO L93 Difference]: Finished difference Result 840 states and 1501 transitions. [2022-01-11 00:36:40,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:36:40,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2022-01-11 00:36:40,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:36:40,508 INFO L225 Difference]: With dead ends: 840 [2022-01-11 00:36:40,508 INFO L226 Difference]: Without dead ends: 565 [2022-01-11 00:36:40,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:36:40,516 INFO L933 BasicCegarLoop]: 894 mSDtfsCounter, 1082 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 1379 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-11 00:36:40,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1082 Valid, 1379 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:36:40,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-01-11 00:36:40,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 563. [2022-01-11 00:36:40,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 562 states have (on average 1.4537366548042705) internal successors, (817), 562 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:40,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 817 transitions. [2022-01-11 00:36:40,589 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 817 transitions. Word has length 141 [2022-01-11 00:36:40,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:36:40,590 INFO L470 AbstractCegarLoop]: Abstraction has 563 states and 817 transitions. [2022-01-11 00:36:40,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:40,590 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 817 transitions. [2022-01-11 00:36:40,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-01-11 00:36:40,599 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:36:40,599 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] [2022-01-11 00:36:40,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 00:36:40,600 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:36:40,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:36:40,601 INFO L85 PathProgramCache]: Analyzing trace with hash 197652349, now seen corresponding path program 1 times [2022-01-11 00:36:40,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:36:40,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95975186] [2022-01-11 00:36:40,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:36:40,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:36:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:36:40,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:36:40,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:36:40,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95975186] [2022-01-11 00:36:40,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95975186] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:36:40,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:36:40,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:36:40,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433146614] [2022-01-11 00:36:40,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:36:40,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:36:40,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:36:40,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:36:40,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:36:40,739 INFO L87 Difference]: Start difference. First operand 563 states and 817 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:40,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:36:40,774 INFO L93 Difference]: Finished difference Result 1651 states and 2387 transitions. [2022-01-11 00:36:40,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:36:40,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2022-01-11 00:36:40,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:36:40,777 INFO L225 Difference]: With dead ends: 1651 [2022-01-11 00:36:40,778 INFO L226 Difference]: Without dead ends: 1116 [2022-01-11 00:36:40,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:36:40,783 INFO L933 BasicCegarLoop]: 838 mSDtfsCounter, 415 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1255 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-11 00:36:40,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [415 Valid, 1255 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:36:40,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2022-01-11 00:36:40,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 565. [2022-01-11 00:36:40,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 1.452127659574468) internal successors, (819), 564 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 819 transitions. [2022-01-11 00:36:40,806 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 819 transitions. Word has length 142 [2022-01-11 00:36:40,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:36:40,807 INFO L470 AbstractCegarLoop]: Abstraction has 565 states and 819 transitions. [2022-01-11 00:36:40,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:40,808 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 819 transitions. [2022-01-11 00:36:40,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 00:36:40,810 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:36:40,810 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-11 00:36:40,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 00:36:40,812 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:36:40,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:36:40,815 INFO L85 PathProgramCache]: Analyzing trace with hash 463766558, now seen corresponding path program 1 times [2022-01-11 00:36:40,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:36:40,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247225116] [2022-01-11 00:36:40,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:36:40,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:36:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:36:41,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:36:41,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:36:41,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247225116] [2022-01-11 00:36:41,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247225116] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:36:41,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:36:41,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:36:41,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498476453] [2022-01-11 00:36:41,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:36:41,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:36:41,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:36:41,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:36:41,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:36:41,042 INFO L87 Difference]: Start difference. First operand 565 states and 819 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 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-11 00:36:41,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:36:41,170 INFO L93 Difference]: Finished difference Result 2182 states and 3150 transitions. [2022-01-11 00:36:41,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 00:36:41,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 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-11 00:36:41,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:36:41,176 INFO L225 Difference]: With dead ends: 2182 [2022-01-11 00:36:41,176 INFO L226 Difference]: Without dead ends: 1629 [2022-01-11 00:36:41,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-11 00:36:41,182 INFO L933 BasicCegarLoop]: 981 mSDtfsCounter, 1361 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 00:36:41,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1361 Valid, 1756 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:36:41,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2022-01-11 00:36:41,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1092. [2022-01-11 00:36:41,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1091 states have (on average 1.4353803849679194) internal successors, (1566), 1091 states have internal predecessors, (1566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:41,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1566 transitions. [2022-01-11 00:36:41,233 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1566 transitions. Word has length 143 [2022-01-11 00:36:41,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:36:41,234 INFO L470 AbstractCegarLoop]: Abstraction has 1092 states and 1566 transitions. [2022-01-11 00:36:41,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 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-11 00:36:41,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1566 transitions. [2022-01-11 00:36:41,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-01-11 00:36:41,235 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:36:41,236 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-11 00:36:41,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 00:36:41,236 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:36:41,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:36:41,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1071560134, now seen corresponding path program 1 times [2022-01-11 00:36:41,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:36:41,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933685913] [2022-01-11 00:36:41,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:36:41,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:36:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:36:41,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:36:41,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:36:41,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933685913] [2022-01-11 00:36:41,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933685913] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:36:41,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:36:41,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:36:41,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687507671] [2022-01-11 00:36:41,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:36:41,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:36:41,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:36:41,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:36:41,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:36:41,364 INFO L87 Difference]: Start difference. First operand 1092 states and 1566 transitions. 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-11 00:36:41,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:36:41,430 INFO L93 Difference]: Finished difference Result 1907 states and 2728 transitions. [2022-01-11 00:36:41,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:36:41,431 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-11 00:36:41,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:36:41,433 INFO L225 Difference]: With dead ends: 1907 [2022-01-11 00:36:41,434 INFO L226 Difference]: Without dead ends: 831 [2022-01-11 00:36:41,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:36:41,439 INFO L933 BasicCegarLoop]: 470 mSDtfsCounter, 69 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1313 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-11 00:36:41,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 1313 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:36:41,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2022-01-11 00:36:41,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 831. [2022-01-11 00:36:41,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 830 states have (on average 1.4289156626506023) internal successors, (1186), 830 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:41,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1186 transitions. [2022-01-11 00:36:41,488 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1186 transitions. Word has length 143 [2022-01-11 00:36:41,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:36:41,489 INFO L470 AbstractCegarLoop]: Abstraction has 831 states and 1186 transitions. [2022-01-11 00:36:41,490 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-11 00:36:41,490 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1186 transitions. [2022-01-11 00:36:41,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-01-11 00:36:41,491 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:36:41,491 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] [2022-01-11 00:36:41,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 00:36:41,492 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:36:41,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:36:41,492 INFO L85 PathProgramCache]: Analyzing trace with hash -2123691782, now seen corresponding path program 1 times [2022-01-11 00:36:41,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:36:41,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272992303] [2022-01-11 00:36:41,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:36:41,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:36:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:36:41,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:36:41,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:36:41,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272992303] [2022-01-11 00:36:41,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272992303] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:36:41,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:36:41,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:36:41,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054742338] [2022-01-11 00:36:41,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:36:41,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:36:41,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:36:41,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:36:41,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:36:41,582 INFO L87 Difference]: Start difference. First operand 831 states and 1186 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:41,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:36:41,649 INFO L93 Difference]: Finished difference Result 1640 states and 2331 transitions. [2022-01-11 00:36:41,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:36:41,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2022-01-11 00:36:41,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:36:41,654 INFO L225 Difference]: With dead ends: 1640 [2022-01-11 00:36:41,654 INFO L226 Difference]: Without dead ends: 1097 [2022-01-11 00:36:41,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:36:41,655 INFO L933 BasicCegarLoop]: 466 mSDtfsCounter, 409 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 876 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-11 00:36:41,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [409 Valid, 876 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:36:41,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2022-01-11 00:36:41,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 831. [2022-01-11 00:36:41,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 830 states have (on average 1.427710843373494) internal successors, (1185), 830 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:41,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1185 transitions. [2022-01-11 00:36:41,697 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1185 transitions. Word has length 147 [2022-01-11 00:36:41,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:36:41,698 INFO L470 AbstractCegarLoop]: Abstraction has 831 states and 1185 transitions. [2022-01-11 00:36:41,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:41,700 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1185 transitions. [2022-01-11 00:36:41,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-01-11 00:36:41,703 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:36:41,703 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] [2022-01-11 00:36:41,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 00:36:41,703 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:36:41,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:36:41,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1326654106, now seen corresponding path program 1 times [2022-01-11 00:36:41,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:36:41,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424881458] [2022-01-11 00:36:41,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:36:41,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:36:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:36:41,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:36:41,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:36:41,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424881458] [2022-01-11 00:36:41,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424881458] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:36:41,844 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:36:41,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:36:41,844 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232101890] [2022-01-11 00:36:41,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:36:41,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:36:41,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:36:41,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:36:41,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:36:41,845 INFO L87 Difference]: Start difference. First operand 831 states and 1185 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:41,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:36:41,922 INFO L93 Difference]: Finished difference Result 2108 states and 3038 transitions. [2022-01-11 00:36:41,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:36:41,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2022-01-11 00:36:41,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:36:41,927 INFO L225 Difference]: With dead ends: 2108 [2022-01-11 00:36:41,927 INFO L226 Difference]: Without dead ends: 1535 [2022-01-11 00:36:41,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:36:41,930 INFO L933 BasicCegarLoop]: 782 mSDtfsCounter, 349 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1165 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-11 00:36:41,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [349 Valid, 1165 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:36:41,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2022-01-11 00:36:41,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1533. [2022-01-11 00:36:41,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1532 states have (on average 1.4177545691906006) internal successors, (2172), 1532 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:41,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2172 transitions. [2022-01-11 00:36:41,996 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 2172 transitions. Word has length 148 [2022-01-11 00:36:41,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:36:41,997 INFO L470 AbstractCegarLoop]: Abstraction has 1533 states and 2172 transitions. [2022-01-11 00:36:41,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:41,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2172 transitions. [2022-01-11 00:36:41,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-01-11 00:36:41,999 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:36:41,999 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] [2022-01-11 00:36:42,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 00:36:42,000 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:36:42,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:36:42,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1091044295, now seen corresponding path program 1 times [2022-01-11 00:36:42,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:36:42,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838167887] [2022-01-11 00:36:42,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:36:42,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:36:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:36:42,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:36:42,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:36:42,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838167887] [2022-01-11 00:36:42,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838167887] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:36:42,093 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:36:42,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:36:42,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471959170] [2022-01-11 00:36:42,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:36:42,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:36:42,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:36:42,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:36:42,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:36:42,094 INFO L87 Difference]: Start difference. First operand 1533 states and 2172 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:42,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:36:42,243 INFO L93 Difference]: Finished difference Result 3796 states and 5372 transitions. [2022-01-11 00:36:42,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:36:42,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2022-01-11 00:36:42,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:36:42,249 INFO L225 Difference]: With dead ends: 3796 [2022-01-11 00:36:42,249 INFO L226 Difference]: Without dead ends: 2347 [2022-01-11 00:36:42,250 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-11 00:36:42,251 INFO L933 BasicCegarLoop]: 500 mSDtfsCounter, 1129 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 899 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-11 00:36:42,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1129 Valid, 899 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:36:42,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2347 states. [2022-01-11 00:36:42,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2347 to 1538. [2022-01-11 00:36:42,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1538 states, 1537 states have (on average 1.4144437215354586) internal successors, (2174), 1537 states have internal predecessors, (2174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:42,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 2174 transitions. [2022-01-11 00:36:42,322 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 2174 transitions. Word has length 148 [2022-01-11 00:36:42,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:36:42,322 INFO L470 AbstractCegarLoop]: Abstraction has 1538 states and 2174 transitions. [2022-01-11 00:36:42,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:42,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 2174 transitions. [2022-01-11 00:36:42,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-01-11 00:36:42,324 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:36:42,324 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] [2022-01-11 00:36:42,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 00:36:42,324 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:36:42,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:36:42,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1498149510, now seen corresponding path program 1 times [2022-01-11 00:36:42,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:36:42,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543920915] [2022-01-11 00:36:42,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:36:42,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:36:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:36:42,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:36:42,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:36:42,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543920915] [2022-01-11 00:36:42,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543920915] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:36:42,432 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:36:42,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:36:42,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857908043] [2022-01-11 00:36:42,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:36:42,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:36:42,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:36:42,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:36:42,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:36:42,433 INFO L87 Difference]: Start difference. First operand 1538 states and 2174 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:42,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:36:42,625 INFO L93 Difference]: Finished difference Result 4378 states and 6175 transitions. [2022-01-11 00:36:42,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:36:42,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2022-01-11 00:36:42,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:36:42,634 INFO L225 Difference]: With dead ends: 4378 [2022-01-11 00:36:42,634 INFO L226 Difference]: Without dead ends: 2908 [2022-01-11 00:36:42,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:36:42,637 INFO L933 BasicCegarLoop]: 701 mSDtfsCounter, 831 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 1078 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-11 00:36:42,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [831 Valid, 1078 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:36:42,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2022-01-11 00:36:42,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2906. [2022-01-11 00:36:42,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2906 states, 2905 states have (on average 1.3993115318416522) internal successors, (4065), 2905 states have internal predecessors, (4065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:42,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2906 states to 2906 states and 4065 transitions. [2022-01-11 00:36:42,787 INFO L78 Accepts]: Start accepts. Automaton has 2906 states and 4065 transitions. Word has length 148 [2022-01-11 00:36:42,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:36:42,787 INFO L470 AbstractCegarLoop]: Abstraction has 2906 states and 4065 transitions. [2022-01-11 00:36:42,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:42,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2906 states and 4065 transitions. [2022-01-11 00:36:42,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:36:42,791 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:36:42,791 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:36:42,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 00:36:42,791 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:36:42,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:36:42,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1609570680, now seen corresponding path program 1 times [2022-01-11 00:36:42,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:36:42,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77099829] [2022-01-11 00:36:42,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:36:42,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:36:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:36:42,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:36:42,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:36:42,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77099829] [2022-01-11 00:36:42,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77099829] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:36:42,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:36:42,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:36:42,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824017767] [2022-01-11 00:36:42,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:36:42,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:36:42,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:36:42,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:36:42,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:36:42,911 INFO L87 Difference]: Start difference. First operand 2906 states and 4065 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-11 00:36:43,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:36:43,063 INFO L93 Difference]: Finished difference Result 4177 states and 5874 transitions. [2022-01-11 00:36:43,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:36:43,064 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-11 00:36:43,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:36:43,071 INFO L225 Difference]: With dead ends: 4177 [2022-01-11 00:36:43,071 INFO L226 Difference]: Without dead ends: 2419 [2022-01-11 00:36:43,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:36:43,075 INFO L933 BasicCegarLoop]: 456 mSDtfsCounter, 47 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1294 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-11 00:36:43,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 1294 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:36:43,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2022-01-11 00:36:43,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 2419. [2022-01-11 00:36:43,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2419 states, 2418 states have (on average 1.3999172870140613) internal successors, (3385), 2418 states have internal predecessors, (3385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:43,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2419 states to 2419 states and 3385 transitions. [2022-01-11 00:36:43,207 INFO L78 Accepts]: Start accepts. Automaton has 2419 states and 3385 transitions. Word has length 150 [2022-01-11 00:36:43,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:36:43,207 INFO L470 AbstractCegarLoop]: Abstraction has 2419 states and 3385 transitions. [2022-01-11 00:36:43,207 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-11 00:36:43,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2419 states and 3385 transitions. [2022-01-11 00:36:43,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:36:43,210 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:36:43,211 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:36:43,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 00:36:43,211 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:36:43,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:36:43,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1715460575, now seen corresponding path program 1 times [2022-01-11 00:36:43,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:36:43,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813455475] [2022-01-11 00:36:43,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:36:43,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:36:43,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:36:43,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:36:43,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:36:43,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813455475] [2022-01-11 00:36:43,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813455475] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:36:43,383 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:36:43,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:36:43,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196869367] [2022-01-11 00:36:43,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:36:43,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:36:43,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:36:43,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:36:43,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:36:43,384 INFO L87 Difference]: Start difference. First operand 2419 states and 3385 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:43,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:36:43,640 INFO L93 Difference]: Finished difference Result 6363 states and 8872 transitions. [2022-01-11 00:36:43,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 00:36:43,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2022-01-11 00:36:43,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:36:43,651 INFO L225 Difference]: With dead ends: 6363 [2022-01-11 00:36:43,652 INFO L226 Difference]: Without dead ends: 3988 [2022-01-11 00:36:43,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-11 00:36:43,655 INFO L933 BasicCegarLoop]: 942 mSDtfsCounter, 1349 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 1704 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-11 00:36:43,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1349 Valid, 1704 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:36:43,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3988 states. [2022-01-11 00:36:43,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3988 to 2571. [2022-01-11 00:36:43,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2571 states, 2570 states have (on average 1.3856031128404669) internal successors, (3561), 2570 states have internal predecessors, (3561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:43,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 3561 transitions. [2022-01-11 00:36:43,858 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 3561 transitions. Word has length 150 [2022-01-11 00:36:43,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:36:43,859 INFO L470 AbstractCegarLoop]: Abstraction has 2571 states and 3561 transitions. [2022-01-11 00:36:43,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:43,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3561 transitions. [2022-01-11 00:36:43,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-11 00:36:43,863 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:36:43,863 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:36:43,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 00:36:43,863 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:36:43,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:36:43,864 INFO L85 PathProgramCache]: Analyzing trace with hash -2065947771, now seen corresponding path program 1 times [2022-01-11 00:36:43,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:36:43,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31450108] [2022-01-11 00:36:43,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:36:43,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:36:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:36:43,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-11 00:36:43,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:36:43,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31450108] [2022-01-11 00:36:43,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31450108] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:36:43,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:36:43,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:36:43,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252566388] [2022-01-11 00:36:43,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:36:43,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:36:43,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:36:43,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:36:43,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:36:43,956 INFO L87 Difference]: Start difference. First operand 2571 states and 3561 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-11 00:36:44,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:36:44,086 INFO L93 Difference]: Finished difference Result 4624 states and 6393 transitions. [2022-01-11 00:36:44,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:36:44,086 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-11 00:36:44,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:36:44,092 INFO L225 Difference]: With dead ends: 4624 [2022-01-11 00:36:44,093 INFO L226 Difference]: Without dead ends: 2089 [2022-01-11 00:36:44,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:36:44,096 INFO L933 BasicCegarLoop]: 454 mSDtfsCounter, 47 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1289 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-11 00:36:44,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 1289 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:36:44,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2022-01-11 00:36:44,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 2089. [2022-01-11 00:36:44,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2088 states have (on average 1.3797892720306513) internal successors, (2881), 2088 states have internal predecessors, (2881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:44,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2881 transitions. [2022-01-11 00:36:44,234 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2881 transitions. Word has length 150 [2022-01-11 00:36:44,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:36:44,234 INFO L470 AbstractCegarLoop]: Abstraction has 2089 states and 2881 transitions. [2022-01-11 00:36:44,234 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-11 00:36:44,234 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2881 transitions. [2022-01-11 00:36:44,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-01-11 00:36:44,237 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:36:44,237 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] [2022-01-11 00:36:44,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 00:36:44,237 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:36:44,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:36:44,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1523182793, now seen corresponding path program 1 times [2022-01-11 00:36:44,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:36:44,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134562434] [2022-01-11 00:36:44,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:36:44,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:36:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:36:44,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:36:44,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:36:44,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134562434] [2022-01-11 00:36:44,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134562434] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:36:44,302 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:36:44,302 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:36:44,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859576776] [2022-01-11 00:36:44,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:36:44,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:36:44,303 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:36:44,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:36:44,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:36:44,303 INFO L87 Difference]: Start difference. First operand 2089 states and 2881 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:44,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:36:44,436 INFO L93 Difference]: Finished difference Result 4071 states and 5626 transitions. [2022-01-11 00:36:44,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:36:44,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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 157 [2022-01-11 00:36:44,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:36:44,444 INFO L225 Difference]: With dead ends: 4071 [2022-01-11 00:36:44,445 INFO L226 Difference]: Without dead ends: 2873 [2022-01-11 00:36:44,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:36:44,447 INFO L933 BasicCegarLoop]: 731 mSDtfsCounter, 394 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1137 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-11 00:36:44,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [394 Valid, 1137 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:36:44,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2022-01-11 00:36:44,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 2089. [2022-01-11 00:36:44,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2088 states have (on average 1.378352490421456) internal successors, (2878), 2088 states have internal predecessors, (2878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:44,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2878 transitions. [2022-01-11 00:36:44,630 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2878 transitions. Word has length 157 [2022-01-11 00:36:44,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:36:44,630 INFO L470 AbstractCegarLoop]: Abstraction has 2089 states and 2878 transitions. [2022-01-11 00:36:44,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:44,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2878 transitions. [2022-01-11 00:36:44,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-11 00:36:44,635 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:36:44,635 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] [2022-01-11 00:36:44,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 00:36:44,635 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:36:44,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:36:44,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1760583979, now seen corresponding path program 1 times [2022-01-11 00:36:44,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:36:44,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570463443] [2022-01-11 00:36:44,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:36:44,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:36:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:36:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:36:44,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:36:44,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570463443] [2022-01-11 00:36:44,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570463443] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:36:44,771 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:36:44,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:36:44,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466037839] [2022-01-11 00:36:44,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:36:44,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:36:44,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:36:44,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:36:44,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:36:44,773 INFO L87 Difference]: Start difference. First operand 2089 states and 2878 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:44,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:36:44,934 INFO L93 Difference]: Finished difference Result 4653 states and 6508 transitions. [2022-01-11 00:36:44,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:36:44,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2022-01-11 00:36:44,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:36:44,954 INFO L225 Difference]: With dead ends: 4653 [2022-01-11 00:36:44,954 INFO L226 Difference]: Without dead ends: 3179 [2022-01-11 00:36:44,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:36:44,958 INFO L933 BasicCegarLoop]: 763 mSDtfsCounter, 333 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1136 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-11 00:36:44,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 1136 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:36:44,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2022-01-11 00:36:45,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 3177. [2022-01-11 00:36:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3177 states, 3176 states have (on average 1.3649244332493702) internal successors, (4335), 3176 states have internal predecessors, (4335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:45,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3177 states to 3177 states and 4335 transitions. [2022-01-11 00:36:45,145 INFO L78 Accepts]: Start accepts. Automaton has 3177 states and 4335 transitions. Word has length 158 [2022-01-11 00:36:45,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:36:45,145 INFO L470 AbstractCegarLoop]: Abstraction has 3177 states and 4335 transitions. [2022-01-11 00:36:45,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:45,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3177 states and 4335 transitions. [2022-01-11 00:36:45,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-11 00:36:45,149 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:36:45,149 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] [2022-01-11 00:36:45,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 00:36:45,149 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:36:45,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:36:45,150 INFO L85 PathProgramCache]: Analyzing trace with hash 155009665, now seen corresponding path program 1 times [2022-01-11 00:36:45,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:36:45,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481186798] [2022-01-11 00:36:45,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:36:45,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:36:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:36:45,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:36:45,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:36:45,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481186798] [2022-01-11 00:36:45,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481186798] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:36:45,260 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:36:45,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:36:45,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532899996] [2022-01-11 00:36:45,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:36:45,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:36:45,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:36:45,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:36:45,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:36:45,261 INFO L87 Difference]: Start difference. First operand 3177 states and 4335 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:45,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:36:45,528 INFO L93 Difference]: Finished difference Result 7098 states and 9794 transitions. [2022-01-11 00:36:45,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:36:45,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2022-01-11 00:36:45,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:36:45,537 INFO L225 Difference]: With dead ends: 7098 [2022-01-11 00:36:45,537 INFO L226 Difference]: Without dead ends: 4806 [2022-01-11 00:36:45,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:36:45,541 INFO L933 BasicCegarLoop]: 775 mSDtfsCounter, 336 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1149 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-11 00:36:45,541 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 1149 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:36:45,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4806 states. [2022-01-11 00:36:45,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4806 to 4804. [2022-01-11 00:36:45,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4804 states, 4803 states have (on average 1.3476993545700604) internal successors, (6473), 4803 states have internal predecessors, (6473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4804 states to 4804 states and 6473 transitions. [2022-01-11 00:36:45,791 INFO L78 Accepts]: Start accepts. Automaton has 4804 states and 6473 transitions. Word has length 158 [2022-01-11 00:36:45,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:36:45,792 INFO L470 AbstractCegarLoop]: Abstraction has 4804 states and 6473 transitions. [2022-01-11 00:36:45,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 4804 states and 6473 transitions. [2022-01-11 00:36:45,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-01-11 00:36:45,796 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:36:45,797 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] [2022-01-11 00:36:45,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 00:36:45,797 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:36:45,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:36:45,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1296574014, now seen corresponding path program 1 times [2022-01-11 00:36:45,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:36:45,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136426199] [2022-01-11 00:36:45,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:36:45,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:36:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:36:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:36:45,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:36:45,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136426199] [2022-01-11 00:36:45,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136426199] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:36:45,897 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:36:45,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:36:45,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213339476] [2022-01-11 00:36:45,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:36:45,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:36:45,898 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:36:45,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:36:45,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:36:45,898 INFO L87 Difference]: Start difference. First operand 4804 states and 6473 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:46,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:36:46,795 INFO L93 Difference]: Finished difference Result 11650 states and 16067 transitions. [2022-01-11 00:36:46,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:36:46,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2022-01-11 00:36:46,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:36:46,809 INFO L225 Difference]: With dead ends: 11650 [2022-01-11 00:36:46,809 INFO L226 Difference]: Without dead ends: 8923 [2022-01-11 00:36:46,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:36:46,813 INFO L933 BasicCegarLoop]: 612 mSDtfsCounter, 324 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 00:36:46,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 924 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-11 00:36:46,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8923 states. [2022-01-11 00:36:47,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8923 to 8921. [2022-01-11 00:36:47,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8921 states, 8920 states have (on average 1.355829596412556) internal successors, (12094), 8920 states have internal predecessors, (12094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8921 states to 8921 states and 12094 transitions. [2022-01-11 00:36:47,429 INFO L78 Accepts]: Start accepts. Automaton has 8921 states and 12094 transitions. Word has length 161 [2022-01-11 00:36:47,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:36:47,429 INFO L470 AbstractCegarLoop]: Abstraction has 8921 states and 12094 transitions. [2022-01-11 00:36:47,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:47,429 INFO L276 IsEmpty]: Start isEmpty. Operand 8921 states and 12094 transitions. [2022-01-11 00:36:47,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-01-11 00:36:47,437 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:36:47,437 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] [2022-01-11 00:36:47,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 00:36:47,437 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:36:47,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:36:47,437 INFO L85 PathProgramCache]: Analyzing trace with hash 505935617, now seen corresponding path program 1 times [2022-01-11 00:36:47,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:36:47,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219928065] [2022-01-11 00:36:47,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:36:47,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:36:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:36:47,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:36:47,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:36:47,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219928065] [2022-01-11 00:36:47,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219928065] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:36:47,543 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:36:47,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:36:47,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190307707] [2022-01-11 00:36:47,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:36:47,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:36:47,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:36:47,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:36:47,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:36:47,544 INFO L87 Difference]: Start difference. First operand 8921 states and 12094 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:48,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:36:48,126 INFO L93 Difference]: Finished difference Result 17940 states and 24323 transitions. [2022-01-11 00:36:48,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:36:48,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2022-01-11 00:36:48,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:36:48,140 INFO L225 Difference]: With dead ends: 17940 [2022-01-11 00:36:48,140 INFO L226 Difference]: Without dead ends: 9172 [2022-01-11 00:36:48,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:36:48,148 INFO L933 BasicCegarLoop]: 669 mSDtfsCounter, 815 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 1036 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-11 00:36:48,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [815 Valid, 1036 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:36:48,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9172 states. [2022-01-11 00:36:48,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9172 to 9066. [2022-01-11 00:36:48,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9066 states, 9065 states have (on average 1.3517926089354662) internal successors, (12254), 9065 states have internal predecessors, (12254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:48,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9066 states to 9066 states and 12254 transitions. [2022-01-11 00:36:48,708 INFO L78 Accepts]: Start accepts. Automaton has 9066 states and 12254 transitions. Word has length 161 [2022-01-11 00:36:48,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:36:48,708 INFO L470 AbstractCegarLoop]: Abstraction has 9066 states and 12254 transitions. [2022-01-11 00:36:48,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:48,708 INFO L276 IsEmpty]: Start isEmpty. Operand 9066 states and 12254 transitions. [2022-01-11 00:36:48,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-11 00:36:48,716 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:36:48,716 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] [2022-01-11 00:36:48,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 00:36:48,716 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:36:48,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:36:48,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1537464639, now seen corresponding path program 1 times [2022-01-11 00:36:48,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:36:48,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485424347] [2022-01-11 00:36:48,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:36:48,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:36:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:36:48,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:36:48,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:36:48,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485424347] [2022-01-11 00:36:48,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485424347] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:36:48,774 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:36:48,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 00:36:48,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155338928] [2022-01-11 00:36:48,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:36:48,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 00:36:48,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:36:48,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 00:36:48,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:36:48,775 INFO L87 Difference]: Start difference. First operand 9066 states and 12254 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:50,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:36:50,006 INFO L93 Difference]: Finished difference Result 24252 states and 32922 transitions. [2022-01-11 00:36:50,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 00:36:50,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2022-01-11 00:36:50,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:36:50,035 INFO L225 Difference]: With dead ends: 24252 [2022-01-11 00:36:50,035 INFO L226 Difference]: Without dead ends: 17929 [2022-01-11 00:36:50,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 00:36:50,046 INFO L933 BasicCegarLoop]: 802 mSDtfsCounter, 387 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1211 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-11 00:36:50,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [387 Valid, 1211 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:36:50,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17929 states. [2022-01-11 00:36:50,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17929 to 9076. [2022-01-11 00:36:50,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9076 states, 9075 states have (on average 1.351404958677686) internal successors, (12264), 9075 states have internal predecessors, (12264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:50,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9076 states to 9076 states and 12264 transitions. [2022-01-11 00:36:50,669 INFO L78 Accepts]: Start accepts. Automaton has 9076 states and 12264 transitions. Word has length 162 [2022-01-11 00:36:50,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:36:50,669 INFO L470 AbstractCegarLoop]: Abstraction has 9076 states and 12264 transitions. [2022-01-11 00:36:50,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:50,669 INFO L276 IsEmpty]: Start isEmpty. Operand 9076 states and 12264 transitions. [2022-01-11 00:36:50,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-01-11 00:36:50,680 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:36:50,680 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 00:36:50,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 00:36:50,680 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:36:50,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:36:50,680 INFO L85 PathProgramCache]: Analyzing trace with hash 657086982, now seen corresponding path program 1 times [2022-01-11 00:36:50,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:36:50,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387336381] [2022-01-11 00:36:50,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:36:50,681 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:36:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:36:50,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:36:50,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:36:50,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387336381] [2022-01-11 00:36:50,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387336381] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:36:50,802 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:36:50,802 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 00:36:50,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757395832] [2022-01-11 00:36:50,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:36:50,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:36:50,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:36:50,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:36:50,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:36:50,803 INFO L87 Difference]: Start difference. First operand 9076 states and 12264 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 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-11 00:36:51,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:36:51,857 INFO L93 Difference]: Finished difference Result 23354 states and 31565 transitions. [2022-01-11 00:36:51,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 00:36:51,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 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-11 00:36:51,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:36:51,878 INFO L225 Difference]: With dead ends: 23354 [2022-01-11 00:36:51,879 INFO L226 Difference]: Without dead ends: 15180 [2022-01-11 00:36:51,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-11 00:36:51,887 INFO L933 BasicCegarLoop]: 941 mSDtfsCounter, 1198 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 1699 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-11 00:36:51,887 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1198 Valid, 1699 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:36:51,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15180 states. [2022-01-11 00:36:52,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15180 to 9381. [2022-01-11 00:36:52,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9381 states, 9380 states have (on average 1.344136460554371) internal successors, (12608), 9380 states have internal predecessors, (12608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:52,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9381 states to 9381 states and 12608 transitions. [2022-01-11 00:36:52,575 INFO L78 Accepts]: Start accepts. Automaton has 9381 states and 12608 transitions. Word has length 163 [2022-01-11 00:36:52,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:36:52,575 INFO L470 AbstractCegarLoop]: Abstraction has 9381 states and 12608 transitions. [2022-01-11 00:36:52,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 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-11 00:36:52,576 INFO L276 IsEmpty]: Start isEmpty. Operand 9381 states and 12608 transitions. [2022-01-11 00:36:52,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-01-11 00:36:52,588 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:36:52,588 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-11 00:36:52,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 00:36:52,588 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:36:52,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:36:52,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1947521758, now seen corresponding path program 1 times [2022-01-11 00:36:52,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:36:52,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146731154] [2022-01-11 00:36:52,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:36:52,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:36:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:36:52,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:36:52,731 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:36:52,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146731154] [2022-01-11 00:36:52,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146731154] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:36:52,731 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:36:52,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:36:52,731 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635394309] [2022-01-11 00:36:52,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:36:52,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 00:36:52,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:36:52,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 00:36:52,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 00:36:52,733 INFO L87 Difference]: Start difference. First operand 9381 states and 12608 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-11 00:36:53,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:36:53,335 INFO L93 Difference]: Finished difference Result 14996 states and 20192 transitions. [2022-01-11 00:36:53,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 00:36:53,336 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-11 00:36:53,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:36:53,346 INFO L225 Difference]: With dead ends: 14996 [2022-01-11 00:36:53,346 INFO L226 Difference]: Without dead ends: 8126 [2022-01-11 00:36:53,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:36:53,354 INFO L933 BasicCegarLoop]: 436 mSDtfsCounter, 23 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1262 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-11 00:36:53,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 1262 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 00:36:53,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8126 states. [2022-01-11 00:36:53,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8126 to 8126. [2022-01-11 00:36:53,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8126 states, 8125 states have (on average 1.3421538461538463) internal successors, (10905), 8125 states have internal predecessors, (10905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:53,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8126 states to 8126 states and 10905 transitions. [2022-01-11 00:36:53,944 INFO L78 Accepts]: Start accepts. Automaton has 8126 states and 10905 transitions. Word has length 163 [2022-01-11 00:36:53,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:36:53,944 INFO L470 AbstractCegarLoop]: Abstraction has 8126 states and 10905 transitions. [2022-01-11 00:36:53,944 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-11 00:36:53,944 INFO L276 IsEmpty]: Start isEmpty. Operand 8126 states and 10905 transitions. [2022-01-11 00:36:53,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-01-11 00:36:53,951 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:36:53,951 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] [2022-01-11 00:36:53,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 00:36:53,952 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:36:53,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:36:53,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1575456976, now seen corresponding path program 1 times [2022-01-11 00:36:53,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:36:53,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6020396] [2022-01-11 00:36:53,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:36:53,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:36:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:36:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:36:54,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:36:54,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6020396] [2022-01-11 00:36:54,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6020396] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:36:54,492 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:36:54,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 00:36:54,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632310871] [2022-01-11 00:36:54,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:36:54,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 00:36:54,492 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:36:54,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 00:36:54,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 00:36:54,493 INFO L87 Difference]: Start difference. First operand 8126 states and 10905 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:55,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 00:36:55,925 INFO L93 Difference]: Finished difference Result 16268 states and 22831 transitions. [2022-01-11 00:36:55,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 00:36:55,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2022-01-11 00:36:55,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 00:36:55,940 INFO L225 Difference]: With dead ends: 16268 [2022-01-11 00:36:55,940 INFO L226 Difference]: Without dead ends: 9607 [2022-01-11 00:36:55,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 00:36:55,949 INFO L933 BasicCegarLoop]: 389 mSDtfsCounter, 1420 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1420 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 00:36:55,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1420 Valid, 673 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-11 00:36:55,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9607 states. [2022-01-11 00:36:56,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9607 to 9605. [2022-01-11 00:36:56,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9605 states, 9604 states have (on average 1.4107663473552687) internal successors, (13549), 9604 states have internal predecessors, (13549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:56,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9605 states to 9605 states and 13549 transitions. [2022-01-11 00:36:56,968 INFO L78 Accepts]: Start accepts. Automaton has 9605 states and 13549 transitions. Word has length 168 [2022-01-11 00:36:56,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 00:36:56,968 INFO L470 AbstractCegarLoop]: Abstraction has 9605 states and 13549 transitions. [2022-01-11 00:36:56,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 00:36:56,968 INFO L276 IsEmpty]: Start isEmpty. Operand 9605 states and 13549 transitions. [2022-01-11 00:36:56,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-01-11 00:36:56,974 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 00:36:56,974 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] [2022-01-11 00:36:56,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 00:36:56,975 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 00:36:56,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 00:36:56,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1190583985, now seen corresponding path program 1 times [2022-01-11 00:36:56,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 00:36:56,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875634723] [2022-01-11 00:36:56,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 00:36:56,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 00:36:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 00:37:07,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 00:37:07,159 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 00:37:07,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875634723] [2022-01-11 00:37:07,159 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875634723] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 00:37:07,159 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 00:37:07,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-11 00:37:07,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772786591] [2022-01-11 00:37:07,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 00:37:07,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-11 00:37:07,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 00:37:07,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-11 00:37:07,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=208, Unknown=2, NotChecked=0, Total=240 [2022-01-11 00:37:07,160 INFO L87 Difference]: Start difference. First operand 9605 states and 13549 transitions. Second operand has 16 states, 16 states have (on average 10.5) internal successors, (168), 15 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)