/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_SUM.epf -i ../../../trunk/examples/svcomp/locks/test_locks_9.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 03:30:46,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 03:30:46,823 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 03:30:46,865 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 03:30:46,866 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 03:30:46,868 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 03:30:46,877 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 03:30:46,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 03:30:46,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 03:30:46,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 03:30:46,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 03:30:46,893 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 03:30:46,893 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 03:30:46,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 03:30:46,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 03:30:46,899 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 03:30:46,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 03:30:46,900 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 03:30:46,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 03:30:46,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 03:30:46,903 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 03:30:46,907 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 03:30:46,908 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 03:30:46,909 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 03:30:46,911 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 03:30:46,911 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 03:30:46,911 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 03:30:46,912 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 03:30:46,912 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 03:30:46,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 03:30:46,913 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 03:30:46,913 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 03:30:46,914 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 03:30:46,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 03:30:46,915 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 03:30:46,915 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 03:30:46,916 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 03:30:46,916 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 03:30:46,916 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 03:30:46,917 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 03:30:46,918 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 03:30:46,924 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 03:30:46,946 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 03:30:46,946 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 03:30:46,946 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 03:30:46,946 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 03:30:46,947 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 03:30:46,948 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 03:30:46,948 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 03:30:46,948 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 03:30:46,948 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 03:30:46,948 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 03:30:46,948 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 03:30:46,949 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 03:30:46,949 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 03:30:46,949 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 03:30:46,949 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 03:30:46,949 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 03:30:46,949 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 03:30:46,949 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 03:30:46,949 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 03:30:46,950 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 03:30:46,950 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 03:30:46,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:30:46,950 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 03:30:46,950 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 03:30:46,950 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 03:30:46,950 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 03:30:46,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 03:30:46,951 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 03:30:46,951 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 03:30:46,951 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 03:30:46,951 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 03:30:46,951 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 03:30:46,952 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 03:30:46,952 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM 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 03:30:47,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 03:30:47,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 03:30:47,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 03:30:47,211 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 03:30:47,212 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 03:30:47,213 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9.c [2022-01-11 03:30:47,275 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2bd9955e/36b7b4ba868a4060a8a5cfa74f2dae54/FLAGec28b1062 [2022-01-11 03:30:47,598 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 03:30:47,598 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c [2022-01-11 03:30:47,604 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2bd9955e/36b7b4ba868a4060a8a5cfa74f2dae54/FLAGec28b1062 [2022-01-11 03:30:48,011 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2bd9955e/36b7b4ba868a4060a8a5cfa74f2dae54 [2022-01-11 03:30:48,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 03:30:48,014 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 03:30:48,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 03:30:48,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 03:30:48,019 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 03:30:48,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:30:48" (1/1) ... [2022-01-11 03:30:48,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47b8fd98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:48, skipping insertion in model container [2022-01-11 03:30:48,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:30:48" (1/1) ... [2022-01-11 03:30:48,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 03:30:48,050 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 03:30:48,194 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c[3555,3568] [2022-01-11 03:30:48,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:30:48,215 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 03:30:48,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c[3555,3568] [2022-01-11 03:30:48,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:30:48,268 INFO L208 MainTranslator]: Completed translation [2022-01-11 03:30:48,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:48 WrapperNode [2022-01-11 03:30:48,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 03:30:48,270 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 03:30:48,270 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 03:30:48,270 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 03:30:48,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:48" (1/1) ... [2022-01-11 03:30:48,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:48" (1/1) ... [2022-01-11 03:30:48,307 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 117 [2022-01-11 03:30:48,308 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 03:30:48,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 03:30:48,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 03:30:48,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 03:30:48,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:48" (1/1) ... [2022-01-11 03:30:48,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:48" (1/1) ... [2022-01-11 03:30:48,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:48" (1/1) ... [2022-01-11 03:30:48,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:48" (1/1) ... [2022-01-11 03:30:48,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:48" (1/1) ... [2022-01-11 03:30:48,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:48" (1/1) ... [2022-01-11 03:30:48,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:48" (1/1) ... [2022-01-11 03:30:48,329 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 03:30:48,330 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 03:30:48,330 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 03:30:48,330 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 03:30:48,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:48" (1/1) ... [2022-01-11 03:30:48,353 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:30:48,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:48,378 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 03:30:48,380 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 03:30:48,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 03:30:48,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 03:30:48,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 03:30:48,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 03:30:48,456 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 03:30:48,458 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 03:30:48,582 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 03:30:48,587 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 03:30:48,587 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-11 03:30:48,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:30:48 BoogieIcfgContainer [2022-01-11 03:30:48,589 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 03:30:48,590 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 03:30:48,590 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 03:30:48,591 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 03:30:48,594 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:30:48" (1/1) ... [2022-01-11 03:30:48,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:30:48 BasicIcfg [2022-01-11 03:30:48,701 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 03:30:48,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 03:30:48,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 03:30:48,711 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 03:30:48,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 03:30:48" (1/4) ... [2022-01-11 03:30:48,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5535cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:30:48, skipping insertion in model container [2022-01-11 03:30:48,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:48" (2/4) ... [2022-01-11 03:30:48,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5535cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:30:48, skipping insertion in model container [2022-01-11 03:30:48,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:30:48" (3/4) ... [2022-01-11 03:30:48,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e5535cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:30:48, skipping insertion in model container [2022-01-11 03:30:48,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:30:48" (4/4) ... [2022-01-11 03:30:48,714 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_9.cTransformedIcfg [2022-01-11 03:30:48,719 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 03:30:48,719 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 03:30:48,755 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 03:30:48,761 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 03:30:48,761 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 03:30:48,773 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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 03:30:48,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-11 03:30:48,777 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:48,778 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:48,778 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:48,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:48,782 INFO L85 PathProgramCache]: Analyzing trace with hash 311032436, now seen corresponding path program 1 times [2022-01-11 03:30:48,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:48,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813817706] [2022-01-11 03:30:48,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:48,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:48,983 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 03:30:48,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:48,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813817706] [2022-01-11 03:30:48,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813817706] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:48,985 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:48,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:48,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795540888] [2022-01-11 03:30:48,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:48,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:48,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:49,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:49,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:49,024 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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 03:30:49,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:49,082 INFO L93 Difference]: Finished difference Result 77 states and 133 transitions. [2022-01-11 03:30:49,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:49,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-01-11 03:30:49,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:49,096 INFO L225 Difference]: With dead ends: 77 [2022-01-11 03:30:49,096 INFO L226 Difference]: Without dead ends: 63 [2022-01-11 03:30:49,099 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 03:30:49,104 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 47 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:49,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 127 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:49,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-11 03:30:49,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 43. [2022-01-11 03:30:49,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 03:30:49,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 78 transitions. [2022-01-11 03:30:49,145 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 78 transitions. Word has length 16 [2022-01-11 03:30:49,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:49,146 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 78 transitions. [2022-01-11 03:30:49,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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 03:30:49,146 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 78 transitions. [2022-01-11 03:30:49,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-11 03:30:49,148 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:49,148 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:49,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 03:30:49,148 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:49,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:49,152 INFO L85 PathProgramCache]: Analyzing trace with hash 440115155, now seen corresponding path program 1 times [2022-01-11 03:30:49,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:49,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695617676] [2022-01-11 03:30:49,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:49,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:49,250 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 03:30:49,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:49,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695617676] [2022-01-11 03:30:49,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695617676] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:49,252 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:49,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:49,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839832192] [2022-01-11 03:30:49,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:49,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:49,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:49,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:49,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:49,256 INFO L87 Difference]: Start difference. First operand 43 states and 78 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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 03:30:49,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:49,289 INFO L93 Difference]: Finished difference Result 104 states and 189 transitions. [2022-01-11 03:30:49,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:49,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-01-11 03:30:49,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:49,292 INFO L225 Difference]: With dead ends: 104 [2022-01-11 03:30:49,293 INFO L226 Difference]: Without dead ends: 63 [2022-01-11 03:30:49,294 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 03:30:49,295 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 43 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:49,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 129 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:49,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-11 03:30:49,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2022-01-11 03:30:49,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 60 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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 03:30:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 110 transitions. [2022-01-11 03:30:49,302 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 110 transitions. Word has length 16 [2022-01-11 03:30:49,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:49,302 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 110 transitions. [2022-01-11 03:30:49,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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 03:30:49,302 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 110 transitions. [2022-01-11 03:30:49,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-11 03:30:49,303 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:49,306 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:49,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 03:30:49,309 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:49,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:49,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1052102913, now seen corresponding path program 1 times [2022-01-11 03:30:49,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:49,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228645012] [2022-01-11 03:30:49,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:49,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:49,409 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 03:30:49,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:49,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228645012] [2022-01-11 03:30:49,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228645012] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:49,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:49,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:49,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599986699] [2022-01-11 03:30:49,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:49,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:49,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:49,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:49,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:49,412 INFO L87 Difference]: Start difference. First operand 61 states and 110 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 03:30:49,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:49,424 INFO L93 Difference]: Finished difference Result 96 states and 168 transitions. [2022-01-11 03:30:49,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:49,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-01-11 03:30:49,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:49,426 INFO L225 Difference]: With dead ends: 96 [2022-01-11 03:30:49,426 INFO L226 Difference]: Without dead ends: 66 [2022-01-11 03:30:49,428 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 03:30:49,431 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 45 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:49,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 144 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:49,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-11 03:30:49,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-01-11 03:30:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 63 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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 03:30:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 112 transitions. [2022-01-11 03:30:49,438 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 112 transitions. Word has length 17 [2022-01-11 03:30:49,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:49,438 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 112 transitions. [2022-01-11 03:30:49,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 03:30:49,439 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 112 transitions. [2022-01-11 03:30:49,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-11 03:30:49,439 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:49,440 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:49,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 03:30:49,440 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:49,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:49,441 INFO L85 PathProgramCache]: Analyzing trace with hash 758699906, now seen corresponding path program 1 times [2022-01-11 03:30:49,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:49,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785508442] [2022-01-11 03:30:49,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:49,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:49,512 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 03:30:49,512 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:49,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785508442] [2022-01-11 03:30:49,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785508442] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:49,513 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:49,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:49,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942205497] [2022-01-11 03:30:49,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:49,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:49,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:49,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:49,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:49,515 INFO L87 Difference]: Start difference. First operand 64 states and 112 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 03:30:49,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:49,532 INFO L93 Difference]: Finished difference Result 121 states and 213 transitions. [2022-01-11 03:30:49,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:49,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-01-11 03:30:49,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:49,534 INFO L225 Difference]: With dead ends: 121 [2022-01-11 03:30:49,534 INFO L226 Difference]: Without dead ends: 119 [2022-01-11 03:30:49,534 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 03:30:49,535 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 40 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:49,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 113 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:49,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-01-11 03:30:49,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 85. [2022-01-11 03:30:49,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 84 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:49,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 149 transitions. [2022-01-11 03:30:49,547 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 149 transitions. Word has length 17 [2022-01-11 03:30:49,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:49,548 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 149 transitions. [2022-01-11 03:30:49,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 03:30:49,548 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 149 transitions. [2022-01-11 03:30:49,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-11 03:30:49,549 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:49,549 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:49,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 03:30:49,549 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:49,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:49,550 INFO L85 PathProgramCache]: Analyzing trace with hash 887782625, now seen corresponding path program 1 times [2022-01-11 03:30:49,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:49,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209097106] [2022-01-11 03:30:49,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:49,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:49,598 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 03:30:49,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:49,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209097106] [2022-01-11 03:30:49,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209097106] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:49,599 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:49,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:49,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953588444] [2022-01-11 03:30:49,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:49,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:49,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:49,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:49,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:49,601 INFO L87 Difference]: Start difference. First operand 85 states and 149 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 03:30:49,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:49,625 INFO L93 Difference]: Finished difference Result 201 states and 355 transitions. [2022-01-11 03:30:49,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:49,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-01-11 03:30:49,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:49,627 INFO L225 Difference]: With dead ends: 201 [2022-01-11 03:30:49,627 INFO L226 Difference]: Without dead ends: 121 [2022-01-11 03:30:49,628 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 03:30:49,629 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:49,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 130 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:49,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-01-11 03:30:49,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2022-01-11 03:30:49,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.7542372881355932) internal successors, (207), 118 states have internal predecessors, (207), 0 states have call successors, (0), 0 states 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 03:30:49,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 207 transitions. [2022-01-11 03:30:49,638 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 207 transitions. Word has length 17 [2022-01-11 03:30:49,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:49,638 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 207 transitions. [2022-01-11 03:30:49,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states 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 03:30:49,638 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 207 transitions. [2022-01-11 03:30:49,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-11 03:30:49,643 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:49,643 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:49,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 03:30:49,644 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:49,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:49,644 INFO L85 PathProgramCache]: Analyzing trace with hash 2044892719, now seen corresponding path program 1 times [2022-01-11 03:30:49,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:49,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116391887] [2022-01-11 03:30:49,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:49,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:49,672 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 03:30:49,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:49,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116391887] [2022-01-11 03:30:49,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116391887] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:49,672 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:49,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:49,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044383589] [2022-01-11 03:30:49,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:49,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:49,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:49,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:49,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:49,674 INFO L87 Difference]: Start difference. First operand 119 states and 207 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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 03:30:49,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:49,684 INFO L93 Difference]: Finished difference Result 180 states and 310 transitions. [2022-01-11 03:30:49,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:49,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-01-11 03:30:49,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:49,685 INFO L225 Difference]: With dead ends: 180 [2022-01-11 03:30:49,685 INFO L226 Difference]: Without dead ends: 123 [2022-01-11 03:30:49,686 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 03:30:49,687 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 44 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:49,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:49,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-01-11 03:30:49,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2022-01-11 03:30:49,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.725) internal successors, (207), 120 states have internal predecessors, (207), 0 states have call successors, (0), 0 states 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 03:30:49,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 207 transitions. [2022-01-11 03:30:49,695 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 207 transitions. Word has length 18 [2022-01-11 03:30:49,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:49,695 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 207 transitions. [2022-01-11 03:30:49,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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 03:30:49,696 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 207 transitions. [2022-01-11 03:30:49,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-11 03:30:49,697 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:49,697 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:49,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 03:30:49,697 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:49,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:49,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1751489712, now seen corresponding path program 1 times [2022-01-11 03:30:49,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:49,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606625939] [2022-01-11 03:30:49,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:49,698 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:49,723 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 03:30:49,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:49,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606625939] [2022-01-11 03:30:49,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606625939] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:49,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:49,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:49,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418008691] [2022-01-11 03:30:49,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:49,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:49,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:49,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:49,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:49,725 INFO L87 Difference]: Start difference. First operand 121 states and 207 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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 03:30:49,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:49,735 INFO L93 Difference]: Finished difference Result 225 states and 389 transitions. [2022-01-11 03:30:49,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:49,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-01-11 03:30:49,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:49,737 INFO L225 Difference]: With dead ends: 225 [2022-01-11 03:30:49,737 INFO L226 Difference]: Without dead ends: 223 [2022-01-11 03:30:49,737 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 03:30:49,738 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 37 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:49,738 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 111 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:49,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-01-11 03:30:49,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 165. [2022-01-11 03:30:49,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.701219512195122) internal successors, (279), 164 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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 03:30:49,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 279 transitions. [2022-01-11 03:30:49,748 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 279 transitions. Word has length 18 [2022-01-11 03:30:49,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:49,748 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 279 transitions. [2022-01-11 03:30:49,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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 03:30:49,749 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 279 transitions. [2022-01-11 03:30:49,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-11 03:30:49,749 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:49,749 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:49,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 03:30:49,750 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:49,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:49,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1880572431, now seen corresponding path program 1 times [2022-01-11 03:30:49,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:49,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165710739] [2022-01-11 03:30:49,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:49,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:49,784 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 03:30:49,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:49,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165710739] [2022-01-11 03:30:49,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165710739] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:49,785 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:49,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:49,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102642562] [2022-01-11 03:30:49,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:49,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:49,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:49,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:49,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:49,787 INFO L87 Difference]: Start difference. First operand 165 states and 279 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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 03:30:49,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:49,803 INFO L93 Difference]: Finished difference Result 389 states and 661 transitions. [2022-01-11 03:30:49,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:49,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-01-11 03:30:49,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:49,805 INFO L225 Difference]: With dead ends: 389 [2022-01-11 03:30:49,805 INFO L226 Difference]: Without dead ends: 231 [2022-01-11 03:30:49,806 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 03:30:49,807 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 41 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:49,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 131 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:49,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-01-11 03:30:49,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2022-01-11 03:30:49,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.6798245614035088) internal successors, (383), 228 states have internal predecessors, (383), 0 states have call successors, (0), 0 states 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 03:30:49,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 383 transitions. [2022-01-11 03:30:49,825 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 383 transitions. Word has length 18 [2022-01-11 03:30:49,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:49,826 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 383 transitions. [2022-01-11 03:30:49,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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 03:30:49,826 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 383 transitions. [2022-01-11 03:30:49,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-11 03:30:49,827 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:49,827 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:49,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 03:30:49,827 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:49,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:49,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1538361539, now seen corresponding path program 1 times [2022-01-11 03:30:49,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:49,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820038783] [2022-01-11 03:30:49,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:49,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:49,874 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 03:30:49,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:49,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820038783] [2022-01-11 03:30:49,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820038783] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:49,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:49,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:49,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504300327] [2022-01-11 03:30:49,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:49,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:49,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:49,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:49,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:49,877 INFO L87 Difference]: Start difference. First operand 229 states and 383 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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 03:30:49,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:49,895 INFO L93 Difference]: Finished difference Result 345 states and 573 transitions. [2022-01-11 03:30:49,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:49,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-01-11 03:30:49,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:49,897 INFO L225 Difference]: With dead ends: 345 [2022-01-11 03:30:49,897 INFO L226 Difference]: Without dead ends: 235 [2022-01-11 03:30:49,898 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 03:30:49,900 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 43 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:49,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 136 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:49,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-01-11 03:30:49,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2022-01-11 03:30:49,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.6508620689655173) internal successors, (383), 232 states have internal predecessors, (383), 0 states have call successors, (0), 0 states 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 03:30:49,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 383 transitions. [2022-01-11 03:30:49,914 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 383 transitions. Word has length 19 [2022-01-11 03:30:49,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:49,914 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 383 transitions. [2022-01-11 03:30:49,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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 03:30:49,914 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 383 transitions. [2022-01-11 03:30:49,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-11 03:30:49,915 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:49,915 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:49,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 03:30:49,916 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:49,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:49,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1831764546, now seen corresponding path program 1 times [2022-01-11 03:30:49,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:49,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463817944] [2022-01-11 03:30:49,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:49,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:49,961 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 03:30:49,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:49,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463817944] [2022-01-11 03:30:49,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463817944] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:49,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:49,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:49,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23175640] [2022-01-11 03:30:49,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:49,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:49,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:49,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:49,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:49,965 INFO L87 Difference]: Start difference. First operand 233 states and 383 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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 03:30:49,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:49,983 INFO L93 Difference]: Finished difference Result 425 states and 709 transitions. [2022-01-11 03:30:49,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:49,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-01-11 03:30:49,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:49,987 INFO L225 Difference]: With dead ends: 425 [2022-01-11 03:30:49,987 INFO L226 Difference]: Without dead ends: 423 [2022-01-11 03:30:49,988 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 03:30:49,989 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 34 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:49,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 109 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:49,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-01-11 03:30:50,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 325. [2022-01-11 03:30:50,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 1.6141975308641976) internal successors, (523), 324 states have internal predecessors, (523), 0 states have call successors, (0), 0 states 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 03:30:50,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 523 transitions. [2022-01-11 03:30:50,014 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 523 transitions. Word has length 19 [2022-01-11 03:30:50,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:50,015 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 523 transitions. [2022-01-11 03:30:50,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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 03:30:50,015 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 523 transitions. [2022-01-11 03:30:50,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-11 03:30:50,021 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:50,021 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:50,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 03:30:50,021 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:50,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:50,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1702681827, now seen corresponding path program 1 times [2022-01-11 03:30:50,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:50,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033789504] [2022-01-11 03:30:50,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:50,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:50,067 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 03:30:50,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:50,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033789504] [2022-01-11 03:30:50,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033789504] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:50,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:50,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:50,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295765263] [2022-01-11 03:30:50,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:50,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:50,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:50,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:50,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:50,069 INFO L87 Difference]: Start difference. First operand 325 states and 523 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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 03:30:50,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:50,085 INFO L93 Difference]: Finished difference Result 761 states and 1229 transitions. [2022-01-11 03:30:50,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:50,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-01-11 03:30:50,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:50,088 INFO L225 Difference]: With dead ends: 761 [2022-01-11 03:30:50,088 INFO L226 Difference]: Without dead ends: 447 [2022-01-11 03:30:50,090 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 03:30:50,093 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 40 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:50,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 132 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:50,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-01-11 03:30:50,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 445. [2022-01-11 03:30:50,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 1.5923423423423424) internal successors, (707), 444 states have internal predecessors, (707), 0 states have call successors, (0), 0 states 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 03:30:50,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 707 transitions. [2022-01-11 03:30:50,111 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 707 transitions. Word has length 19 [2022-01-11 03:30:50,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:50,112 INFO L470 AbstractCegarLoop]: Abstraction has 445 states and 707 transitions. [2022-01-11 03:30:50,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states 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 03:30:50,112 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 707 transitions. [2022-01-11 03:30:50,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-11 03:30:50,113 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:50,113 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] [2022-01-11 03:30:50,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 03:30:50,113 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:50,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:50,114 INFO L85 PathProgramCache]: Analyzing trace with hash -950093717, now seen corresponding path program 1 times [2022-01-11 03:30:50,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:50,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589847809] [2022-01-11 03:30:50,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:50,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:50,141 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 03:30:50,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:50,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589847809] [2022-01-11 03:30:50,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589847809] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:50,142 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:50,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:50,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257137683] [2022-01-11 03:30:50,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:50,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:50,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:50,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:50,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:50,143 INFO L87 Difference]: Start difference. First operand 445 states and 707 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states 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 03:30:50,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:50,160 INFO L93 Difference]: Finished difference Result 669 states and 1057 transitions. [2022-01-11 03:30:50,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:50,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-01-11 03:30:50,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:50,164 INFO L225 Difference]: With dead ends: 669 [2022-01-11 03:30:50,164 INFO L226 Difference]: Without dead ends: 455 [2022-01-11 03:30:50,165 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 03:30:50,166 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 42 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:50,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 132 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:50,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-01-11 03:30:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 453. [2022-01-11 03:30:50,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.5641592920353982) internal successors, (707), 452 states have internal predecessors, (707), 0 states have call successors, (0), 0 states 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 03:30:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 707 transitions. [2022-01-11 03:30:50,179 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 707 transitions. Word has length 20 [2022-01-11 03:30:50,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:50,180 INFO L470 AbstractCegarLoop]: Abstraction has 453 states and 707 transitions. [2022-01-11 03:30:50,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states 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 03:30:50,180 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 707 transitions. [2022-01-11 03:30:50,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-11 03:30:50,182 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:50,182 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] [2022-01-11 03:30:50,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 03:30:50,183 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:50,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:50,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1243496724, now seen corresponding path program 1 times [2022-01-11 03:30:50,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:50,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611141700] [2022-01-11 03:30:50,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:50,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:50,228 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 03:30:50,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:50,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611141700] [2022-01-11 03:30:50,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611141700] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:50,229 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:50,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:50,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774976672] [2022-01-11 03:30:50,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:50,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:50,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:50,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:50,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:50,231 INFO L87 Difference]: Start difference. First operand 453 states and 707 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states 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 03:30:50,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:50,253 INFO L93 Difference]: Finished difference Result 809 states and 1285 transitions. [2022-01-11 03:30:50,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:50,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-01-11 03:30:50,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:50,256 INFO L225 Difference]: With dead ends: 809 [2022-01-11 03:30:50,256 INFO L226 Difference]: Without dead ends: 807 [2022-01-11 03:30:50,257 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 03:30:50,259 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 31 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:50,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 107 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:50,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2022-01-11 03:30:50,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 645. [2022-01-11 03:30:50,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.5201863354037266) internal successors, (979), 644 states have internal predecessors, (979), 0 states have call successors, (0), 0 states 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 03:30:50,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 979 transitions. [2022-01-11 03:30:50,281 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 979 transitions. Word has length 20 [2022-01-11 03:30:50,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:50,281 INFO L470 AbstractCegarLoop]: Abstraction has 645 states and 979 transitions. [2022-01-11 03:30:50,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states 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 03:30:50,281 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 979 transitions. [2022-01-11 03:30:50,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-11 03:30:50,283 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:50,283 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] [2022-01-11 03:30:50,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 03:30:50,284 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:50,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:50,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1114414005, now seen corresponding path program 1 times [2022-01-11 03:30:50,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:50,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668296803] [2022-01-11 03:30:50,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:50,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:50,329 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 03:30:50,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:50,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668296803] [2022-01-11 03:30:50,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668296803] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:50,330 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:50,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:50,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884202614] [2022-01-11 03:30:50,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:50,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:50,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:50,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:50,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:50,331 INFO L87 Difference]: Start difference. First operand 645 states and 979 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states 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 03:30:50,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:50,370 INFO L93 Difference]: Finished difference Result 1497 states and 2277 transitions. [2022-01-11 03:30:50,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:50,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-01-11 03:30:50,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:50,374 INFO L225 Difference]: With dead ends: 1497 [2022-01-11 03:30:50,374 INFO L226 Difference]: Without dead ends: 871 [2022-01-11 03:30:50,375 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 03:30:50,376 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 39 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:50,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 133 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:50,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-01-11 03:30:50,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 869. [2022-01-11 03:30:50,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.4965437788018434) internal successors, (1299), 868 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states 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 03:30:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1299 transitions. [2022-01-11 03:30:50,399 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1299 transitions. Word has length 20 [2022-01-11 03:30:50,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:50,399 INFO L470 AbstractCegarLoop]: Abstraction has 869 states and 1299 transitions. [2022-01-11 03:30:50,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states 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 03:30:50,400 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1299 transitions. [2022-01-11 03:30:50,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-11 03:30:50,401 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:50,402 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] [2022-01-11 03:30:50,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 03:30:50,402 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:50,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:50,402 INFO L85 PathProgramCache]: Analyzing trace with hash 106339705, now seen corresponding path program 1 times [2022-01-11 03:30:50,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:50,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967468251] [2022-01-11 03:30:50,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:50,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:50,438 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 03:30:50,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:50,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967468251] [2022-01-11 03:30:50,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967468251] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:50,438 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:50,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:50,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745883337] [2022-01-11 03:30:50,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:50,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:50,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:50,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:50,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:50,440 INFO L87 Difference]: Start difference. First operand 869 states and 1299 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 03:30:50,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:50,472 INFO L93 Difference]: Finished difference Result 1305 states and 1941 transitions. [2022-01-11 03:30:50,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:50,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-01-11 03:30:50,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:50,476 INFO L225 Difference]: With dead ends: 1305 [2022-01-11 03:30:50,476 INFO L226 Difference]: Without dead ends: 887 [2022-01-11 03:30:50,478 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:50,479 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 41 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:50,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:50,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2022-01-11 03:30:50,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2022-01-11 03:30:50,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 1.4694570135746607) internal successors, (1299), 884 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states 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 03:30:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1299 transitions. [2022-01-11 03:30:50,502 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1299 transitions. Word has length 21 [2022-01-11 03:30:50,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:50,502 INFO L470 AbstractCegarLoop]: Abstraction has 885 states and 1299 transitions. [2022-01-11 03:30:50,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 03:30:50,502 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1299 transitions. [2022-01-11 03:30:50,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-11 03:30:50,503 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:50,503 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] [2022-01-11 03:30:50,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 03:30:50,504 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:50,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:50,504 INFO L85 PathProgramCache]: Analyzing trace with hash -187063302, now seen corresponding path program 1 times [2022-01-11 03:30:50,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:50,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094757221] [2022-01-11 03:30:50,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:50,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:50,532 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 03:30:50,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:50,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094757221] [2022-01-11 03:30:50,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094757221] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:50,534 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:50,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:50,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006791917] [2022-01-11 03:30:50,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:50,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:50,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:50,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:50,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:50,536 INFO L87 Difference]: Start difference. First operand 885 states and 1299 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 03:30:50,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:50,564 INFO L93 Difference]: Finished difference Result 1545 states and 2309 transitions. [2022-01-11 03:30:50,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:50,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-01-11 03:30:50,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:50,570 INFO L225 Difference]: With dead ends: 1545 [2022-01-11 03:30:50,570 INFO L226 Difference]: Without dead ends: 1543 [2022-01-11 03:30:50,571 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 03:30:50,572 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 28 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:50,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 105 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:50,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2022-01-11 03:30:50,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1285. [2022-01-11 03:30:50,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1284 states have (on average 1.4228971962616823) internal successors, (1827), 1284 states have internal predecessors, (1827), 0 states have call successors, (0), 0 states 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 03:30:50,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1827 transitions. [2022-01-11 03:30:50,606 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1827 transitions. Word has length 21 [2022-01-11 03:30:50,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:50,607 INFO L470 AbstractCegarLoop]: Abstraction has 1285 states and 1827 transitions. [2022-01-11 03:30:50,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 03:30:50,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1827 transitions. [2022-01-11 03:30:50,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-11 03:30:50,609 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:50,609 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] [2022-01-11 03:30:50,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 03:30:50,610 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:50,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:50,610 INFO L85 PathProgramCache]: Analyzing trace with hash -57980583, now seen corresponding path program 1 times [2022-01-11 03:30:50,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:50,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596252770] [2022-01-11 03:30:50,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:50,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:50,632 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 03:30:50,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:50,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596252770] [2022-01-11 03:30:50,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596252770] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:50,633 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:50,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:50,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761349168] [2022-01-11 03:30:50,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:50,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:50,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:50,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:50,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:50,634 INFO L87 Difference]: Start difference. First operand 1285 states and 1827 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 03:30:50,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:50,669 INFO L93 Difference]: Finished difference Result 2953 states and 4197 transitions. [2022-01-11 03:30:50,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:50,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-01-11 03:30:50,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:50,675 INFO L225 Difference]: With dead ends: 2953 [2022-01-11 03:30:50,675 INFO L226 Difference]: Without dead ends: 1703 [2022-01-11 03:30:50,677 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 03:30:50,677 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 38 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:50,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 134 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:50,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2022-01-11 03:30:50,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1701. [2022-01-11 03:30:50,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1700 states have (on average 1.3947058823529412) internal successors, (2371), 1700 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states 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 03:30:50,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2371 transitions. [2022-01-11 03:30:50,732 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2371 transitions. Word has length 21 [2022-01-11 03:30:50,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:50,732 INFO L470 AbstractCegarLoop]: Abstraction has 1701 states and 2371 transitions. [2022-01-11 03:30:50,732 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states 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 03:30:50,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2371 transitions. [2022-01-11 03:30:50,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-11 03:30:50,734 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:50,734 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] [2022-01-11 03:30:50,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 03:30:50,734 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:50,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:50,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1503962457, now seen corresponding path program 1 times [2022-01-11 03:30:50,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:50,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900671049] [2022-01-11 03:30:50,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:50,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:50,757 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 03:30:50,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:50,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900671049] [2022-01-11 03:30:50,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900671049] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:50,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:50,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:50,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716421521] [2022-01-11 03:30:50,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:50,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:50,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:50,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:50,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:50,759 INFO L87 Difference]: Start difference. First operand 1701 states and 2371 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 03:30:50,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:50,791 INFO L93 Difference]: Finished difference Result 2553 states and 3541 transitions. [2022-01-11 03:30:50,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:50,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-01-11 03:30:50,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:50,798 INFO L225 Difference]: With dead ends: 2553 [2022-01-11 03:30:50,798 INFO L226 Difference]: Without dead ends: 1735 [2022-01-11 03:30:50,799 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 03:30:50,800 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 40 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:50,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 124 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:50,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-01-11 03:30:50,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1733. [2022-01-11 03:30:50,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1732 states have (on average 1.3689376443418013) internal successors, (2371), 1732 states have internal predecessors, (2371), 0 states have call successors, (0), 0 states 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 03:30:50,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2371 transitions. [2022-01-11 03:30:50,862 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2371 transitions. Word has length 22 [2022-01-11 03:30:50,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:50,862 INFO L470 AbstractCegarLoop]: Abstraction has 1733 states and 2371 transitions. [2022-01-11 03:30:50,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 03:30:50,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2371 transitions. [2022-01-11 03:30:50,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-11 03:30:50,865 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:50,865 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] [2022-01-11 03:30:50,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 03:30:50,865 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:50,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:50,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1797365464, now seen corresponding path program 1 times [2022-01-11 03:30:50,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:50,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682813970] [2022-01-11 03:30:50,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:50,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:50,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:50,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:50,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:50,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682813970] [2022-01-11 03:30:50,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682813970] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:50,893 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:50,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:50,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002650801] [2022-01-11 03:30:50,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:50,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:50,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:50,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:50,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:50,895 INFO L87 Difference]: Start difference. First operand 1733 states and 2371 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 03:30:50,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:50,946 INFO L93 Difference]: Finished difference Result 2953 states and 4101 transitions. [2022-01-11 03:30:50,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:50,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-01-11 03:30:50,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:50,956 INFO L225 Difference]: With dead ends: 2953 [2022-01-11 03:30:50,957 INFO L226 Difference]: Without dead ends: 2951 [2022-01-11 03:30:50,959 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 03:30:50,959 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 25 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:50,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 103 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:50,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2022-01-11 03:30:51,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2565. [2022-01-11 03:30:51,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2565 states, 2564 states have (on average 1.3241029641185647) internal successors, (3395), 2564 states have internal predecessors, (3395), 0 states have call successors, (0), 0 states 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 03:30:51,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3395 transitions. [2022-01-11 03:30:51,029 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3395 transitions. Word has length 22 [2022-01-11 03:30:51,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:51,029 INFO L470 AbstractCegarLoop]: Abstraction has 2565 states and 3395 transitions. [2022-01-11 03:30:51,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 03:30:51,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3395 transitions. [2022-01-11 03:30:51,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-11 03:30:51,033 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:51,033 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] [2022-01-11 03:30:51,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 03:30:51,034 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:51,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:51,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1668282745, now seen corresponding path program 1 times [2022-01-11 03:30:51,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:51,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521432196] [2022-01-11 03:30:51,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:51,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:51,061 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 03:30:51,061 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:51,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521432196] [2022-01-11 03:30:51,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521432196] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:51,061 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:51,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:51,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918548123] [2022-01-11 03:30:51,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:51,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:51,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:51,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:51,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:51,063 INFO L87 Difference]: Start difference. First operand 2565 states and 3395 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 03:30:51,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:51,126 INFO L93 Difference]: Finished difference Result 5833 states and 7685 transitions. [2022-01-11 03:30:51,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:51,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-01-11 03:30:51,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:51,138 INFO L225 Difference]: With dead ends: 5833 [2022-01-11 03:30:51,138 INFO L226 Difference]: Without dead ends: 3335 [2022-01-11 03:30:51,141 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 03:30:51,143 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 37 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:51,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:51,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2022-01-11 03:30:51,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 3333. [2022-01-11 03:30:51,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3333 states, 3332 states have (on average 1.2878151260504203) internal successors, (4291), 3332 states have internal predecessors, (4291), 0 states have call successors, (0), 0 states 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 03:30:51,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 4291 transitions. [2022-01-11 03:30:51,245 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 4291 transitions. Word has length 22 [2022-01-11 03:30:51,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:51,245 INFO L470 AbstractCegarLoop]: Abstraction has 3333 states and 4291 transitions. [2022-01-11 03:30:51,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states 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 03:30:51,245 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 4291 transitions. [2022-01-11 03:30:51,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-11 03:30:51,249 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:51,249 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] [2022-01-11 03:30:51,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 03:30:51,249 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:51,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:51,250 INFO L85 PathProgramCache]: Analyzing trace with hash 116278197, now seen corresponding path program 1 times [2022-01-11 03:30:51,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:51,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068526330] [2022-01-11 03:30:51,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:51,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:51,271 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 03:30:51,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:51,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068526330] [2022-01-11 03:30:51,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068526330] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:51,271 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:51,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:51,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739672028] [2022-01-11 03:30:51,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:51,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:51,273 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:51,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:51,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:51,273 INFO L87 Difference]: Start difference. First operand 3333 states and 4291 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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 03:30:51,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:51,349 INFO L93 Difference]: Finished difference Result 5001 states and 6405 transitions. [2022-01-11 03:30:51,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:51,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-01-11 03:30:51,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:51,360 INFO L225 Difference]: With dead ends: 5001 [2022-01-11 03:30:51,360 INFO L226 Difference]: Without dead ends: 3399 [2022-01-11 03:30:51,362 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 03:30:51,363 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 39 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:51,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 120 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:51,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2022-01-11 03:30:51,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3397. [2022-01-11 03:30:51,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3397 states, 3396 states have (on average 1.263545347467609) internal successors, (4291), 3396 states have internal predecessors, (4291), 0 states have call successors, (0), 0 states 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 03:30:51,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 3397 states and 4291 transitions. [2022-01-11 03:30:51,452 INFO L78 Accepts]: Start accepts. Automaton has 3397 states and 4291 transitions. Word has length 23 [2022-01-11 03:30:51,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:51,452 INFO L470 AbstractCegarLoop]: Abstraction has 3397 states and 4291 transitions. [2022-01-11 03:30:51,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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 03:30:51,453 INFO L276 IsEmpty]: Start isEmpty. Operand 3397 states and 4291 transitions. [2022-01-11 03:30:51,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-11 03:30:51,456 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:51,456 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] [2022-01-11 03:30:51,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 03:30:51,457 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:51,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:51,457 INFO L85 PathProgramCache]: Analyzing trace with hash -177124810, now seen corresponding path program 1 times [2022-01-11 03:30:51,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:51,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499444521] [2022-01-11 03:30:51,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:51,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:51,473 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 03:30:51,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:51,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499444521] [2022-01-11 03:30:51,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499444521] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:51,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:51,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:51,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070924425] [2022-01-11 03:30:51,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:51,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:51,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:51,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:51,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:51,475 INFO L87 Difference]: Start difference. First operand 3397 states and 4291 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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 03:30:51,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:51,550 INFO L93 Difference]: Finished difference Result 5641 states and 7173 transitions. [2022-01-11 03:30:51,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:51,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-01-11 03:30:51,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:51,568 INFO L225 Difference]: With dead ends: 5641 [2022-01-11 03:30:51,569 INFO L226 Difference]: Without dead ends: 5639 [2022-01-11 03:30:51,571 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 03:30:51,572 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 22 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:51,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 101 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:51,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2022-01-11 03:30:51,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5125. [2022-01-11 03:30:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5125 states, 5124 states have (on average 1.2246291959406714) internal successors, (6275), 5124 states have internal predecessors, (6275), 0 states have call successors, (0), 0 states 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 03:30:51,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5125 states to 5125 states and 6275 transitions. [2022-01-11 03:30:51,738 INFO L78 Accepts]: Start accepts. Automaton has 5125 states and 6275 transitions. Word has length 23 [2022-01-11 03:30:51,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:51,738 INFO L470 AbstractCegarLoop]: Abstraction has 5125 states and 6275 transitions. [2022-01-11 03:30:51,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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 03:30:51,738 INFO L276 IsEmpty]: Start isEmpty. Operand 5125 states and 6275 transitions. [2022-01-11 03:30:51,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-11 03:30:51,747 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:51,747 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] [2022-01-11 03:30:51,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 03:30:51,747 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:51,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:51,748 INFO L85 PathProgramCache]: Analyzing trace with hash -48042091, now seen corresponding path program 1 times [2022-01-11 03:30:51,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:51,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787706124] [2022-01-11 03:30:51,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:51,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:51,771 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:51,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787706124] [2022-01-11 03:30:51,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787706124] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:51,771 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:51,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:51,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724378920] [2022-01-11 03:30:51,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:51,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:51,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:51,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:51,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:51,773 INFO L87 Difference]: Start difference. First operand 5125 states and 6275 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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 03:30:51,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:51,903 INFO L93 Difference]: Finished difference Result 11529 states and 13957 transitions. [2022-01-11 03:30:51,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:51,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-01-11 03:30:51,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:51,933 INFO L225 Difference]: With dead ends: 11529 [2022-01-11 03:30:51,933 INFO L226 Difference]: Without dead ends: 6535 [2022-01-11 03:30:51,939 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 03:30:51,940 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 36 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:51,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:51,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6535 states. [2022-01-11 03:30:52,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6535 to 6533. [2022-01-11 03:30:52,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6533 states, 6532 states have (on average 1.1762094304960196) internal successors, (7683), 6532 states have internal predecessors, (7683), 0 states have call successors, (0), 0 states 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 03:30:52,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6533 states to 6533 states and 7683 transitions. [2022-01-11 03:30:52,122 INFO L78 Accepts]: Start accepts. Automaton has 6533 states and 7683 transitions. Word has length 23 [2022-01-11 03:30:52,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:52,122 INFO L470 AbstractCegarLoop]: Abstraction has 6533 states and 7683 transitions. [2022-01-11 03:30:52,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states 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 03:30:52,123 INFO L276 IsEmpty]: Start isEmpty. Operand 6533 states and 7683 transitions. [2022-01-11 03:30:52,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-11 03:30:52,130 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:52,130 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] [2022-01-11 03:30:52,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 03:30:52,130 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:52,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:52,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1195868957, now seen corresponding path program 1 times [2022-01-11 03:30:52,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:52,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611678808] [2022-01-11 03:30:52,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:52,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:52,147 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 03:30:52,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:52,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611678808] [2022-01-11 03:30:52,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611678808] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:52,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:52,150 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:52,150 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219943833] [2022-01-11 03:30:52,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:52,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:52,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:52,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:52,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:52,151 INFO L87 Difference]: Start difference. First operand 6533 states and 7683 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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 03:30:52,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:52,260 INFO L93 Difference]: Finished difference Result 9801 states and 11461 transitions. [2022-01-11 03:30:52,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:52,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-01-11 03:30:52,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:52,271 INFO L225 Difference]: With dead ends: 9801 [2022-01-11 03:30:52,271 INFO L226 Difference]: Without dead ends: 6663 [2022-01-11 03:30:52,275 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 03:30:52,276 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 38 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:52,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 116 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:52,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6663 states. [2022-01-11 03:30:52,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6663 to 6661. [2022-01-11 03:30:52,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6661 states, 6660 states have (on average 1.1536036036036037) internal successors, (7683), 6660 states have internal predecessors, (7683), 0 states have call successors, (0), 0 states 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 03:30:52,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 7683 transitions. [2022-01-11 03:30:52,427 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 7683 transitions. Word has length 24 [2022-01-11 03:30:52,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:52,427 INFO L470 AbstractCegarLoop]: Abstraction has 6661 states and 7683 transitions. [2022-01-11 03:30:52,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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 03:30:52,427 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 7683 transitions. [2022-01-11 03:30:52,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-11 03:30:52,434 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:52,434 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] [2022-01-11 03:30:52,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 03:30:52,434 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:52,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:52,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1489271964, now seen corresponding path program 1 times [2022-01-11 03:30:52,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:52,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215642225] [2022-01-11 03:30:52,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:52,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:52,450 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 03:30:52,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:52,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215642225] [2022-01-11 03:30:52,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215642225] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:52,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:52,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:52,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986085865] [2022-01-11 03:30:52,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:52,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:52,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:52,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:52,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:52,452 INFO L87 Difference]: Start difference. First operand 6661 states and 7683 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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 03:30:52,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:52,607 INFO L93 Difference]: Finished difference Result 10759 states and 12292 transitions. [2022-01-11 03:30:52,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:52,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-01-11 03:30:52,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:52,624 INFO L225 Difference]: With dead ends: 10759 [2022-01-11 03:30:52,625 INFO L226 Difference]: Without dead ends: 10757 [2022-01-11 03:30:52,626 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 03:30:52,627 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 18 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:52,631 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 98 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:52,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10757 states. [2022-01-11 03:30:52,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10757 to 10245. [2022-01-11 03:30:52,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10245 states, 10244 states have (on average 1.124853572823116) internal successors, (11523), 10244 states have internal predecessors, (11523), 0 states have call successors, (0), 0 states 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 03:30:52,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10245 states to 10245 states and 11523 transitions. [2022-01-11 03:30:52,823 INFO L78 Accepts]: Start accepts. Automaton has 10245 states and 11523 transitions. Word has length 24 [2022-01-11 03:30:52,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:52,823 INFO L470 AbstractCegarLoop]: Abstraction has 10245 states and 11523 transitions. [2022-01-11 03:30:52,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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 03:30:52,823 INFO L276 IsEmpty]: Start isEmpty. Operand 10245 states and 11523 transitions. [2022-01-11 03:30:52,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-11 03:30:52,836 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:52,836 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] [2022-01-11 03:30:52,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 03:30:52,837 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:52,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:52,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1360189245, now seen corresponding path program 1 times [2022-01-11 03:30:52,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:52,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888041461] [2022-01-11 03:30:52,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:52,838 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:52,854 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 03:30:52,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:52,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888041461] [2022-01-11 03:30:52,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888041461] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:52,855 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:52,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:52,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124767978] [2022-01-11 03:30:52,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:52,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:52,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:52,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:52,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:52,857 INFO L87 Difference]: Start difference. First operand 10245 states and 11523 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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 03:30:53,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:53,049 INFO L93 Difference]: Finished difference Result 22789 states and 25091 transitions. [2022-01-11 03:30:53,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:53,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-01-11 03:30:53,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:53,050 INFO L225 Difference]: With dead ends: 22789 [2022-01-11 03:30:53,050 INFO L226 Difference]: Without dead ends: 0 [2022-01-11 03:30:53,065 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 03:30:53,066 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 34 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:53,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:53,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-11 03:30:53,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-11 03:30:53,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states 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 03:30:53,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-11 03:30:53,067 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-01-11 03:30:53,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:53,067 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-11 03:30:53,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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 03:30:53,068 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-11 03:30:53,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-11 03:30:53,070 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-11 03:30:53,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-11 03:30:53,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-11 03:30:53,081 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-11 03:30:53,081 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-11 03:30:53,081 INFO L861 garLoopResultBuilder]: At program point L141-1(lines 38 146) the Hoare annotation is: true [2022-01-11 03:30:53,082 INFO L861 garLoopResultBuilder]: At program point L147(lines 7 151) the Hoare annotation is: true [2022-01-11 03:30:53,082 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2022-01-11 03:30:53,082 INFO L861 garLoopResultBuilder]: At program point L150(lines 6 151) the Hoare annotation is: true [2022-01-11 03:30:53,082 INFO L858 garLoopResultBuilder]: For program point L63(lines 63 65) no Hoare annotation was computed. [2022-01-11 03:30:53,082 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-11 03:30:53,082 INFO L858 garLoopResultBuilder]: For program point L63-2(lines 38 146) no Hoare annotation was computed. [2022-01-11 03:30:53,082 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-11 03:30:53,082 INFO L858 garLoopResultBuilder]: For program point L67-1(lines 38 146) no Hoare annotation was computed. [2022-01-11 03:30:53,082 INFO L858 garLoopResultBuilder]: For program point L71-1(lines 38 146) no Hoare annotation was computed. [2022-01-11 03:30:53,082 INFO L858 garLoopResultBuilder]: For program point L75-1(lines 38 146) no Hoare annotation was computed. [2022-01-11 03:30:53,082 INFO L858 garLoopResultBuilder]: For program point L79-1(lines 38 146) no Hoare annotation was computed. [2022-01-11 03:30:53,083 INFO L858 garLoopResultBuilder]: For program point L83-1(lines 38 146) no Hoare annotation was computed. [2022-01-11 03:30:53,083 INFO L858 garLoopResultBuilder]: For program point L87-1(lines 38 146) no Hoare annotation was computed. [2022-01-11 03:30:53,083 INFO L858 garLoopResultBuilder]: For program point L91-1(lines 38 146) no Hoare annotation was computed. [2022-01-11 03:30:53,083 INFO L858 garLoopResultBuilder]: For program point L95-1(lines 38 146) no Hoare annotation was computed. [2022-01-11 03:30:53,083 INFO L858 garLoopResultBuilder]: For program point L102(line 102) no Hoare annotation was computed. [2022-01-11 03:30:53,083 INFO L858 garLoopResultBuilder]: For program point L101-1(lines 38 146) no Hoare annotation was computed. [2022-01-11 03:30:53,083 INFO L854 garLoopResultBuilder]: At program point L142-1(lines 7 151) the Hoare annotation is: false [2022-01-11 03:30:53,083 INFO L858 garLoopResultBuilder]: For program point L107(line 107) no Hoare annotation was computed. [2022-01-11 03:30:53,083 INFO L858 garLoopResultBuilder]: For program point L106-1(lines 38 146) no Hoare annotation was computed. [2022-01-11 03:30:53,083 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2022-01-11 03:30:53,084 INFO L858 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2022-01-11 03:30:53,084 INFO L858 garLoopResultBuilder]: For program point L111-1(lines 38 146) no Hoare annotation was computed. [2022-01-11 03:30:53,084 INFO L858 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2022-01-11 03:30:53,084 INFO L858 garLoopResultBuilder]: For program point L116-1(lines 38 146) no Hoare annotation was computed. [2022-01-11 03:30:53,084 INFO L858 garLoopResultBuilder]: For program point L122(line 122) no Hoare annotation was computed. [2022-01-11 03:30:53,084 INFO L858 garLoopResultBuilder]: For program point L121-1(lines 38 146) no Hoare annotation was computed. [2022-01-11 03:30:53,084 INFO L858 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2022-01-11 03:30:53,084 INFO L858 garLoopResultBuilder]: For program point L126-1(lines 38 146) no Hoare annotation was computed. [2022-01-11 03:30:53,084 INFO L858 garLoopResultBuilder]: For program point L132(line 132) no Hoare annotation was computed. [2022-01-11 03:30:53,084 INFO L858 garLoopResultBuilder]: For program point L131-1(lines 38 146) no Hoare annotation was computed. [2022-01-11 03:30:53,084 INFO L858 garLoopResultBuilder]: For program point L137(line 137) no Hoare annotation was computed. [2022-01-11 03:30:53,085 INFO L858 garLoopResultBuilder]: For program point L136-1(lines 38 146) no Hoare annotation was computed. [2022-01-11 03:30:53,085 INFO L858 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2022-01-11 03:30:53,087 INFO L732 BasicCegarLoop]: Path program 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] [2022-01-11 03:30:53,088 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 03:30:53,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:30:53 BasicIcfg [2022-01-11 03:30:53,096 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 03:30:53,097 INFO L158 Benchmark]: Toolchain (without parser) took 5082.80ms. Allocated memory was 184.5MB in the beginning and 310.4MB in the end (delta: 125.8MB). Free memory was 127.9MB in the beginning and 161.3MB in the end (delta: -33.3MB). Peak memory consumption was 93.5MB. Max. memory is 8.0GB. [2022-01-11 03:30:53,097 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 03:30:53,097 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.80ms. Allocated memory was 184.5MB in the beginning and 257.9MB in the end (delta: 73.4MB). Free memory was 127.7MB in the beginning and 229.8MB in the end (delta: -102.1MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-01-11 03:30:53,097 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.10ms. Allocated memory is still 257.9MB. Free memory was 229.8MB in the beginning and 228.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-11 03:30:53,098 INFO L158 Benchmark]: Boogie Preprocessor took 20.44ms. Allocated memory is still 257.9MB. Free memory was 227.7MB in the beginning and 226.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-11 03:30:53,098 INFO L158 Benchmark]: RCFGBuilder took 259.28ms. Allocated memory is still 257.9MB. Free memory was 226.7MB in the beginning and 214.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-11 03:30:53,098 INFO L158 Benchmark]: IcfgTransformer took 111.58ms. Allocated memory is still 257.9MB. Free memory was 214.1MB in the beginning and 209.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-11 03:30:53,098 INFO L158 Benchmark]: TraceAbstraction took 4393.15ms. Allocated memory was 257.9MB in the beginning and 310.4MB in the end (delta: 52.4MB). Free memory was 209.4MB in the beginning and 161.3MB in the end (delta: 48.1MB). Peak memory consumption was 101.6MB. Max. memory is 8.0GB. [2022-01-11 03:30:53,099 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 143.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 253.80ms. Allocated memory was 184.5MB in the beginning and 257.9MB in the end (delta: 73.4MB). Free memory was 127.7MB in the beginning and 229.8MB in the end (delta: -102.1MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.10ms. Allocated memory is still 257.9MB. Free memory was 229.8MB in the beginning and 228.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.44ms. Allocated memory is still 257.9MB. Free memory was 227.7MB in the beginning and 226.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 259.28ms. Allocated memory is still 257.9MB. Free memory was 226.7MB in the beginning and 214.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 111.58ms. Allocated memory is still 257.9MB. Free memory was 214.1MB in the beginning and 209.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * TraceAbstraction took 4393.15ms. Allocated memory was 257.9MB in the beginning and 310.4MB in the end (delta: 52.4MB). Free memory was 209.4MB in the beginning and 161.3MB in the end (delta: 48.1MB). Peak memory consumption was 101.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 149]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 964 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 964 mSDsluCounter, 3209 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1282 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 139 IncrementalHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 1927 mSDtfsCounter, 139 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10245occurred in iteration=25, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 2074 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 521 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 524 NumberOfCodeBlocks, 524 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 498 ConstructedInterpolants, 0 QuantifiedInterpolants, 1236 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-01-11 03:30:53,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...