/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/locks/test_locks_8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 15:53:06,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 15:53:06,629 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 15:53:06,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 15:53:06,686 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 15:53:06,686 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 15:53:06,687 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 15:53:06,688 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 15:53:06,690 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 15:53:06,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 15:53:06,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 15:53:06,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 15:53:06,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 15:53:06,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 15:53:06,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 15:53:06,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 15:53:06,695 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 15:53:06,696 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 15:53:06,697 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 15:53:06,698 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 15:53:06,700 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 15:53:06,701 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 15:53:06,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 15:53:06,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 15:53:06,705 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 15:53:06,705 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 15:53:06,705 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 15:53:06,706 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 15:53:06,706 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 15:53:06,707 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 15:53:06,707 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 15:53:06,708 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 15:53:06,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 15:53:06,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 15:53:06,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 15:53:06,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 15:53:06,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 15:53:06,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 15:53:06,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 15:53:06,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 15:53:06,711 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 15:53:06,712 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 15:53:06,726 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 15:53:06,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 15:53:06,727 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 15:53:06,727 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 15:53:06,728 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 15:53:06,728 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 15:53:06,728 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 15:53:06,728 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 15:53:06,728 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 15:53:06,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 15:53:06,728 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 15:53:06,728 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 15:53:06,728 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 15:53:06,729 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 15:53:06,729 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 15:53:06,729 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 15:53:06,729 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 15:53:06,729 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 15:53:06,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 15:53:06,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 15:53:06,729 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 15:53:06,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 15:53:06,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 15:53:06,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 15:53:06,730 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 15:53:06,730 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 15:53:06,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 15:53:06,730 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 15:53:06,730 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 15:53:06,730 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 15:53:06,730 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 15:53:06,730 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 15:53:06,731 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 15:53:06,731 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 15:53:06,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 15:53:06,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 15:53:06,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 15:53:06,908 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 15:53:06,909 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 15:53:06,910 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2022-01-10 15:53:06,959 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8511aec3d/60dd936b49f344598e963bff2e99b585/FLAG273d9403f [2022-01-10 15:53:07,261 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 15:53:07,262 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2022-01-10 15:53:07,268 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8511aec3d/60dd936b49f344598e963bff2e99b585/FLAG273d9403f [2022-01-10 15:53:07,696 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8511aec3d/60dd936b49f344598e963bff2e99b585 [2022-01-10 15:53:07,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 15:53:07,699 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 15:53:07,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 15:53:07,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 15:53:07,704 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 15:53:07,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:53:07" (1/1) ... [2022-01-10 15:53:07,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@342f615b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:07, skipping insertion in model container [2022-01-10 15:53:07,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 03:53:07" (1/1) ... [2022-01-10 15:53:07,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 15:53:07,723 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 15:53:07,860 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_8.c[3218,3231] [2022-01-10 15:53:07,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 15:53:07,871 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 15:53:07,884 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_8.c[3218,3231] [2022-01-10 15:53:07,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 15:53:07,893 INFO L208 MainTranslator]: Completed translation [2022-01-10 15:53:07,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:07 WrapperNode [2022-01-10 15:53:07,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 15:53:07,895 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 15:53:07,895 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 15:53:07,895 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 15:53:07,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:07" (1/1) ... [2022-01-10 15:53:07,906 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:07" (1/1) ... [2022-01-10 15:53:07,920 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 107 [2022-01-10 15:53:07,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 15:53:07,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 15:53:07,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 15:53:07,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 15:53:07,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:07" (1/1) ... [2022-01-10 15:53:07,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:07" (1/1) ... [2022-01-10 15:53:07,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:07" (1/1) ... [2022-01-10 15:53:07,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:07" (1/1) ... [2022-01-10 15:53:07,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:07" (1/1) ... [2022-01-10 15:53:07,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:07" (1/1) ... [2022-01-10 15:53:07,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:07" (1/1) ... [2022-01-10 15:53:07,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 15:53:07,936 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 15:53:07,936 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 15:53:07,936 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 15:53:07,937 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:07" (1/1) ... [2022-01-10 15:53:07,941 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 15:53:07,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 15:53:07,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 15:53:07,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 15:53:07,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 15:53:07,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 15:53:07,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 15:53:07,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 15:53:08,049 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 15:53:08,051 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 15:53:08,152 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 15:53:08,156 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 15:53:08,156 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 15:53:08,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:53:08 BoogieIcfgContainer [2022-01-10 15:53:08,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 15:53:08,158 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 15:53:08,158 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 15:53:08,159 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 15:53:08,161 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:53:08" (1/1) ... [2022-01-10 15:53:08,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 03:53:08 BasicIcfg [2022-01-10 15:53:08,251 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 15:53:08,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 15:53:08,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 15:53:08,254 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 15:53:08,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 03:53:07" (1/4) ... [2022-01-10 15:53:08,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287b4156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:53:08, skipping insertion in model container [2022-01-10 15:53:08,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 03:53:07" (2/4) ... [2022-01-10 15:53:08,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287b4156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 03:53:08, skipping insertion in model container [2022-01-10 15:53:08,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 03:53:08" (3/4) ... [2022-01-10 15:53:08,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287b4156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:53:08, skipping insertion in model container [2022-01-10 15:53:08,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 03:53:08" (4/4) ... [2022-01-10 15:53:08,256 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_8.cTransformedIcfg [2022-01-10 15:53:08,277 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 15:53:08,277 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 15:53:08,329 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 15:53:08,336 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 15:53:08,336 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 15:53:08,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 32 states have (on average 1.875) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:08,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 15:53:08,352 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:08,352 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:53:08,353 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:08,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:08,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1229674130, now seen corresponding path program 1 times [2022-01-10 15:53:08,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:08,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060188927] [2022-01-10 15:53:08,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:08,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:08,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:08,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:08,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060188927] [2022-01-10 15:53:08,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060188927] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:08,500 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:08,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:08,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091084533] [2022-01-10 15:53:08,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:08,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:08,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:08,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:08,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:08,528 INFO L87 Difference]: Start difference. First operand has 34 states, 32 states have (on average 1.875) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 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.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:08,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:08,580 INFO L93 Difference]: Finished difference Result 71 states and 121 transitions. [2022-01-10 15:53:08,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:08,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-01-10 15:53:08,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:08,587 INFO L225 Difference]: With dead ends: 71 [2022-01-10 15:53:08,588 INFO L226 Difference]: Without dead ends: 57 [2022-01-10 15:53:08,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:08,591 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 115 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-10 15:53:08,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 115 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:08,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-01-10 15:53:08,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 39. [2022-01-10 15:53:08,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 38 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:08,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 70 transitions. [2022-01-10 15:53:08,615 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 70 transitions. Word has length 15 [2022-01-10 15:53:08,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:08,615 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 70 transitions. [2022-01-10 15:53:08,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:08,616 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 70 transitions. [2022-01-10 15:53:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 15:53:08,616 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:08,616 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:53:08,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 15:53:08,617 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:08,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:08,617 INFO L85 PathProgramCache]: Analyzing trace with hash -567277229, now seen corresponding path program 1 times [2022-01-10 15:53:08,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:08,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172812644] [2022-01-10 15:53:08,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:08,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:08,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:08,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:08,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172812644] [2022-01-10 15:53:08,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172812644] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:08,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:08,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:08,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960536027] [2022-01-10 15:53:08,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:08,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:08,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:08,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:08,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:08,671 INFO L87 Difference]: Start difference. First operand 39 states and 70 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:08,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:08,692 INFO L93 Difference]: Finished difference Result 94 states and 169 transitions. [2022-01-10 15:53:08,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:08,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-01-10 15:53:08,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:08,693 INFO L225 Difference]: With dead ends: 94 [2022-01-10 15:53:08,693 INFO L226 Difference]: Without dead ends: 57 [2022-01-10 15:53:08,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:08,694 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 38 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 115 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-10 15:53:08,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 115 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:08,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-01-10 15:53:08,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-01-10 15:53:08,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 54 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:08,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 98 transitions. [2022-01-10 15:53:08,704 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 98 transitions. Word has length 15 [2022-01-10 15:53:08,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:08,704 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 98 transitions. [2022-01-10 15:53:08,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:08,704 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 98 transitions. [2022-01-10 15:53:08,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 15:53:08,705 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:08,705 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:53:08,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 15:53:08,705 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:08,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:08,706 INFO L85 PathProgramCache]: Analyzing trace with hash -534775664, now seen corresponding path program 1 times [2022-01-10 15:53:08,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:08,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222372444] [2022-01-10 15:53:08,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:08,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:08,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:08,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:08,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222372444] [2022-01-10 15:53:08,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222372444] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:08,763 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:08,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:08,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922357927] [2022-01-10 15:53:08,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:08,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:08,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:08,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:08,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:08,765 INFO L87 Difference]: Start difference. First operand 55 states and 98 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-10 15:53:08,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:08,782 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2022-01-10 15:53:08,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:08,783 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-10 15:53:08,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:08,784 INFO L225 Difference]: With dead ends: 87 [2022-01-10 15:53:08,784 INFO L226 Difference]: Without dead ends: 60 [2022-01-10 15:53:08,785 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:08,786 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 40 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 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-10 15:53:08,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:08,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-10 15:53:08,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2022-01-10 15:53:08,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.7543859649122806) internal successors, (100), 57 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:08,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 100 transitions. [2022-01-10 15:53:08,792 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 100 transitions. Word has length 16 [2022-01-10 15:53:08,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:08,792 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 100 transitions. [2022-01-10 15:53:08,792 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-10 15:53:08,792 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 100 transitions. [2022-01-10 15:53:08,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 15:53:08,793 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:08,793 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:53:08,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 15:53:08,793 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:08,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:08,794 INFO L85 PathProgramCache]: Analyzing trace with hash -405692945, now seen corresponding path program 1 times [2022-01-10 15:53:08,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:08,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698323351] [2022-01-10 15:53:08,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:08,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:08,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:08,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:08,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698323351] [2022-01-10 15:53:08,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698323351] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:08,853 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:08,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:08,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540764180] [2022-01-10 15:53:08,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:08,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:08,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:08,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:08,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:08,854 INFO L87 Difference]: Start difference. First operand 58 states and 100 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-10 15:53:08,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:08,874 INFO L93 Difference]: Finished difference Result 162 states and 284 transitions. [2022-01-10 15:53:08,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:08,874 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-10 15:53:08,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:08,875 INFO L225 Difference]: With dead ends: 162 [2022-01-10 15:53:08,875 INFO L226 Difference]: Without dead ends: 109 [2022-01-10 15:53:08,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:08,877 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 38 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 103 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-10 15:53:08,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 103 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:08,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-01-10 15:53:08,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2022-01-10 15:53:08,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.7452830188679245) internal successors, (185), 106 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:08,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 185 transitions. [2022-01-10 15:53:08,884 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 185 transitions. Word has length 16 [2022-01-10 15:53:08,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:08,884 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 185 transitions. [2022-01-10 15:53:08,884 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-10 15:53:08,885 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 185 transitions. [2022-01-10 15:53:08,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 15:53:08,885 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:08,885 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:53:08,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 15:53:08,885 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:08,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:08,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1391258414, now seen corresponding path program 1 times [2022-01-10 15:53:08,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:08,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038782281] [2022-01-10 15:53:08,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:08,886 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:08,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:08,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:08,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038782281] [2022-01-10 15:53:08,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038782281] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:08,933 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:08,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:08,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839698245] [2022-01-10 15:53:08,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:08,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:08,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:08,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:08,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:08,934 INFO L87 Difference]: Start difference. First operand 107 states and 185 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-10 15:53:08,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:08,952 INFO L93 Difference]: Finished difference Result 139 states and 239 transitions. [2022-01-10 15:53:08,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:08,953 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-10 15:53:08,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:08,954 INFO L225 Difference]: With dead ends: 139 [2022-01-10 15:53:08,954 INFO L226 Difference]: Without dead ends: 137 [2022-01-10 15:53:08,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:08,955 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 35 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 15:53:08,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 139 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:08,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-01-10 15:53:08,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 107. [2022-01-10 15:53:08,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.7264150943396226) internal successors, (183), 106 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:08,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 183 transitions. [2022-01-10 15:53:08,962 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 183 transitions. Word has length 16 [2022-01-10 15:53:08,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:08,962 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 183 transitions. [2022-01-10 15:53:08,963 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-10 15:53:08,963 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 183 transitions. [2022-01-10 15:53:08,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 15:53:08,963 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:08,963 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:53:08,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 15:53:08,964 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:08,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:08,964 INFO L85 PathProgramCache]: Analyzing trace with hash 308452687, now seen corresponding path program 1 times [2022-01-10 15:53:08,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:08,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197472794] [2022-01-10 15:53:08,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:08,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:08,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:08,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:08,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197472794] [2022-01-10 15:53:08,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197472794] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:08,995 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:08,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:08,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145994805] [2022-01-10 15:53:08,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:08,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:08,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:08,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:08,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:08,996 INFO L87 Difference]: Start difference. First operand 107 states and 183 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-10 15:53:09,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:09,008 INFO L93 Difference]: Finished difference Result 199 states and 343 transitions. [2022-01-10 15:53:09,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:09,009 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-10 15:53:09,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:09,010 INFO L225 Difference]: With dead ends: 199 [2022-01-10 15:53:09,010 INFO L226 Difference]: Without dead ends: 197 [2022-01-10 15:53:09,011 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:09,012 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 32 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 99 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-10 15:53:09,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 99 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:09,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-01-10 15:53:09,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 147. [2022-01-10 15:53:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.7054794520547945) internal successors, (249), 146 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:09,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 249 transitions. [2022-01-10 15:53:09,037 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 249 transitions. Word has length 17 [2022-01-10 15:53:09,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:09,038 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 249 transitions. [2022-01-10 15:53:09,038 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-10 15:53:09,038 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 249 transitions. [2022-01-10 15:53:09,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 15:53:09,039 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:09,039 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 15:53:09,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 15:53:09,039 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:09,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:09,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1488498672, now seen corresponding path program 1 times [2022-01-10 15:53:09,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:09,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442102771] [2022-01-10 15:53:09,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:09,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:09,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:09,094 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:09,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442102771] [2022-01-10 15:53:09,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442102771] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:09,094 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:09,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:09,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586387165] [2022-01-10 15:53:09,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:09,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:09,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:09,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:09,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:09,097 INFO L87 Difference]: Start difference. First operand 147 states and 249 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-10 15:53:09,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:09,118 INFO L93 Difference]: Finished difference Result 347 states and 591 transitions. [2022-01-10 15:53:09,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:09,119 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-10 15:53:09,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:09,120 INFO L225 Difference]: With dead ends: 347 [2022-01-10 15:53:09,120 INFO L226 Difference]: Without dead ends: 205 [2022-01-10 15:53:09,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:09,125 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 36 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 117 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-10 15:53:09,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 117 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:09,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-01-10 15:53:09,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2022-01-10 15:53:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 1.6782178217821782) internal successors, (339), 202 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:09,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 339 transitions. [2022-01-10 15:53:09,138 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 339 transitions. Word has length 17 [2022-01-10 15:53:09,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:09,138 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 339 transitions. [2022-01-10 15:53:09,138 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-10 15:53:09,139 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 339 transitions. [2022-01-10 15:53:09,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 15:53:09,140 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:09,140 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-10 15:53:09,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 15:53:09,140 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:09,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:09,141 INFO L85 PathProgramCache]: Analyzing trace with hash 972130923, now seen corresponding path program 1 times [2022-01-10 15:53:09,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:09,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426856636] [2022-01-10 15:53:09,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:09,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:09,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:09,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:09,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426856636] [2022-01-10 15:53:09,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426856636] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:09,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:09,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:09,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728452711] [2022-01-10 15:53:09,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:09,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:09,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:09,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:09,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:09,167 INFO L87 Difference]: Start difference. First operand 203 states and 339 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-10 15:53:09,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:09,176 INFO L93 Difference]: Finished difference Result 309 states and 513 transitions. [2022-01-10 15:53:09,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:09,177 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-10 15:53:09,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:09,178 INFO L225 Difference]: With dead ends: 309 [2022-01-10 15:53:09,178 INFO L226 Difference]: Without dead ends: 211 [2022-01-10 15:53:09,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:09,179 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 38 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 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-10 15:53:09,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 120 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:09,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-01-10 15:53:09,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2022-01-10 15:53:09,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.6490384615384615) internal successors, (343), 208 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:09,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 343 transitions. [2022-01-10 15:53:09,186 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 343 transitions. Word has length 18 [2022-01-10 15:53:09,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:09,187 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 343 transitions. [2022-01-10 15:53:09,187 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-10 15:53:09,187 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 343 transitions. [2022-01-10 15:53:09,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 15:53:09,188 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:09,188 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-10 15:53:09,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 15:53:09,188 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:09,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:09,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1101213642, now seen corresponding path program 1 times [2022-01-10 15:53:09,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:09,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505881608] [2022-01-10 15:53:09,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:09,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:09,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:09,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:09,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505881608] [2022-01-10 15:53:09,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505881608] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:09,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:09,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:09,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016368492] [2022-01-10 15:53:09,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:09,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:09,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:09,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:09,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:09,222 INFO L87 Difference]: Start difference. First operand 209 states and 343 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-10 15:53:09,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:09,242 INFO L93 Difference]: Finished difference Result 377 states and 625 transitions. [2022-01-10 15:53:09,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:09,243 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-10 15:53:09,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:09,245 INFO L225 Difference]: With dead ends: 377 [2022-01-10 15:53:09,245 INFO L226 Difference]: Without dead ends: 375 [2022-01-10 15:53:09,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:09,248 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 29 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 97 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-10 15:53:09,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 97 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:09,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-01-10 15:53:09,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 293. [2022-01-10 15:53:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 1.6130136986301369) internal successors, (471), 292 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 471 transitions. [2022-01-10 15:53:09,266 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 471 transitions. Word has length 18 [2022-01-10 15:53:09,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:09,266 INFO L470 AbstractCegarLoop]: Abstraction has 293 states and 471 transitions. [2022-01-10 15:53:09,266 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-10 15:53:09,266 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 471 transitions. [2022-01-10 15:53:09,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 15:53:09,268 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:09,268 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-10 15:53:09,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 15:53:09,268 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:09,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:09,269 INFO L85 PathProgramCache]: Analyzing trace with hash -695737717, now seen corresponding path program 1 times [2022-01-10 15:53:09,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:09,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856714844] [2022-01-10 15:53:09,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:09,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:09,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:09,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:09,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856714844] [2022-01-10 15:53:09,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856714844] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:09,298 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:09,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:09,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581989311] [2022-01-10 15:53:09,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:09,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:09,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:09,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:09,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:09,299 INFO L87 Difference]: Start difference. First operand 293 states and 471 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-10 15:53:09,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:09,315 INFO L93 Difference]: Finished difference Result 681 states and 1097 transitions. [2022-01-10 15:53:09,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:09,315 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-10 15:53:09,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:09,317 INFO L225 Difference]: With dead ends: 681 [2022-01-10 15:53:09,317 INFO L226 Difference]: Without dead ends: 399 [2022-01-10 15:53:09,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:09,319 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 35 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 118 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-10 15:53:09,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 118 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:09,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-01-10 15:53:09,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 397. [2022-01-10 15:53:09,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.5833333333333333) internal successors, (627), 396 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:09,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 627 transitions. [2022-01-10 15:53:09,334 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 627 transitions. Word has length 18 [2022-01-10 15:53:09,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:09,334 INFO L470 AbstractCegarLoop]: Abstraction has 397 states and 627 transitions. [2022-01-10 15:53:09,334 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-10 15:53:09,334 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 627 transitions. [2022-01-10 15:53:09,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 15:53:09,336 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:09,336 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-10 15:53:09,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 15:53:09,337 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:09,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:09,337 INFO L85 PathProgramCache]: Analyzing trace with hash -222083124, now seen corresponding path program 1 times [2022-01-10 15:53:09,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:09,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476013089] [2022-01-10 15:53:09,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:09,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:09,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:09,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:09,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476013089] [2022-01-10 15:53:09,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476013089] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:09,366 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:09,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:09,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477658298] [2022-01-10 15:53:09,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:09,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:09,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:09,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:09,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:09,367 INFO L87 Difference]: Start difference. First operand 397 states and 627 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-10 15:53:09,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:09,380 INFO L93 Difference]: Finished difference Result 597 states and 937 transitions. [2022-01-10 15:53:09,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:09,381 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-10 15:53:09,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:09,382 INFO L225 Difference]: With dead ends: 597 [2022-01-10 15:53:09,382 INFO L226 Difference]: Without dead ends: 407 [2022-01-10 15:53:09,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:09,383 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 37 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 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-10 15:53:09,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 116 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:09,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-01-10 15:53:09,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2022-01-10 15:53:09,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 1.551980198019802) internal successors, (627), 404 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:09,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 627 transitions. [2022-01-10 15:53:09,392 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 627 transitions. Word has length 19 [2022-01-10 15:53:09,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:09,392 INFO L470 AbstractCegarLoop]: Abstraction has 405 states and 627 transitions. [2022-01-10 15:53:09,392 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-10 15:53:09,392 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 627 transitions. [2022-01-10 15:53:09,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 15:53:09,393 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:09,393 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-10 15:53:09,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 15:53:09,393 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:09,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:09,394 INFO L85 PathProgramCache]: Analyzing trace with hash -93000405, now seen corresponding path program 1 times [2022-01-10 15:53:09,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:09,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688512706] [2022-01-10 15:53:09,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:09,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:09,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:09,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:09,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688512706] [2022-01-10 15:53:09,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688512706] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:09,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:09,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:09,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558182599] [2022-01-10 15:53:09,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:09,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:09,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:09,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:09,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:09,428 INFO L87 Difference]: Start difference. First operand 405 states and 627 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-10 15:53:09,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:09,441 INFO L93 Difference]: Finished difference Result 713 states and 1117 transitions. [2022-01-10 15:53:09,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:09,442 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-10 15:53:09,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:09,444 INFO L225 Difference]: With dead ends: 713 [2022-01-10 15:53:09,444 INFO L226 Difference]: Without dead ends: 711 [2022-01-10 15:53:09,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:09,445 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 26 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 95 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-10 15:53:09,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 95 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:09,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-01-10 15:53:09,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 581. [2022-01-10 15:53:09,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 1.5086206896551724) internal successors, (875), 580 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:09,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 875 transitions. [2022-01-10 15:53:09,457 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 875 transitions. Word has length 19 [2022-01-10 15:53:09,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:09,457 INFO L470 AbstractCegarLoop]: Abstraction has 581 states and 875 transitions. [2022-01-10 15:53:09,458 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-10 15:53:09,458 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 875 transitions. [2022-01-10 15:53:09,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 15:53:09,459 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:09,459 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-10 15:53:09,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 15:53:09,459 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:09,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:09,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1889951764, now seen corresponding path program 1 times [2022-01-10 15:53:09,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:09,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934544896] [2022-01-10 15:53:09,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:09,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:09,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:09,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:09,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934544896] [2022-01-10 15:53:09,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934544896] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:09,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:09,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:09,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570245957] [2022-01-10 15:53:09,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:09,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:09,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:09,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:09,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:09,494 INFO L87 Difference]: Start difference. First operand 581 states and 875 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-10 15:53:09,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:09,510 INFO L93 Difference]: Finished difference Result 1337 states and 2013 transitions. [2022-01-10 15:53:09,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:09,510 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-10 15:53:09,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:09,513 INFO L225 Difference]: With dead ends: 1337 [2022-01-10 15:53:09,514 INFO L226 Difference]: Without dead ends: 775 [2022-01-10 15:53:09,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:09,515 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 34 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 119 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-10 15:53:09,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 119 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:09,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2022-01-10 15:53:09,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 773. [2022-01-10 15:53:09,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.4753886010362693) internal successors, (1139), 772 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:09,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1139 transitions. [2022-01-10 15:53:09,532 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1139 transitions. Word has length 19 [2022-01-10 15:53:09,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:09,532 INFO L470 AbstractCegarLoop]: Abstraction has 773 states and 1139 transitions. [2022-01-10 15:53:09,532 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-10 15:53:09,533 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1139 transitions. [2022-01-10 15:53:09,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 15:53:09,534 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:09,534 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-10 15:53:09,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 15:53:09,534 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:09,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:09,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1411987207, now seen corresponding path program 1 times [2022-01-10 15:53:09,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:09,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783341093] [2022-01-10 15:53:09,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:09,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:09,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:09,569 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:09,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783341093] [2022-01-10 15:53:09,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783341093] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:09,570 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:09,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:09,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381328534] [2022-01-10 15:53:09,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:09,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:09,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:09,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:09,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:09,571 INFO L87 Difference]: Start difference. First operand 773 states and 1139 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-10 15:53:09,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:09,588 INFO L93 Difference]: Finished difference Result 1161 states and 1701 transitions. [2022-01-10 15:53:09,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:09,589 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-10 15:53:09,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:09,591 INFO L225 Difference]: With dead ends: 1161 [2022-01-10 15:53:09,592 INFO L226 Difference]: Without dead ends: 791 [2022-01-10 15:53:09,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:09,597 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 36 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 112 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-10 15:53:09,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 112 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:09,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2022-01-10 15:53:09,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 789. [2022-01-10 15:53:09,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.4454314720812182) internal successors, (1139), 788 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:09,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1139 transitions. [2022-01-10 15:53:09,615 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1139 transitions. Word has length 20 [2022-01-10 15:53:09,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:09,615 INFO L470 AbstractCegarLoop]: Abstraction has 789 states and 1139 transitions. [2022-01-10 15:53:09,616 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-10 15:53:09,616 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1139 transitions. [2022-01-10 15:53:09,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 15:53:09,618 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:09,618 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-10 15:53:09,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 15:53:09,618 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:09,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:09,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1541069926, now seen corresponding path program 1 times [2022-01-10 15:53:09,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:09,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556407363] [2022-01-10 15:53:09,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:09,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:09,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:09,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:09,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556407363] [2022-01-10 15:53:09,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556407363] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:09,647 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:09,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:09,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516554022] [2022-01-10 15:53:09,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:09,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:09,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:09,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:09,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:09,649 INFO L87 Difference]: Start difference. First operand 789 states and 1139 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-10 15:53:09,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:09,669 INFO L93 Difference]: Finished difference Result 1353 states and 1973 transitions. [2022-01-10 15:53:09,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:09,669 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-10 15:53:09,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:09,673 INFO L225 Difference]: With dead ends: 1353 [2022-01-10 15:53:09,673 INFO L226 Difference]: Without dead ends: 1351 [2022-01-10 15:53:09,675 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:09,676 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 23 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 93 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-10 15:53:09,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 93 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:09,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2022-01-10 15:53:09,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1157. [2022-01-10 15:53:09,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.4005190311418685) internal successors, (1619), 1156 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:09,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1619 transitions. [2022-01-10 15:53:09,725 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1619 transitions. Word has length 20 [2022-01-10 15:53:09,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:09,725 INFO L470 AbstractCegarLoop]: Abstraction has 1157 states and 1619 transitions. [2022-01-10 15:53:09,725 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-10 15:53:09,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1619 transitions. [2022-01-10 15:53:09,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 15:53:09,726 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:09,733 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-10 15:53:09,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 15:53:09,733 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:09,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:09,734 INFO L85 PathProgramCache]: Analyzing trace with hash -255881433, now seen corresponding path program 1 times [2022-01-10 15:53:09,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:09,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082479879] [2022-01-10 15:53:09,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:09,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:09,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:09,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082479879] [2022-01-10 15:53:09,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082479879] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:09,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:09,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:09,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315810319] [2022-01-10 15:53:09,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:09,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:09,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:09,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:09,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:09,764 INFO L87 Difference]: Start difference. First operand 1157 states and 1619 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-10 15:53:09,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:09,791 INFO L93 Difference]: Finished difference Result 2633 states and 3669 transitions. [2022-01-10 15:53:09,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:09,791 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-10 15:53:09,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:09,796 INFO L225 Difference]: With dead ends: 2633 [2022-01-10 15:53:09,796 INFO L226 Difference]: Without dead ends: 1511 [2022-01-10 15:53:09,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:09,797 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 33 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 120 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-10 15:53:09,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 120 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:09,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2022-01-10 15:53:09,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1509. [2022-01-10 15:53:09,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1508 states have (on average 1.360079575596817) internal successors, (2051), 1508 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:09,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2051 transitions. [2022-01-10 15:53:09,834 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2051 transitions. Word has length 20 [2022-01-10 15:53:09,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:09,834 INFO L470 AbstractCegarLoop]: Abstraction has 1509 states and 2051 transitions. [2022-01-10 15:53:09,834 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-10 15:53:09,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2051 transitions. [2022-01-10 15:53:09,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 15:53:09,836 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:09,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] [2022-01-10 15:53:09,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 15:53:09,836 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:09,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:09,836 INFO L85 PathProgramCache]: Analyzing trace with hash 528560040, now seen corresponding path program 1 times [2022-01-10 15:53:09,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:09,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513713933] [2022-01-10 15:53:09,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:09,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:09,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-10 15:53:09,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:09,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513713933] [2022-01-10 15:53:09,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513713933] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:09,855 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:09,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:09,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638066654] [2022-01-10 15:53:09,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:09,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:09,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:09,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:09,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:09,856 INFO L87 Difference]: Start difference. First operand 1509 states and 2051 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-10 15:53:09,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:09,882 INFO L93 Difference]: Finished difference Result 2265 states and 3061 transitions. [2022-01-10 15:53:09,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:09,883 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-10 15:53:09,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:09,887 INFO L225 Difference]: With dead ends: 2265 [2022-01-10 15:53:09,887 INFO L226 Difference]: Without dead ends: 1543 [2022-01-10 15:53:09,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:09,889 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 35 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 108 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-10 15:53:09,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 108 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:09,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2022-01-10 15:53:09,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1541. [2022-01-10 15:53:09,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1540 states have (on average 1.3318181818181818) internal successors, (2051), 1540 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:09,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2051 transitions. [2022-01-10 15:53:09,925 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2051 transitions. Word has length 21 [2022-01-10 15:53:09,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:09,926 INFO L470 AbstractCegarLoop]: Abstraction has 1541 states and 2051 transitions. [2022-01-10 15:53:09,926 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-10 15:53:09,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2051 transitions. [2022-01-10 15:53:09,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 15:53:09,928 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:09,928 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-10 15:53:09,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 15:53:09,928 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:09,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:09,928 INFO L85 PathProgramCache]: Analyzing trace with hash 657642759, now seen corresponding path program 1 times [2022-01-10 15:53:09,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:09,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312896524] [2022-01-10 15:53:09,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:09,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:09,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:09,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:09,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312896524] [2022-01-10 15:53:09,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312896524] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:09,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:09,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:09,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537930017] [2022-01-10 15:53:09,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:09,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:09,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:09,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:09,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:09,947 INFO L87 Difference]: Start difference. First operand 1541 states and 2051 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-10 15:53:09,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:09,989 INFO L93 Difference]: Finished difference Result 2569 states and 3429 transitions. [2022-01-10 15:53:09,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:09,990 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-10 15:53:09,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:09,996 INFO L225 Difference]: With dead ends: 2569 [2022-01-10 15:53:09,996 INFO L226 Difference]: Without dead ends: 2567 [2022-01-10 15:53:09,999 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:09,999 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 20 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 91 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-10 15:53:09,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 91 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:10,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2567 states. [2022-01-10 15:53:10,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2567 to 2309. [2022-01-10 15:53:10,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 2308 states have (on average 1.290727902946274) internal successors, (2979), 2308 states have internal predecessors, (2979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 2979 transitions. [2022-01-10 15:53:10,052 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 2979 transitions. Word has length 21 [2022-01-10 15:53:10,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:10,052 INFO L470 AbstractCegarLoop]: Abstraction has 2309 states and 2979 transitions. [2022-01-10 15:53:10,052 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-10 15:53:10,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 2979 transitions. [2022-01-10 15:53:10,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 15:53:10,054 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:10,054 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-10 15:53:10,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 15:53:10,055 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:10,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:10,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1139308600, now seen corresponding path program 1 times [2022-01-10 15:53:10,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:10,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076093657] [2022-01-10 15:53:10,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:10,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:10,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:10,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:10,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076093657] [2022-01-10 15:53:10,071 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076093657] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:10,071 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:10,071 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:10,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703449918] [2022-01-10 15:53:10,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:10,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:10,072 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:10,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:10,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:10,073 INFO L87 Difference]: Start difference. First operand 2309 states and 2979 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-10 15:53:10,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:10,131 INFO L93 Difference]: Finished difference Result 5193 states and 6629 transitions. [2022-01-10 15:53:10,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:10,131 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-10 15:53:10,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:10,138 INFO L225 Difference]: With dead ends: 5193 [2022-01-10 15:53:10,138 INFO L226 Difference]: Without dead ends: 2951 [2022-01-10 15:53:10,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-10 15:53:10,141 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 32 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 121 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-10 15:53:10,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 121 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:10,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2022-01-10 15:53:10,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2949. [2022-01-10 15:53:10,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2948 states have (on average 1.2384667571234735) internal successors, (3651), 2948 states have internal predecessors, (3651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 3651 transitions. [2022-01-10 15:53:10,209 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 3651 transitions. Word has length 21 [2022-01-10 15:53:10,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:10,209 INFO L470 AbstractCegarLoop]: Abstraction has 2949 states and 3651 transitions. [2022-01-10 15:53:10,209 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-10 15:53:10,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 3651 transitions. [2022-01-10 15:53:10,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 15:53:10,212 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:10,212 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-10 15:53:10,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 15:53:10,212 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:10,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:10,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1087878237, now seen corresponding path program 1 times [2022-01-10 15:53:10,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:10,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800029764] [2022-01-10 15:53:10,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:10,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:10,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:10,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:10,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800029764] [2022-01-10 15:53:10,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800029764] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:10,231 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:10,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:10,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244674844] [2022-01-10 15:53:10,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:10,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:10,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:10,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:10,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:10,232 INFO L87 Difference]: Start difference. First operand 2949 states and 3651 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-10 15:53:10,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:10,279 INFO L93 Difference]: Finished difference Result 4425 states and 5445 transitions. [2022-01-10 15:53:10,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:10,280 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-10 15:53:10,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:10,286 INFO L225 Difference]: With dead ends: 4425 [2022-01-10 15:53:10,287 INFO L226 Difference]: Without dead ends: 3015 [2022-01-10 15:53:10,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:10,288 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 34 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 104 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-10 15:53:10,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 104 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:10,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2022-01-10 15:53:10,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 3013. [2022-01-10 15:53:10,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3013 states, 3012 states have (on average 1.2121513944223108) internal successors, (3651), 3012 states have internal predecessors, (3651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 3013 states and 3651 transitions. [2022-01-10 15:53:10,345 INFO L78 Accepts]: Start accepts. Automaton has 3013 states and 3651 transitions. Word has length 22 [2022-01-10 15:53:10,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:10,345 INFO L470 AbstractCegarLoop]: Abstraction has 3013 states and 3651 transitions. [2022-01-10 15:53:10,345 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-10 15:53:10,345 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 3651 transitions. [2022-01-10 15:53:10,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 15:53:10,348 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:10,348 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-10 15:53:10,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 15:53:10,348 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:10,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:10,348 INFO L85 PathProgramCache]: Analyzing trace with hash -958795518, now seen corresponding path program 1 times [2022-01-10 15:53:10,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:10,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055360912] [2022-01-10 15:53:10,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:10,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:10,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:10,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:10,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055360912] [2022-01-10 15:53:10,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055360912] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:10,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:10,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:10,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148725265] [2022-01-10 15:53:10,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:10,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:10,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:10,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:10,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:10,363 INFO L87 Difference]: Start difference. First operand 3013 states and 3651 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-10 15:53:10,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:10,414 INFO L93 Difference]: Finished difference Result 4871 states and 5828 transitions. [2022-01-10 15:53:10,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:10,415 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-10 15:53:10,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:10,426 INFO L225 Difference]: With dead ends: 4871 [2022-01-10 15:53:10,426 INFO L226 Difference]: Without dead ends: 4869 [2022-01-10 15:53:10,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:10,429 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 16 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 88 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-10 15:53:10,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 88 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:10,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4869 states. [2022-01-10 15:53:10,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4869 to 4613. [2022-01-10 15:53:10,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4613 states, 4612 states have (on average 1.180182133564614) internal successors, (5443), 4612 states have internal predecessors, (5443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 15:53:10,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4613 states to 4613 states and 5443 transitions. [2022-01-10 15:53:10,513 INFO L78 Accepts]: Start accepts. Automaton has 4613 states and 5443 transitions. Word has length 22 [2022-01-10 15:53:10,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:10,514 INFO L470 AbstractCegarLoop]: Abstraction has 4613 states and 5443 transitions. [2022-01-10 15:53:10,514 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-10 15:53:10,514 INFO L276 IsEmpty]: Start isEmpty. Operand 4613 states and 5443 transitions. [2022-01-10 15:53:10,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 15:53:10,518 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 15:53:10,518 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-10 15:53:10,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 15:53:10,518 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 15:53:10,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 15:53:10,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1539220419, now seen corresponding path program 1 times [2022-01-10 15:53:10,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 15:53:10,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204888108] [2022-01-10 15:53:10,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 15:53:10,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 15:53:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 15:53:10,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 15:53:10,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 15:53:10,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204888108] [2022-01-10 15:53:10,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204888108] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 15:53:10,540 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 15:53:10,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 15:53:10,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104188634] [2022-01-10 15:53:10,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 15:53:10,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 15:53:10,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 15:53:10,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 15:53:10,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:10,541 INFO L87 Difference]: Start difference. First operand 4613 states and 5443 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-10 15:53:10,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 15:53:10,610 INFO L93 Difference]: Finished difference Result 10245 states and 11843 transitions. [2022-01-10 15:53:10,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 15:53:10,610 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-10 15:53:10,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 15:53:10,611 INFO L225 Difference]: With dead ends: 10245 [2022-01-10 15:53:10,611 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 15:53:10,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 15:53:10,619 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 30 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 120 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-10 15:53:10,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 120 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 15:53:10,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 15:53:10,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 15:53:10,619 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-10 15:53:10,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 15:53:10,619 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-01-10 15:53:10,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 15:53:10,619 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 15:53:10,620 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-10 15:53:10,620 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 15:53:10,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 15:53:10,622 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 15:53:10,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 15:53:10,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 15:53:10,630 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 15:53:10,630 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 15:53:10,630 INFO L861 garLoopResultBuilder]: At program point L127-1(lines 35 132) the Hoare annotation is: true [2022-01-10 15:53:10,630 INFO L861 garLoopResultBuilder]: At program point L133(lines 7 137) the Hoare annotation is: true [2022-01-10 15:53:10,630 INFO L858 garLoopResultBuilder]: For program point L37(lines 37 39) no Hoare annotation was computed. [2022-01-10 15:53:10,630 INFO L861 garLoopResultBuilder]: At program point L136(lines 6 137) the Hoare annotation is: true [2022-01-10 15:53:10,630 INFO L858 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2022-01-10 15:53:10,631 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 15:53:10,631 INFO L858 garLoopResultBuilder]: For program point L58-2(lines 35 132) no Hoare annotation was computed. [2022-01-10 15:53:10,631 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 15:53:10,631 INFO L858 garLoopResultBuilder]: For program point L62-1(lines 35 132) no Hoare annotation was computed. [2022-01-10 15:53:10,631 INFO L858 garLoopResultBuilder]: For program point L66-1(lines 35 132) no Hoare annotation was computed. [2022-01-10 15:53:10,631 INFO L858 garLoopResultBuilder]: For program point L70-1(lines 35 132) no Hoare annotation was computed. [2022-01-10 15:53:10,631 INFO L858 garLoopResultBuilder]: For program point L74-1(lines 35 132) no Hoare annotation was computed. [2022-01-10 15:53:10,631 INFO L858 garLoopResultBuilder]: For program point L78-1(lines 35 132) no Hoare annotation was computed. [2022-01-10 15:53:10,632 INFO L858 garLoopResultBuilder]: For program point L82-1(lines 35 132) no Hoare annotation was computed. [2022-01-10 15:53:10,632 INFO L858 garLoopResultBuilder]: For program point L86-1(lines 35 132) no Hoare annotation was computed. [2022-01-10 15:53:10,632 INFO L858 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2022-01-10 15:53:10,633 INFO L858 garLoopResultBuilder]: For program point L92-1(lines 35 132) no Hoare annotation was computed. [2022-01-10 15:53:10,633 INFO L854 garLoopResultBuilder]: At program point L128-1(lines 7 137) the Hoare annotation is: false [2022-01-10 15:53:10,633 INFO L858 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2022-01-10 15:53:10,633 INFO L858 garLoopResultBuilder]: For program point L97-1(lines 35 132) no Hoare annotation was computed. [2022-01-10 15:53:10,633 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 135) no Hoare annotation was computed. [2022-01-10 15:53:10,633 INFO L858 garLoopResultBuilder]: For program point L103(line 103) no Hoare annotation was computed. [2022-01-10 15:53:10,633 INFO L858 garLoopResultBuilder]: For program point L102-1(lines 35 132) no Hoare annotation was computed. [2022-01-10 15:53:10,633 INFO L858 garLoopResultBuilder]: For program point L108(line 108) no Hoare annotation was computed. [2022-01-10 15:53:10,633 INFO L858 garLoopResultBuilder]: For program point L107-1(lines 35 132) no Hoare annotation was computed. [2022-01-10 15:53:10,633 INFO L858 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-01-10 15:53:10,634 INFO L858 garLoopResultBuilder]: For program point L112-1(lines 35 132) no Hoare annotation was computed. [2022-01-10 15:53:10,634 INFO L858 garLoopResultBuilder]: For program point L118(line 118) no Hoare annotation was computed. [2022-01-10 15:53:10,634 INFO L858 garLoopResultBuilder]: For program point L117-1(lines 35 132) no Hoare annotation was computed. [2022-01-10 15:53:10,634 INFO L858 garLoopResultBuilder]: For program point L123(line 123) no Hoare annotation was computed. [2022-01-10 15:53:10,634 INFO L858 garLoopResultBuilder]: For program point L122-1(lines 35 132) no Hoare annotation was computed. [2022-01-10 15:53:10,634 INFO L858 garLoopResultBuilder]: For program point L128(line 128) no Hoare annotation was computed. [2022-01-10 15:53:10,636 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] [2022-01-10 15:53:10,639 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 15:53:10,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 03:53:10 BasicIcfg [2022-01-10 15:53:10,653 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 15:53:10,654 INFO L158 Benchmark]: Toolchain (without parser) took 2954.85ms. Allocated memory was 255.9MB in the beginning and 355.5MB in the end (delta: 99.6MB). Free memory was 199.4MB in the beginning and 127.1MB in the end (delta: 72.3MB). Peak memory consumption was 172.9MB. Max. memory is 8.0GB. [2022-01-10 15:53:10,654 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 255.9MB. Free memory is still 215.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 15:53:10,654 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.37ms. Allocated memory was 255.9MB in the beginning and 355.5MB in the end (delta: 99.6MB). Free memory was 199.2MB in the beginning and 326.7MB in the end (delta: -127.5MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. [2022-01-10 15:53:10,655 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.59ms. Allocated memory is still 355.5MB. Free memory was 326.2MB in the beginning and 324.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 15:53:10,655 INFO L158 Benchmark]: Boogie Preprocessor took 14.55ms. Allocated memory is still 355.5MB. Free memory was 324.6MB in the beginning and 323.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 15:53:10,655 INFO L158 Benchmark]: RCFGBuilder took 222.02ms. Allocated memory is still 355.5MB. Free memory was 323.5MB in the beginning and 311.5MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-10 15:53:10,655 INFO L158 Benchmark]: IcfgTransformer took 92.74ms. Allocated memory is still 355.5MB. Free memory was 311.5MB in the beginning and 307.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-01-10 15:53:10,655 INFO L158 Benchmark]: TraceAbstraction took 2401.14ms. Allocated memory is still 355.5MB. Free memory was 306.8MB in the beginning and 127.1MB in the end (delta: 179.7MB). Peak memory consumption was 180.8MB. Max. memory is 8.0GB. [2022-01-10 15:53:10,661 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 255.9MB. Free memory is still 215.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 192.37ms. Allocated memory was 255.9MB in the beginning and 355.5MB in the end (delta: 99.6MB). Free memory was 199.2MB in the beginning and 326.7MB in the end (delta: -127.5MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.59ms. Allocated memory is still 355.5MB. Free memory was 326.2MB in the beginning and 324.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 14.55ms. Allocated memory is still 355.5MB. Free memory was 324.6MB in the beginning and 323.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 222.02ms. Allocated memory is still 355.5MB. Free memory was 323.5MB in the beginning and 311.5MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 92.74ms. Allocated memory is still 355.5MB. Free memory was 311.5MB in the beginning and 307.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * TraceAbstraction took 2401.14ms. Allocated memory is still 355.5MB. Free memory was 306.8MB in the beginning and 127.1MB in the end (delta: 179.7MB). Peak memory consumption was 180.8MB. 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: 135]: 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, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 719 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 719 mSDsluCounter, 2438 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 963 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 117 IncrementalHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 1475 mSDtfsCounter, 117 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4613occurred in iteration=21, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 265 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.4s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 950 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-01-10 15:53:10,697 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...